# Kernelization

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- STOC
- 2017

In this paper we propose a new framework for analyzing the performance of preprocessing algorithms. Our framework builds on theâ€¦Â (More)

Is this relevant?

Highly Cited

2014

Highly Cited

2014

- SIAM J. Discrete Math.
- 2014

We introduce the cross-composition framework for proving kernelization lower bounds. A classical problem L and/or-cross-composesâ€¦Â (More)

Is this relevant?

2014

2014

- ACM Trans. Algorithms
- 2014

In parameterized complexity, each problem instance comes with a parameter <i>k</i>, and a parameterized problem is said to admitâ€¦Â (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- SODA
- 2012

Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size notâ€¦Â (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Journal of Machine Learning Research
- 2012

Online algorithms that process one example at a time are advantageous when dealing with very large data or with data streamsâ€¦Â (More)

Is this relevant?

2010

2010

- IPEC
- 2010

The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graphâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- J. Comput. Syst. Sci.
- 2009

Kernelization is a strong and widely-applied technique in parameterized complexity. In a nutshell, a kernelization algorithm, orâ€¦Â (More)

Is this relevant?

2007

2007

- Theory of Computing Systems
- 2007

Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problemâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2006

In this paper, we present a kernel realization of a matched subspace detector (MSD) that is based on a subspace mixture modelâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- ALENEX/ANALC
- 2004

The computational challenge posed by NP-hard problems has inspired the development of a wide range of algorithmic techniques. Dueâ€¦Â (More)

Is this relevant?