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 survey is a comprehensive overview of the develo** area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …

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 …

Kernelization is a strong and widely-applied technique in parameterized complexity. A
kernelization algorithm, or simply a kernel, is a polynomial-time transformation that …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

We develop new techniques for deriving strong computational lower bounds for a class of
well-known NP-hard problems. This class includes weighted satisfiability, dominating set …

We consider parameterized problems where some separation property has to be achieved
by deleting as few vertices as possible. The following five problems are studied: delete k …

Approximation algorithms and parameterized complexity are usually considered to be two
separate ways of dealing with hard algorithmic problems. In this paper, our aim is to …

Based on the framework of parameterized complexity theory, we derive tight lower bounds
on the computational complexity for a number of well-known NP-hard problems. We start by …

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 …