Quadratic kernelization for convex recoloring of trees (Q639283): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-010-9404-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2404791952
@@ Property / OpenAlex ID: W2404791952 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57198691
@@ Property / Wikidata QID: Q57198691 / rank @@
+Normal rank
@@ Property / cites work @@
+Experiments on data reduction for optimal domination in networks
+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 @@
+Improved approximation algorithm for convex recoloring of trees
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Quadratic Kernelization for Convex Recoloring of Trees
+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 @@
+Inapproximability and approximability of maximal tree routing and coloring
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q4273871
@@ Property / cites work: Q4273871 / rank @@
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549693
@@ Property / cites work: Q3549693 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3600916
@@ Property / cites work: Q3600916 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Minimum Convex Coloring
@@ Property / cites work: The Complexity of Minimum Convex Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient approximation of convex recolorings
@@ Property / cites work: Efficient approximation of convex recolorings / rank @@
+Normal rank
@@ Property / cites work @@
+Convex recolorings of strings and trees: Definitions, hardness results and algorithms
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
+Normal rank