A Retrospective on (Meta) Kernelization
From MaRDI portal
Recommendations
Cites work
- (Meta) kernelization
- (Meta) Kernelization
- A Linear Kernel for Planar Feedback Vertex Set
- A linear kernel for planar red-blue dominating set
- A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
- A partial k-arboretum of graphs with bounded treewidth
- A structural approach to kernels for ILPs: treewidth and total unimodularity
- Algorithmic Meta-theorems
- An algebraic theory of graph reduction
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Bidimensional Parameters and Local Treewidth
- Bidimensionality and kernels
- Bidimensionality and parameterized algorithms (invited talk)
- Bidimensionality of geometric intersection graphs
- Bidimensionality: new connections between FPT algorithms and PTASs
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- Contraction Bidimensionality: The Accurate Picture
- Contraction obstructions for treewidth
- Contraction-bidimensionality of geometric intersection graphs
- Data-compression for parametrized counting problems on sparse graphs
- Deciding first-order properties of locally tree-decomposable structures
- Easy problems for tree-decomposable graphs
- Encyclopedia of algorithms. In 3 volumes
- Excluded grid minors and efficient polynomial-time approximation schemes
- Experiments on data reduction for optimal domination in networks
- Explicit linear kernels via dynamic programming
- Finding topological subgraphs is fixed-parameter tractable
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
- Fundamentals of parameterized complexity
- Graph minors and parameterized algorithm design
- Graph minors. XX: Wagner's conjecture
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 475614 (Why is no real title available?)
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 6783430 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- Kernelization using structural parameters on sparse graph classes
- Kernelization. Theory of parameterized preprocessing
- Kernels for (connected) dominating set on graphs with excluded topological minors
- Linear Kernel for Planar Connected Dominating Set
- Linear kernels for edge deletion problems to immersion-closed graph classes
- Linear Problem Kernels for NP-Hard Problems on Planar Graphs
- Linearity of grid minors in treewidth with applications through bidimensionality
- Logic, graphs, and algorithms
- Lower bounds on kernelization
- Meta-kernelization using well-structured modulators
- Meta-kernelization with structural parameters
- Methods for algorithmic meta theorems
- On problems without polynomial kernels
- On reduction algorithms for graphs with small treewidth
- On the Induced Matching Problem
- Parameterized algorithms
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
- Parametrized complexity theory.
- Polynomial-time data reduction for dominating set
- Reduction algorithms for constructing solutions in graphs with small treewidth
- Reduction algorithms for graphs of small treewidth
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Solving d-SAT via Backdoors to Small Treewidth
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- The Bidimensional Theory of Bounded-Genus Graphs
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
- Treewidth. Computations and approximations
- Vertex cover: Further observations and further improvements
Cited in
(3)
This page was built for publication: A Retrospective on (Meta) Kernelization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042460)
