Q5743430 (Q5743430): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for treewidth
@@ Property / cites work: Approximation algorithms for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q4036592
@@ Property / cites work: Q4036592 / 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 @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+Normal rank
@@ Property / cites work @@
+Rank-width and tree-width of \(H\)-minor-free graphs
+Normal rank
@@ Property / cites work @@
+Optimal branch-decomposition of planar graphs in             <i>O</i>             (             <i>n</i>             <sup>3</sup>             ) Time
+Normal rank
@@ Property / cites work @@
+Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time
+Normal rank
@@ Property / cites work @@
+Q5743430
@@ Property / cites work: Q5743430 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414505
@@ Property / cites work: Q4414505 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036591
@@ Property / cites work: Q4036591 / rank @@
+Normal rank
@@ Property / cites work @@
+Rank‐width is less than or equal to branch‐width
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5743430