Kernelization: New Upper and Lower Bound Techniques (Q3656848): Difference between revisions

@@ Property / cites work @@
+Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
+Normal rank
@@ Property / cites work @@
+Q4273870
@@ Property / cites work: Q4273870 / rank @@
+Normal rank
@@ Property / cites work @@
+Crown structures for vertex cover kernelization
@@ Property / cites work: Crown structures for vertex cover kernelization / 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 @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+An algebraic theory of graph reduction
@@ Property / cites work: An algebraic theory of graph reduction / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Kernels for Feedback Arc Set In Tournaments
@@ Property / cites work: Kernels for Feedback Arc Set In Tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for Kemeny rankings
@@ Property / cites work: Fixed-parameter algorithms for Kemeny rankings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845370
@@ Property / cites work: Q4845370 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Cluster Editing: Evaluation and Experiments
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+On Problems without Polynomial Kernels (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Quadratic Kernelization for Convex Recoloring of Trees
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Capacitated Dominating Set Is W[1]-Hard
@@ Property / cites work: Planar Capacitated Dominating Set Is W[1]-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for Planar Feedback Vertex Set
@@ Property / cites work: A Linear Kernel for Planar Feedback Vertex Set / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Disjoint Cycles and Disjoint Paths
+Normal rank
@@ Property / cites work @@
+Reduction algorithms for graphs of small treewidth
+Normal rank
@@ Property / cites work @@
+A cubic kernel for feedback vertex set and loop cutset
+Normal rank
@@ Property / cites work @@
+Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
+Normal rank
@@ Property / cites work @@
+A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
@@ Property / cites work: A POLYNOMIAL KERNEL FOR MULTICUT IN TREES / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterminism within $P^ *  $
@@ Property / cites work: Nondeterminism within $P^ * $ / rank @@
+Normal rank
@@ Property / cites work @@
+On fixed-parameter tractability and approximability of NP optimization problems
+Normal rank
@@ Property / cites work @@
+Advice classes of parametrized tractability
@@ Property / cites work: Advice classes of parametrized tractability / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+On the computational hardness based on linear fpt-reductions
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+Q2934608
@@ Property / cites work: Q2934608 / 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 Finding Directed Trees with Many Leaves
@@ Property / cites work: On Finding Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255109
@@ Property / cites work: Q4255109 / rank @@
+Normal rank
@@ Property / cites work @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263467
@@ Property / cites work: Q4263467 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3570028
@@ Property / cites work: Q3570028 / rank @@
+Normal rank
@@ Property / cites work @@
+edge dominating set: Efficient Enumeration-Based Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417642
@@ Property / cites work: Q5417642 / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549693
@@ Property / cites work: Q3549693 / rank @@
+Normal rank
@@ Property / cites work @@
+Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
+Normal rank
@@ Property / cites work @@
+A more effective linear kernelization for cluster editing
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of Vertex Cover variants
@@ Property / cites work: Parameterized complexity of Vertex Cover variants / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum leaf out-branching and related problems
@@ Property / cites work: Minimum leaf out-branching and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2996856
@@ Property / cites work: Q2996856 / rank @@
+Normal rank
@@ Property / cites work @@
+Two Edge Modification Problems without Polynomial Kernels
+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
@@ Property / cites work @@
+A Problem Kernelization for Graph Packing
@@ Property / cites work: A Problem Kernelization for Graph Packing / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of the induced matching problem
+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 @@
+Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / 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 @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633817
@@ Property / cites work: Q4633817 / rank @@
+Normal rank