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 …

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 …

It is well known that many local graph problems, like Vertex Cover and Dominating Set, can
be solved in time 2 O (tw)| V| O (1) for graphs G=(V, E) with a given tree decomposition of …

In this paper, we show that algorithms on tree decompositions can be made faster with the
use of generalisations of fast subset convolution. Amongst others, this gives algorithms that …

For an even integer t≥ 2, the Matching Connectivity matrix H t is a matrix that has rows and
columns both labeled by all perfect matchings of the complete graph on t vertices; an entry H …

We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed
graph H as a minor to graphs excluding H as a topological subgraph. We prove that for a …

We give a review of a series of techniques and results on the design of subexponential
parameterized algorithms for graph problems. The design of such algorithms usually …

We present a linear-time algorithm to compute a decomposition scheme for graphs G that
have a set X⊆ V (G), called a treewidth-modulator, such that the treewidth of G− X is …

We present a general framework for designing fast subexponential exact and parameterized
algorithms on planar graphs. Our approach is based on geometric properties of planar …