Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340): Difference between revisions

@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Q2721971
@@ Property / cites work: Q2721971 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044360
@@ Property / cites work: Q3044360 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250161
@@ Property / cites work: Q4250161 / rank @@
+Normal rank
@@ Property / cites work @@
+Power of Natural Semijoins
@@ Property / cites work: Power of Natural Semijoins / rank @@
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal embeddings of planar graphs
@@ Property / cites work: Chordal embeddings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tour Merging via Branch-Decomposition
@@ Property / cites work: Tour Merging via Branch-Decomposition / 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 @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Fast Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
+Normal rank
@@ Property / cites work @@
+Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
+Normal rank
@@ Property / cites work @@
+Q3579494
@@ Property / cites work: Q3579494 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
+Normal rank
@@ Property / cites work @@
+Subgraph Isomorphism in Planar Graphs and Related Problems
+Normal rank
@@ Property / cites work @@
+Q4471291
@@ Property / cites work: Q4471291 / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Counting clique trees and computing perfect elimination schemes in parallel
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small simple cycle separators for 2-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+The Use of Linear Graphs in Gauss Elimination
@@ Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Q4385515
@@ Property / cites work: Q4385515 / rank @@
+Normal rank