Kernelization is a formalization of efficient preprocessing, aimed mainly at combinatorially
hard problems. Empirically, preprocessing is highly successful in practice, eg, in state-of-the …

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, one can reduce the size of the …

In order to characterize and benchmark computational hardware, software, and algorithms, it
is essential to have many problem instances on-hand. This is no less true for quantum …

In this paper we propose a new framework for analyzing the performance of preprocessing
algorithms. Our framework builds on the notion of kernelization from parameterized …

Computational Social Choice is an interdisciplinary research area involving Economics,
Political Science, and Social Science on the one side, and Mathematics and Computer …

The Chordal Vertex Deletion (ChVD) problem asks to delete a minimum number of vertices
from an input graph to obtain a chordal graph. In this paper we develop a polynomial kernel …

The input to the NP-hard point line cover problem (PLC) consists of a set P of n points on the
plane and a positive integer k; the question is whether there exists a set of at most k lines …

The intrinsic properties of nanomaterials offer promise for technological revolutions in many
fields, including transportation, soft robotics, and energy. Unfortunately, the exploitation of …

We are pleased to dedicate this survey on kernelization of the V ertex C over problem, to
Professor Juraj Hromkovič on the occasion of his 60th birthday. The V ertex C over problem …

Given a graph G and a parameter k, the Chordal Vertex Deletion (CVD) problem asks
whether there exists a subset U⊆ V (G) of size at most k that hits all induced cycles of size at …