Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307): Difference between revisions

@@ Property / cites work @@
+Q4488089
@@ Property / cites work: Q4488089 / rank @@
+Normal rank
@@ Property / cites work @@
+A Cubic Kernel for Feedback Vertex Set
@@ Property / cites work: A Cubic Kernel for Feedback Vertex Set / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for Planar Feedback Vertex Set
@@ Property / cites work: A Linear Kernel for Planar Feedback Vertex Set / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for feedback vertex set problems
+Normal rank
@@ Property / cites work @@
+A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
+Normal rank
@@ Property / cites work @@
+Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Fast Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579494
@@ Property / cites work: Q3579494 / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms
@@ Property / cites work: Subexponential parameterized algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145802
@@ Property / cites work: Q3145802 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
+Normal rank
@@ Property / cites work @@
+New upper bounds on the decomposability of planar graphs
+Normal rank
@@ Property / cites work @@
+On the minimum feedback vertex set problem: Exact and enumeration algorithms
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for feedback problems in planar 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 @@
+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 @@
+Q4414505
@@ Property / cites work: Q4414505 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank