Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2013.09.004
@@ Property / DOI: 10.1016/j.jcss.2013.09.004 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.4912
@@ Property / arXiv ID: 1206.4912 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving MAX-\(r\)-SAT above a tight lower bound
@@ Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / 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 @@
+A partial k-arboretum of graphs with bounded 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 @@
+Q3113681
@@ Property / cites work: Q3113681 / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Path and Cycle Problems
@@ Property / cites work: Kernel Bounds for Path and Cycle Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Structural Parameterizations of Pathwidth
+Normal rank
@@ Property / cites work @@
+Kernel bounds for disjoint cycles and disjoint paths
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+On Cutwidth Parameterized by Vertex Cover
@@ Property / cites work: On Cutwidth Parameterized by Vertex Cover / 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 @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / 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 @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
+Normal rank
@@ Property / cites work @@
+Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3086928
@@ Property / cites work: Q3086928 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
+Normal rank
@@ Property / cites work @@
+Q3113682
@@ Property / cites work: Q3113682 / rank @@
+Normal rank
@@ Property / cites work @@
+Data Reduction for Graph Coloring Problems
@@ Property / cites work: Data Reduction for Graph Coloring Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
+Normal rank
@@ Property / cites work @@
+Q5743380
@@ Property / cites work: Q5743380 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Reflections on Multivariate Algorithmics and Problem Parameterization
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2013.09.004
@@ Property / DOI: 10.1016/J.JCSS.2013.09.004 / rank @@
+Normal rank