Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2020.07.009
@@ Property / DOI: 10.1016/j.tcs.2020.07.009 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2964248725
@@ Property / OpenAlex ID: W2964248725 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08885
@@ Property / arXiv ID: 1804.08885 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Kernelization: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
+Normal rank
@@ Property / cites work @@
+One Hierarchy Spawns Another
@@ Property / cites work: One Hierarchy Spawns Another / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of losing width
@@ Property / cites work: On the hardness of losing width / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255109
@@ Property / cites work: Q4255109 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+New Limits to Classical and Quantum Instance Compression
+Normal rank
@@ Property / cites work @@
+Where First-Order and Monadic Second-Order Logic Coincide
+Normal rank
@@ Property / cites work @@
+Preprocessing subgraph and minor problems: when does a small vertex cover help?
+Normal rank
@@ Property / cites work @@
+Hitting Forbidden Minors: Approximation and Kernelization
+Normal rank
@@ Property / cites work @@
+Kernelization
@@ Property / cites work: Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Cover Structural Parameterization Revisited
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Kernelization using structural parameters on sparse graph classes
+Normal rank
@@ Property / cites work @@
+Uniform Kernelization Complexity of Hitting Forbidden Minors
+Normal rank
@@ Property / cites work @@
+Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
+Normal rank
@@ Property / cites work @@
+Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
+Normal rank
@@ Property / cites work @@
+Q4967164
@@ Property / cites work: Q4967164 / rank @@
+Normal rank
@@ Property / cites work @@
+A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
+Normal rank
@@ Property / cites work @@
+Structural Parameterizations of Feedback Vertex Set
+Normal rank
@@ Property / cites work @@
+Polynomial kernels for vertex cover parameterized by small degree modulators
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs
+Normal rank
@@ Property / cites work @@
+A Faster Parameterized Algorithm for Treedepth
@@ Property / cites work: A Faster Parameterized Algorithm for Treedepth / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2020.07.009
@@ Property / DOI: 10.1016/J.TCS.2020.07.009 / rank @@
+Normal rank