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 …

Parameterized computation theory has developed rapidly over the last two decades. In
theoretical computer science, it has attracted considerable attention for its theoretical value …

For the vast majority of local problems on graphs of small tree width (where by local we
mean that a solution can be verified by checking separately the neighbourhood of each …

The (parameterized) feedback vertex set problem on directed graphs, which we refer to as
the dfvs problem, is defined as follows: given a directed graph G and a parameter k, either …

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 …

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 …

Given a graph G=(V, E) G=(V,E) and a subset of its vertices V′⊆ VV^′⊆V, the subgraph
induced by V′ V^′ in G is that with vertex set V′ V^′ and edge set E′ E^′ formed by …

We prove that given an undirected graph G on n vertices and an integer k, one can compute,
in polynomial time in n, a graph G′ with at most 4 k 2 vertices and an integer k′ such that …