On the parameterized complexity of the acyclic matching problem (Q6038700): Difference between revisions

@@ Property / OpenAlex ID @@
+W4362673250
@@ Property / OpenAlex ID: W4362673250 / rank @@
+Normal rank
@@ Property / cites work @@
+On the tree-width of even-hole-free graphs
@@ Property / cites work: On the tree-width of even-hole-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating maximum acyclic matchings by greedy and local search strategies
+Normal rank
@@ Property / cites work @@
+Degenerate matchings and edge colorings
@@ Property / cites work: Degenerate matchings and edge colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of derived graphs
@@ Property / cites work: Characterizations of derived graphs / rank @@
+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 @@
+Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+The complexity of irredundant sets parameterized by size
+Normal rank
@@ Property / cites work @@
+Branching and Treewidth Based Exact Algorithms
@@ Property / cites work: Branching and Treewidth Based Exact Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On some hard and some tractable cases of the maximum acyclic matching problem
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Planarity of iterated line graphs
@@ Property / cites work: Planarity of iterated line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized subgraph-restricted matchings in graphs
+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 @@
+Parameterized complexity of induced graph matching on claw-free graphs
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / 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 @@
+An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
+Normal rank
@@ Property / cites work @@
+Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
+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 @@
+The parameterized complexity of the induced matching problem
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic matching in some subclasses of graphs
@@ Property / cites work: Acyclic matching in some subclasses of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS
+Normal rank
@@ Property / cites work @@
+On two geometric problems related to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Simple upper bounds for partition functions
@@ Property / cites work: Simple upper bounds for partition functions / rank @@
+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 @@
+On the induced matching problem in Hamiltonian bipartite graphs
+Normal rank
@@ Property / cites work @@
+On feedback vertex sets and nonseparating independent sets in cubic graphs
+Normal rank
@@ Property / cites work @@
+NP-completeness of some generalizations of the maximum matching problem
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank
@@ Property / cites work @@
+Q4944970
@@ Property / cites work: Q4944970 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6038700