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 …

Parameterization and approximation are two popular ways of co** with NP-hard
problems. More recently, the two have also been combined to derive many interesting …

We give an algorithm that, given graphs G and H, tests whether H is a minor of G in time
O_H(n^1+o(1)); here, n is the number of vertices of G and the O_H(.)-notation hides factors …

We study the parameterized complexity of various classic vertex-deletion problems such as
Odd cycle transversal, Vertex planarization, and Chordal vertex deletion under hybrid …

A directed odd cycle transversal of a directed graph (digraph) D is a vertex set S that
intersects every odd directed cycle of D. In the Directed Odd Cycle Transversal (DOCT) …

In the classic Minimum Bisection problem we are given as input a graph G and an integer k.
The task is to determine whether there is a partition of V (G) into two parts A and B such that …

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 …

In the Min k-Cut problem, the input consists of an edge weighted graph G and an integer k,
and the task is to partition the vertex set into k nonempty sets, such that the total weight of the …

Submodular maximization under matroid and cardinality constraints are classical problems
with a wide range of applications in machine learning, auction theory, and combinatorial …

We continue the development of matroid-based techniques for kernelization, initiated by the
present authors [47]. We significantly extend the usefulness of matroid theory in …