Add to ORKGThis paper first appeared at the conference ’First International Workshop on Parameterized And Exact Computation’ in September 2004. It was later invited and accepted to a special use of the Journal of Theoretical Computer Science where it is due to appear [PS04].Preprin
AbstractThe maximum tree packing problem asks to pack the greatest possible number of vertex-disjoin...
Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomor...
Given an undirected graph G=(V,E) and a fixed pattern graph H with k vertices, we consider the H-Tra...
The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if ...
The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if ...
AbstractThe problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-comp...
Let ℋ be a family of graphs. An ℋ-packing of a graph G is a set {G1, G2,…,Gk} of disjoint subgraphs ...
AbstractGiven a (possibly infinite) family S of oriented stars, an S-packing in a digraph D is a col...
AbstractGiven a (possibly infinite) family S of oriented stars, an S-packing in a digraph D is a col...
By a T-star we mean a complete bipartite graph K_{1,t} for some t <= T. For an undirected graph G, a...
AbstractWe consider simple undirected graphs. An edge subset A of G is called an induced n-star pack...
Given a (possibly infinite) family S of oriented stars, an S-packing in a digraph D is a collection ...
This paper appeared at the conference ’30th International Workshop of Graph-Theoretic Concepts in Co...
AbstractWe consider simple undirected graphs. An edge subset A of G is called an induced n-star pack...
In PATH SET PACKING, the input is an undirected graph $G$, a collection $\cal P$ of simple paths in ...
AbstractThe maximum tree packing problem asks to pack the greatest possible number of vertex-disjoin...
Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomor...
Given an undirected graph G=(V,E) and a fixed pattern graph H with k vertices, we consider the H-Tra...
The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if ...
The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if ...
AbstractThe problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-comp...
Let ℋ be a family of graphs. An ℋ-packing of a graph G is a set {G1, G2,…,Gk} of disjoint subgraphs ...
AbstractGiven a (possibly infinite) family S of oriented stars, an S-packing in a digraph D is a col...
AbstractGiven a (possibly infinite) family S of oriented stars, an S-packing in a digraph D is a col...
By a T-star we mean a complete bipartite graph K_{1,t} for some t <= T. For an undirected graph G, a...
AbstractWe consider simple undirected graphs. An edge subset A of G is called an induced n-star pack...
Given a (possibly infinite) family S of oriented stars, an S-packing in a digraph D is a collection ...
This paper appeared at the conference ’30th International Workshop of Graph-Theoretic Concepts in Co...
AbstractWe consider simple undirected graphs. An edge subset A of G is called an induced n-star pack...
In PATH SET PACKING, the input is an undirected graph $G$, a collection $\cal P$ of simple paths in ...
AbstractThe maximum tree packing problem asks to pack the greatest possible number of vertex-disjoin...
Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomor...
Given an undirected graph G=(V,E) and a fixed pattern graph H with k vertices, we consider the H-Tra...