Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350): Difference between revisions

@@ Property / author @@
-Victor A. Campos
@@ Property / author: Victor A. Campos / rank @@
-Normal rank
@@ Property / author @@
+Victor A. Campos
@@ Property / author: Victor A. Campos / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.entcs.2019.08.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2977692557
@@ Property / OpenAlex ID: W2977692557 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonserial dynamic programming
@@ Property / cites work: Nonserial dynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicut Is FPT
@@ Property / cites work: Multicut Is FPT / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Bounds for the Grid-Minor Theorem
@@ Property / cites work: Polynomial Bounds for the Grid-Minor Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743512
@@ Property / cites work: Q5743512 / 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 @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / 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 @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Finding topological subgraphs is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+The Directed Grid Theorem
@@ Property / cites work: The Directed Grid Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542573
@@ Property / cites work: Q4542573 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2741347
@@ Property / cites work: Q2741347 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
+Normal rank
@@ Property / cites work @@
+Directed multicut is <i>W</i>[1]-hard, even for four terminal pairs
+Normal rank
@@ Property / cites work @@
+Q2741376
@@ Property / cites work: Q2741376 / 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. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+Normal rank