A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625): Difference between revisions

@@ Property / OpenAlex ID @@
+W2134469776
@@ Property / OpenAlex ID: W2134469776 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0806
@@ Property / arXiv ID: 1009.0806 / rank @@
+Normal rank
@@ Property / cites work @@
+The Proper Interval Colored Graph problem for caterpillar trees
+Normal rank
@@ Property / cites work @@
+Q4281679
@@ Property / cites work: Q4281679 / rank @@
+Normal rank
@@ Property / cites work @@
+The Bandwidth of Caterpillars with Hairs of Length 1 and 2
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
+Normal rank
@@ Property / cites work @@
+ON DISJOINT CYCLES
@@ Property / cites work: ON DISJOINT CYCLES / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+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 cubic kernel for feedback vertex set and loop cutset
+Normal rank
@@ Property / cites work @@
+The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
+Normal rank
@@ Property / cites work @@
+On Feedback Vertex Set New Measure and New Structures
+Normal rank
@@ Property / cites work @@
+An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion
+Normal rank
@@ Property / cites work @@
+An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms
@@ Property / cites work: Subexponential parameterized algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281497
@@ Property / cites work: Q4281497 / rank @@
+Normal rank
@@ Property / cites work @@
+Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Obstruction set isolation for the gate matrix layout problem
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Graph bandwidth of weighted caterpillars
@@ Property / cites work: Graph bandwidth of weighted caterpillars / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+A Quartic Kernel for Pathwidth-One Vertex Deletion
+Normal rank
@@ Property / cites work @@
+Faster fixed parameter tractable algorithms for finding feedback vertex sets
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank