This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area.Expand

We consider parameterized problems where some separation property has to be achieved by deleting at most k vertices from a graph to achieve a certain goal.Expand

We address the questions of how to estimate the size of a sequence of joins and how to execute the sequence best from a theoretical point of view.Expand

We show that both the Edge Multicut and Vertex Multicut problems can be solved in time 2<sup>O(p<sup><sup>3</sup>)</sup>, i.e., fixed-parameter tractable parameterized by the size of the cutset in the solution.Expand

Many important combinatorial problems can be modelled as constraint satisfaction problems, hence identifying polynomial-time solvable classes of constraint satisfaction problems received a lot of… Expand

An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem.Expand

We prove that constraint satisfaction problems with bounded fractional hypertree width can be solved in polynomial time (provided that a the tree decomposition is given in the input).Expand