The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Irredundancy in circular arc graphs
Discrete Applied Mathematics
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Selected papers from the second Krakow conference on Graph theory
New results on induced matchings
Discrete Applied Mathematics
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
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)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
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
Algorithmica - Parameterized and Exact Algorithms
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
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
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
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
The lost continent of polynomial time: preprocessing and kernelization
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
Linear problem kernels for NP-hard problems on planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized Complexity
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
Improved induced matchings in sparse graphs
Discrete Applied Mathematics
Induced matchings in subcubic planar graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
On distance-3 matchings and induced matchings
Discrete Applied Mathematics
Breaking the 2n-barrier for Irredundance: Two lines of attack
Journal of Discrete Algorithms
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
Maximum regular induced subgraphs in 2P3-free graphs
Theoretical Computer Science
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical 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
Maximum common induced subgraph parameterized by vertex cover
Information Processing Letters
Hi-index | 0.05 |
Given a graph G and an integer k=0, the NP-complete Induced Matching problem asks whether there exists an edge subset M of size at least k 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, other than the fact that the problem is W[1]-hard on general graphs, little is known about the parameterized complexity of the problem in restricted graph classes. In this work, we provide first-time fixed-parameter tractability results for planar graphs, bounded-degree graphs, graphs with girth at least six, bipartite graphs, line graphs, and graphs of bounded treewidth. In particular, we give a linear-size problem kernel for planar graphs.