An Improved Kernel for Planar Connected Dominating Set (Q3010387): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-20877-5_8
+Normal rank
@@ Property / OpenAlex ID @@
+W1574527973
@@ Property / OpenAlex ID: W1574527973 / 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 @@
+Kernelization: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Linear Kernel for Planar Connected Dominating Set
@@ Property / cites work: Linear Kernel for Planar Connected Dominating Set / rank @@
+Normal rank