Preprocessing, or data reduction, is a standard technique for simplifying and speeding up
computation. Written by a team of experts in the field, this book introduces a rapidly …

Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

Let F be a finite set of graphs. In the F-DELETION problem, we are given an n-vertex graph
G and an integer k as input, and asked whether at most k vertices can be deleted from G …

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 …

The aim of this article is to motivate and describe the parameter ecology program, which
studies how different parameters contribute to the difficulty of classical problems. We call for …

We present a linear-time algorithm to compute a decomposition scheme for graphs G that
have a set X⊆ V (G), called a treewidth-modulator, such that the treewidth of G− X is …

Data reduction techniques are widely applied to deal with computationally hard problems in
real world applications. It has been a long-standing challenge to formally express the …

We prove that graph problems with finite integer index have linear kernels on graphs of
bounded expansion when parameterized by the size of a modulator to constant-treedepth …

Vertex deletion problems are at the heart of parameterized complexity. For a graph class F,
the F-Deletion problem takes as input a graph G and an integer k. The question is whether it …

We investigate a generalization of the classical Feedback Vertex Set (FVS) problem from the
point of view of parameterized algorithms. Independent Feedback Vertex Set (IFVS) is the …