Kernelization is a strong and widely-applied technique in parameterized complexity. A
kernelization algorithm, or simply a kernel, is a polynomial-time transformation that …

Approximation algorithms and parameterized complexity are usually considered to be two
separate ways of dealing with hard algorithmic problems. In this paper, our aim is to …

To solve NP-hard problems, polynomial-time preprocessing is a natural and promising
approach. Preprocessing is based on data reduction techniques that take a problem's input …

Bidimensionality theory appears to be a powerful framework in the development of meta-
algorithmic techniques. It was introduced by Demaine et al.[J. ACM 2005] as a tool to obtain …

We introduce a new approach to design parameterized algorithms on planar graphs which
builds on the seminal results of Robertson and Seymour on graph minors. Graph minors …

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 …

We give a review of a series of techniques and results on the design of subexponential
parameterized algorithms for graph problems. The design of such algorithms usually …

Parameterized Algorithmics: A Graph-Theoretic Approach Page 1 Parameterized Algorithmics:
A Graph-Theoretic Approach Henning Fernau Universität Tübingen, WSI für Informatik, Sand …

We consider the concepts of a t-total vertex cover and a t-total edge cover (t⩾ 1), which
generalise the notions of a vertex cover and an edge cover, respectively. A t-total vertex …

We describe an algorithm for the Feedback Vertex Set problem on undirected graphs,
parameterized by the size k of the feedback vertex set, that runs in time O (ckn 3) where c …