Vertex cover: further observations and further improvements
Journal of Algorithms
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
Theory of Computing Systems
Theoretical Computer Science - Parameterized and exact computation
Invitation to data reduction and problem kernelization
ACM SIGACT News
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
SIAM Journal on Computing
Infeasibility of instance compression and succinct PCPs for NP
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Algorithmica - Parameterized and Exact Algorithms
Improved Parameterized Algorithms for Weighted 3-Set Packing
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On Problems without Polynomial Kernels (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Faster Algebraic Algorithms for Path and Packing Problems
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A Parameterized Perspective on Packing Paths of Length Two
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
A quadratic kernel for feedback vertex set
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Applying Modular Decomposition to Parameterized Cluster Editing Problems
Theory of Computing Systems
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
A cubic kernel for feedback vertex set
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An O*(3.523k) parameterized algorithm for 3-set packing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Efficient parameterized preprocessing for cluster editing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Kernelization algorithms for d-hitting set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A more effective linear kernelization for Cluster Editing
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Parameterized Complexity
Kernelization for cycle transversal problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Preprocessing of min ones problems: a dichotomy
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Linear problem kernels for planar graph problems with small distance property
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Parameterized complexity of vertex deletion into perfect graph classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Kernelization of packing problems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Polynomial kernels for hard problems on disk graphs
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
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
Planar graph vertex partition for linear problem kernels
Journal of Computer and System Sciences
Packing paths: Recycling saves time
Discrete Applied Mathematics
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical Computer Science
| Hi-index | 0.00 |
For a fixed connected graph H, we consider the NP-complete H-packing problem, where, given an undirected graph G and an integer k e 0, one has to decide whether there exist k vertex-disjoint copies of H in G. We give a problem kernel of O(k |V(H)| 1) vertices, that is, we provide a polynomial-time algorithm that reduces a given instance of H-packing to an equivalent instance with at most O(k |V(H)| 1) vertices. In particular, this result specialized to H being a triangle improves a problem kernel for Triangle Packing from O(k 3) vertices by Fellows et al. [WG 2004] to O(k 2) vertices.