A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2016.05.031
@@ Property / DOI: 10.1016/j.tcs.2016.05.031 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W1829289780
@@ Property / OpenAlex ID: W1829289780 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.8336
@@ Property / arXiv ID: 1410.8336 / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem
+Normal rank
@@ Property / cites work @@
+Polynomial-time data reduction for dominating set
@@ Property / cites work: Polynomial-time data reduction for dominating 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 cubic kernel for feedback vertex set and loop cutset
+Normal rank
@@ Property / cites work @@
+Q4137202
@@ Property / cites work: Q4137202 / rank @@
+Normal rank
@@ Property / cites work @@
+The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
+Normal rank
@@ Property / cites work @@
+Adjacency queries in dynamic sparse graphs
@@ Property / cites work: Adjacency queries in dynamic sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging
+Normal rank
@@ Property / cites work @@
+Towards optimal kernel for connected vertex cover in planar graphs
+Normal rank
@@ Property / cites work @@
+Improved linear problem kernel for planar connected dominating set
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+Normal rank
@@ Property / cites work @@
+Planar graph vertex partition for linear problem kernels
+Normal rank
@@ Property / cites work @@
+A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2016.05.031
@@ Property / DOI: 10.1016/J.TCS.2016.05.031 / rank @@
+Normal rank