375 citations · 494 across the 29 of their papers we have counts for
3 papers · 1 filter
A Quartic Kernel for Pathwidth-One Vertex Deletion
Geevarghese Philip, Venkatesh Raman, Yngve Villanger
The pathwidth of a graph is a measure of how path-like the graph is. Given a graph G and an integer k, the problem of finding whether there exist at most k vertices in G whose dele…
Bidimensionality and EPTAS
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman +1
Bidimensionality theory is a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. as a tool to obtain sub-exponential time para…
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov +2
We develop two different methods to achieve subexponential time parameterized algorithms for problems on sparse directed graphs. We exemplify our approaches with two well studied p…