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 …

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 introduce a concept of parameterizing a problem above the optimum solution of its
natural linear programming relaxation and prove that the node multiway cut problem is fixed …

An important result in the study of polynomial-time preprocessing shows that there is an
algorithm which given an instance (G, k) of Vertex Cover outputs an equivalent instance …

We survey the field of algorithms and complexity for graph problems parameterized above or
below guaranteed values, a research area which was pioneered by Venkatesh Raman …

In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum
vertex degrees: Every n-vertex 2-connected graph G with minimum vertex degree δ≥ 2 …

A ternary Permutation-CSP is specified by a subset Π of the symmetric group S3. An
instance of such a problem consists of a set of variables V and a multiset of constraints …

We consider the following natural “above-guarantee” parameterization of the classical
Longest Path problem: For given vertices s and t of a graph G and integer k, the Longest …