Vitenskapelig artikkel
-
Bandyapadhyay, Sayan; Fomin, Fedor; Simonov, Kirill
(2024). On coresets for fair clustering in metric and Euclidean spaces and their applications. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Sagunov, Danil
et al. (2024). Approximating Long Cycle Above Dirac’s Guarantee. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Sagunov, Danil
et al. (2023). Turán's Theorem Through Algorithmic Lens. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Sagunov, Danil
et al. (2023). Approximating Long Cycle Above Dirac's Guarantee. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Korhonen, Tuukka
et al. (2023). Fixed-Parameter Tractability of Maximum Colored Path and Beyond. (ekstern lenke)
-
Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr
et al. (2023). How to find a good explanation for clustering?. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre
et al. (2023). Detours in directed graphs. (ekstern lenke)
-
Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr
et al. (2023). Lossy Kernelization of Same-Size Clustering. (ekstern lenke)
-
Fomin, Fedor; Sagunov, Danil; Simonov, Kirill
(2023). Building large k-cores from sparse graphs. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre
et al. (2022). Detours in Directed Graphs. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Sagunov, Danil
et al. (2022). Longest Cycle Above Erdös-Gallai Bound. (ekstern lenke)
-
Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr
et al. (2022). How to Find a Good Explanation for Clustering?. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Sagunov, Danil
et al. (2022). Algorithmic Extensions of Dirac's Theorem. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Sagunov, Danil
et al. (2022). Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms. (ekstern lenke)
-
Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr
et al. (2022). FPT Approximation for Fair Minimum-Load Clustering. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Panolan, Fahad
et al. (2020). Low-Rank Binary Matrix Approximation in Column-Sum Norm. (ekstern lenke)
-
Fomin, Fedor; Sagunov, Danil; Simonov, Kirill
(2020). Building large k-cores from sparse graphs. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Simonov, Kirill
(2020). Parameterized complexity of PCA. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Simonov, Kirill
(2019). Parameterized k-Clustering: Tractability Island. (ekstern lenke)
-
Fomin, Fedor; Golovach, Petr; Panolan, Fahad
et al. (2019). Refined Complexity of PCA with Outliers. (ekstern lenke)
Se en full oversikt over publikasjoner i Cristin
