An FPT 2-approximation for tree-cut decomposition (Q1702123): Difference between revisions

@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q2921717
@@ Property / cites work: Q2921717 / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated Domination and Covering: A Parameterized Perspective
+Normal rank
@@ Property / cites work @@
+On the complexity of some colorful problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Q5365078
@@ Property / cites work: Q5365078 / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Applications of Tree-Cut Width
@@ Property / cites work: Algorithmic Applications of Tree-Cut Width / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths of bounded length and their cuts: parameterized complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Finding topological subgraphs is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+Constructive algorithm for path-width of matroids
@@ Property / cites work: Constructive algorithm for path-width of matroids / rank @@
+Normal rank
@@ Property / cites work @@
+An FPT 2-approximation for tree-cut decomposition
@@ Property / cites work: An FPT 2-approximation for tree-cut decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+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. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors XXIII. Nash-Williams' immersion conjecture
+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 @@
+The structure of graphs not admitting a fixed immersion
+Normal rank
@@ Property / cites work @@
+Cutwidth I: A linear time fixed parameter algorithm
+Normal rank
@@ Property / cites work @@
+Cutwidth II: Algorithms for partial w-trees of bounded degree
+Normal rank