Treewidth lower bounds with brambles (Q926284): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-007-9056-z
@@ Property / DOI: 10.1007/s00453-007-9056-z / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-007-9056-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2113901576
@@ Property / OpenAlex ID: W2113901576 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Q4792909
@@ Property / cites work: Q4792909 / 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 @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Safe separators for treewidth
@@ Property / cites work: Safe separators for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction and Treewidth Lower Bounds
@@ Property / cites work: Contraction and Treewidth Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Q4426346
@@ Property / cites work: Q4426346 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and metaheuristic methods for computing graph treewidth
+Normal rank
@@ Property / cites work @@
+Tour Merging via Branch-Decomposition
@@ Property / cites work: Tour Merging via Branch-Decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921728
@@ Property / cites work: Q2921728 / rank @@
+Normal rank
@@ Property / cites work @@
+Highly connected sets and the excluded grid theorem
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Branch Decompositions I: The Ratcatcher
@@ Property / cites work: Planar Branch Decompositions I: The Ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Branch Decompositions II: The Cycle Method
@@ Property / cites work: Planar Branch Decompositions II: The Cycle Method / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q2816028
@@ Property / cites work: Q2816028 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A New Lower Bound for Tree-Width Using Maximum Cardinality Search
+Normal rank
@@ Property / cites work @@
+The Structure and Number of Obstructions to Treewidth
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / 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 @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+<i>E</i>                     <sub>11</sub>                     and M theory
@@ Property / cites work: <i>E</i> <sub>11</sub> and M theory / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/algorithmica/BodlaenderGK08
@@ Property / DBLP publication ID: journals/algorithmica/BodlaenderGK08 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-007-9056-Z
@@ Property / DOI: 10.1007/S00453-007-9056-Z / rank @@
+Normal rank