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 …

We investigate the gap between theory and practice for exact branching algorithms. In
theory, branch-and-reduce algorithms currently have the best time complexity for numerous …

We investigate the parameterized complexity of Vertex Cover parameterized by the
difference between the size of the optimal solution and the value of the linear programming …

Temporal graphs have time-stamped edges. Building on previous work, we study the
problem of finding a small vertex set (the separator) whose removal destroys all temporal …

Given an undirected graph G, a collection (s1, t1),...,(sl, tl) of pairs of vertices, and an integer
p, the Edge Multicut problem ask if there is a set S of at most p edges such that the removal …

We introduce a new technique for designing fixed-parameter algorithms for cut problems,
called randomized contractions. We apply our framework to obtain the first fixed-parameter …

Let G=(V, E) be a graph on n vertices and R be a set of pairs of vertices in V called requests.
A multicut is a subset F of E such that every request xy of R is cut by F, ie every xy-path of G …

Given a graph G and an integer k, the Feedback Vertex Set (FVS) problem asks if there is a
vertex set T of size at most k that hits all cycles in the graph. The first fixed-parameter …

A recent trend in parameterized algorithms is the application of polytope tools to fixed-
parameter tractable (FPT) algorithms eg, Cygan et al., FOCS 2011, 52nd Annual Symposium …

Given a directed graph G, a set of k terminals, and an integer p, the Directed Vertex Multiway
Cut problem asks whether there is a set S of at most p (nonterminal) vertices whose removal …