Q5136255 (Q5136255): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02076
@@ Property / arXiv ID: 1711.02076 / rank @@
+Normal rank
@@ 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 @@
+Q3002769
@@ Property / cites work: Q3002769 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On Routing Disjoint Paths in Bounded Treewidth Graphs
+Normal rank
@@ Property / cites work @@
+New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+A logical approach to multicut problems
@@ Property / cites work: A logical approach to multicut problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating disjoint-path problems using packing integer programs
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+The edge-disjoint paths problem is NP-complete for series-parallel graphs
+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 @@
+NP-completeness of some edge-disjoint paths problems
+Normal rank
@@ Property / cites work @@
+Finding edge-disjoint paths in partial \(k\)-trees
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5136255