Q4691905 (Q4691905): Difference between revisions

@@ Property / cites work @@
+Q4691867
@@ Property / cites work: Q4691867 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent packings in structured graphs
@@ Property / cites work: Independent packings in structured graphs / rank @@
+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 @@
+NP-completeness of some generalizations of the maximum matching problem
+Normal rank
@@ Property / cites work @@
+Bipartite Domination and Simultaneous Matroid Covers
+Normal rank
@@ Property / cites work @@
+NP-hard graph problems and boundary classes of graphs
+Normal rank
@@ Property / cites work @@
+Q5463498
@@ Property / cites work: Q5463498 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+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 complexity of dissociation set problems in graphs
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Brambles and independent packings in chordal graphs
+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 @@
+Q5869351
@@ Property / cites work: Q5869351 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a maximum induced matching in weakly chordal graphs
+Normal rank
@@ Property / cites work @@
+Induced matchings in bipartite graphs
@@ Property / cites work: Induced matchings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139292
@@ Property / cites work: Q3139292 / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of the induced matching problem
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth: Structure and Algorithms
@@ Property / cites work: Treewidth: Structure and Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q4944974
@@ Property / cites work: Q4944974 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+The Fine Details of Fast Dynamic Programming over Tree Decompositions
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Linear-time computation of optimal subgraphs of decomposable graphs
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank