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 coping with NP-hard
problems. More recently, the two have also been combined to derive many interesting …

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 …

In the k-cut problem, we are given an edge-weighted graph G and an integer k, and have to
remove a set of edges with minimum total weight so that G has at least k connected …

We show a flow-augmentation algorithm in directed graphs: There exists a randomized
polynomial-time algorithm that, given a directed graph G, two integers s, t∈ V (G), and an …

We introduce a new data structure for answering connectivity queries in undirected graphs
subject to batched vertex failures. Precisely, given any graph G and integer k, we can in …