30 citations · 197 across the 86 of their papers we have counts for
125 papers
Path Contraction Faster than
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov +2
A graph is contractible to a graph if there is a set , such that is isomorphic to . Here, is the graph obtained from by contracting all…
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem
Walter Didimo, Fedor V. Fomin, Petr A. Golovach +3
A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all…
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +1
We study the \textsc{-Fixed Cardinality Graph Partitioning (-FCGP)} problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica 2015]. In…
Kernelization for Spreading Points
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
We consider the following problem about dispersing points. Given a set of points in the plane, the task is to identify whether by moving a small number of points by small distance,…
Lossy Kernelization for (Implicit) Hitting Set Problems
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov +3
We re-visit the complexity of kernelization for the -Hitting Set problem. This is a classic problem in Parameterized Complexity, which encompasses several other of the most well…
Turán's Theorem Through Algorithmic Lens
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov +1
The fundamental theorem of Turán from Extremal Graph Theory determines the exact bound on the number of edges in an -vertex graph that does not contain a clique of size…