Packings by complete bipartite graphs
SIAM Journal on Algebraic and Discrete Methods
SIAM Journal on Discrete Mathematics
Maximum bounded H-matching is Max SNP-complete
Information Processing Letters
Journal of the ACM (JACM)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Reducing to independent set structure: the case of k-internal spanning tree
Nordic Journal of Computing
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A Problem Kernelization for Graph Packing
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An improved parameterized algorithm for a generalized matching problem
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
Matching and P2-packing: weighted versions
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Kernelization of packing problems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Greedy localization and color-coding: improved matching and packing algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Kernels for packing and covering problems
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Parameterized complexity of induced h-matching on claw-free graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Matching and Weighted P2-Packing: Algorithms and Kernels
Theoretical Computer Science
| Hi-index | 0.00 |
The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if H has more than two vertices in some connected component. In the framework of parameterized complexity, we analyze a particular family of instances of this problem, namely the packing of stars. We give a quadratic kernel for packing k copies of H = K1,s. When we consider the special case of s = 2, i.e. H being a star with two leaves, we give a linear kernel and an algorithm running in time O(25.301kk2.5 + n3).