A $9k$ kernel for nonseparating independent set in planar graphs (Q385964): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2568150489
@@ Property / OpenAlex ID: W2568150489 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4666
@@ Property / arXiv ID: 1207.4666 / rank @@
+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 @@
+Kernel(s) for problems with no kernel
@@ Property / cites work: Kernel(s) for problems with no kernel / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Maximum genus and maximum nonseparating independent set of a 3-regular graph
+Normal rank
@@ Property / cites work @@
+Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves
@@ Property / cites work: Spanning Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Towards optimal kernel for connected vertex cover in planar graphs
+Normal rank
@@ Property / cites work @@
+Kernelization – Preprocessing with a Guarantee
@@ Property / cites work: Kernelization – Preprocessing with a Guarantee / rank @@
+Normal rank
@@ Property / cites work @@
+FPT algorithms for connected feedback vertex set
@@ Property / cites work: FPT algorithms for connected feedback vertex set / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
+Normal rank
@@ Property / cites work @@
+On feedback vertex sets and nonseparating independent sets in cubic graphs
+Normal rank
@@ Property / cites work @@
+On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for Planar Graph Problems with Small Distance Property
+Normal rank

A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964): Difference between revisions

Latest revision as of 04:32, 7 July 2024

Statements

Sitelinks

Mathematics(1 entry)