Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Vertex cover: further observations and further improvements
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Invitation to data reduction and problem kernelization
ACM SIGACT News
The parameterized complexity of the induced matching problem in planar graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
A general data reduction scheme for domination in graphs
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Parametric duality and kernelization: lower bounds and upper bounds on kernel size
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Parameterized complexity of generalized vertex cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Fixed-parameter tractability results for full-degree spanning tree and its dual
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
Linear Kernel for Planar Connected Dominating Set
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On problems without polynomial kernels
Journal of Computer and System Sciences
The parameterized complexity of the induced matching problem in planar graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Capacitated domination and covering: a parameterized perspective
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Kernelization for cycle transversal problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Approximation algorithms for the capacitated domination problem
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
On the small cycle transversal of planar graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A linear kernel for a planar connected dominating set
Theoretical Computer Science
On the small cycle transversal of planar graphs
Theoretical Computer Science
An improved kernel for planar connected dominating set
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
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
Fast sub-exponential algorithms and compactness in planar graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Connectivity is not a limit for kernelization: planar connected dominating set
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Polynomial kernels for hard problems on disk graphs
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Kernelization for cycle transversal problems
Discrete Applied Mathematics
Simpler linear-time kernelization for planar dominating set
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Linear-Time computation of a linear problem kernel for dominating set on planar graphs
IPEC'11 Proceedings of the 6th 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
Nonblocker in h-minor free graphs: kernelization meets discharging
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A 9k kernel for nonseparating independent set in planar graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Planar graph vertex partition for linear problem kernels
Journal of Computer and System Sciences
Note: Towards optimal kernel for connected vertex cover in planar graphs
Discrete Applied Mathematics
Linear kernels and single-exponential algorithms via protrusion decompositions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Improved linear problem kernel for planar connected dominating set
Theoretical Computer Science
A 9k kernel for nonseparating independent set in planar graphs
Theoretical Computer Science
Towards optimal kernel for edge-disjoint triangle packing
Information Processing Letters
| Hi-index | 0.00 |
We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several concrete case studies, giving new kernelization results for CONNECTED VERTEX COVER, MINIMUM EDGE DOMINATING SET, MAXIMUM TRIANGLE PACKING, AND EFFICIENT DOMINATING Set on planar graphs. On the route to these results, we present effective, problem-specific data reduction rules that are useful in any approach attacking the computational intractability of these problems.