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 …

The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

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 …

We introduce the framework of cross-composition for proving kernelization lower bounds. A
classical problem L\and/or-cross-composes into a parameterized problem Q if it is possible …

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 this survey, we review practical algorithms for graph-theoretic problems that are
expressible in monadic second-order logic. Monadic second-order (MSO) logic allows …

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 Odd Cycle Transversal problem (OCT) asks whether a given undirected graph can be
made bipartite by deleting at most k of its vertices. In a breakthrough result, Reed, Smith, and …

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 …