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 consider four well-studied NP-complete packing/covering problems on graphs:
Feedback Vertex Set in Tournaments (FVST), Cluster Vertex Deletion (CVD), Triangle …

We study two fundamental problems related to finding subgraphs:(1) given graphs G and H,
Subgraph Test asks if H is isomorphic to a subgraph of G,(2) given graphs G, H, and an …

A tournament is a directed graph in which there is a single arc between every pair of distinct
vertices. Given a tournament T on n vertices, we explore the classical and parameterized …

We revisit crown decomposition for the Vertex Cover problem by giving a simple 2k-
kernelization algorithm. Previously, a 2k kernel was known but it was computed using both …

In parameterized complexity, it is well-known that a parameterized problem is fixed-
parameter tractable if and only if it has a kernel—an instance equivalent to the input …

We introduce a new kernelization tool, called rainbow matching technique, that is
appropriate for the design of polynomial kernels for packing problems. Our technique …

The progress in parameterized complexity has been very significant in recent years, with
new research questions and directions, such as kernelization lower bounds, appearing and …

We consider four well-studied NP-complete packing/covering problems on graphs:
Feedback Vertex Set in Tournaments (FVST), Cluster Vertex Deletion (CVD), Triangle …