New results on induced matchings
Discrete Applied Mathematics
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Finding a maximum induced matching in weakly chordal graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Bipartite Domination and Simultaneous Matroid Covers
SIAM Journal on Discrete Mathematics
Some results on graphs without long induced paths
Information Processing Letters
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
A refined search tree technique for Dominating Set on planar graphs
Journal of Computer and System Sciences
Invitation to data reduction and problem kernelization
ACM SIGACT News
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
SIAM Journal on Computing
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Tighter approximations for maximum induced matchings in regular graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
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
Linear problem kernels for NP-hard problems on planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Linear kernelizations for restricted 3-Hitting Set problems
Information Processing Letters
Linear Kernel for Planar Connected Dominating Set
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A linear kernel for a planar connected dominating set
Theoretical Computer Science
Linear problem kernels for NP-hard problems on planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Given a graph G and an integer k ≥ 0, the NP-complete INDUCED MATCHING problem asks for an edge subset M such that M is a matching and no two edges of M are joined by an edge of G. The complexity of this problem on general graphs as well as on many restricted graph classes has been studied intensively. However, little is known about the parameterized complexity of this problem. Our main contribution is to show that INDUCED MATCHING, which is W[1]-hard in general, admits a linear problem kernel on planar graphs. Additionally, we generalize a known algorithm for Induced Matching on trees to graphs of bounded treewidth using an improved dynamic programming approach.