(Meta) Kernelization

@article{Bodlaender2009MetaK,
  title={(Meta) Kernelization},
  author={H. Bodlaender and F. Fomin and D. Lokshtanov and Eelko Penninkx and S. Saurabh and D. Thilikos},
  journal={2009 50th Annual IEEE Symposium on Foundations of Computer Science},
  year={2009},
  pages={629-638}
}
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit a polynomial kernel if, in polynomial time, we can reduce the size of the instance I to a polynomial in k, while preserving the answer. In this paper, we show that all problems expressible in Counting Monadic Second Order Logic and satisfying a… Expand
250 Citations
Meta-kernelization with structural parameters
  • 16
  • PDF
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
  • 8
On polynomial kernels for sparse integer linear programs
  • S. Kratsch
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2016
  • 9
  • PDF
A Retrospective on (Meta) Kernelization
  • D. Thilikos
  • Computer Science
  • Treewidth, Kernels, and Algorithms
  • 2020
The Kernelization complexity of some domination and covering problems
  • 11
  • PDF
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
  • 11
  • Highly Influenced
  • PDF
Polynomial kernels for hitting forbidden minors under structural parameterizations
  • 1
  • PDF
The Power of Data Reduction : Kernels for Fundamental Graph Problems
  • 32
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-9 OF 9 REFERENCES
Polynomial-time data reduction for dominating set
  • 218
  • Highly Influential
  • PDF
Minimum Leaf Out-Branching Problems
  • 26
  • Highly Influential
  • PDF
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
  • 12
  • Highly Influential
Parameterized Complexity Theory
  • J. Flum, Martin Grohe
  • Mathematics, Computer Science
  • Texts in Theoretical Computer Science. An EATCS Series
  • 2006
  • 1,977
  • Highly Influential
Monadic Second-Order Evaluations on Tree-Decomposable Graphs
  • 227
  • Highly Influential
  • PDF
A 4k2 kernel for feedback vertex set
  • 162
  • Highly Influential
  • PDF
and Saurabh
  • Linear kernel for planar connected dominating set. In Proceedings of Theory and Applications of Models of Computation,
  • 2009
Easy problems for treedecomposable graphs
  • Journal of Algorithms,
  • 1991
Logic
  • 753
  • Highly Influential
  • PDF