6 citations · 12 across the 18 of their papers we have counts for
5 papers · 1 filter
Algorithmic Extensions of Dirac's Theorem
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov +1
In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum vertex degrees: Every -vertex -connected graph with minimum vertex degree $δ\ge…
EPTAS for -means Clustering of Affine Subspaces
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach +3
We consider a generalization of the fundamental -means clustering for data with incomplete or corrupted entries. When data objects are represented by points in , a…
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
Fair clustering is a constrained variant of clustering where the goal is to partition a set of colored points, such that the fraction of points of any color in every cluster is mor…
Manipulating Districts to Win Elections: Fine-Grained Complexity
Eduard Eiben, Fedor V. Fomin, Fahad Panolan +1
Gerrymandering is a practice of manipulating district boundaries and locations in order to achieve a political advantage for a particular party. Lewenberg, Lev, and Rosenschein [AA…
Building large k-cores from sparse graphs
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
A popular model to measure network stability is the -core, that is the maximal induced subgraph in which every vertex has degree at least . For example, -cores are commonl…