The parameterized complexity of the induced matching problem (Q1028465): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.07.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2095912437
@@ Property / OpenAlex ID: W2095912437 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Polynomial-time data reduction for dominating set
@@ Property / cites work: Polynomial-time data reduction for dominating set / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044360
@@ Property / cites work: Q3044360 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings in intersection graphs.
@@ Property / cites work: Induced matchings in intersection graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a maximum induced matching in weakly chordal graphs
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The complexity of irredundant sets parameterized by size
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum induced matching problem
+Normal rank
@@ Property / cites work @@
+Claw-free graphs---a survey
@@ Property / cites work: Claw-free graphs---a survey / rank @@
+Normal rank
@@ Property / cites work @@
+The Lost Continent of Polynomial Time: Preprocessing and Kernelization
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139292
@@ Property / cites work: Q3139292 / rank @@
+Normal rank
@@ Property / cites work @@
+Irredundancy in circular arc graphs
@@ Property / cites work: Irredundancy in circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New results on induced matchings
@@ Property / cites work: New results on induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
+Normal rank
@@ Property / cites work @@
+On the Induced Matching Problem
@@ Property / cites work: On the Induced Matching Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Divide-and-Color
@@ Property / cites work: Divide-and-Color / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite Domination and Simultaneous Matroid Covers
+Normal rank
@@ Property / cites work @@
+Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
+Normal rank
@@ Property / cites work @@
+On maximum induced matchings in bipartite graphs
@@ Property / cites work: On maximum induced matchings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some results on graphs without long induced paths
@@ Property / cites work: Some results on graphs without long induced paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability results for the maximum and minimum maximal induced matching problems
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ Property / cites work @@
+NP-completeness of some generalizations of the maximum matching problem
+Normal rank
@@ Property / cites work @@
+A Parameterized Perspective on Packing Paths of Length Two
+Normal rank
@@ Property / cites work @@
+Q4944970
@@ Property / cites work: Q4944970 / rank @@
+Normal rank