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 …

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 …

Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

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 …

This paper presents an O (1.2738 k+ kn)-time polynomial-space algorithm for Vertex Cover
improving the previous O (1.286 k+ kn)-time polynomial-space upper bound by Chen, Kanj …

We present parameterized algorithms for the k-path problem, the p-packing of q-sets
problem, and the q-dimensional p-matching problem. Our algorithms solve these problems …

Kernelization algorithms are polynomial-time reductions from a problem to itself that
guarantee their output to have a size not exceeding some bound. For example, d-Set …

The paper studies crown reductions for the Minimum Weighted Vertex Cover problem
introduced recently in the unweighted case by Fellows et al.[Blow-Ups, Win/Win's and crown …

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 …

The two objectives of this paper are:(1) to articulate three new general techniques for
designing FPT algorithms, and (2) to apply these to obtain new FPT algorithms for Set …