- kirill.simonov@uib.no
- Visitor address
-
Thormøhlens Gate 55
5006 Bergen - Room: 307P1
- Postal address
-
P.O. Box 7803NO-5020 BergenNorway
Follow me
Short info
My research focus is on finding new ways to solve computationally hard problems via imposing structure on instances. I am passionate about fundamental graph-theoretic and matrix-based problems that are used as building blocks in modern applications.
Publications
Academic article
- Bart Maarten Paul Jansen; Liana Khazaliya; Philipp Kindermann et al. (2026). Upward and Rectilinear Planarity are W[1]-Hard Parameterized by Treewidth. (external link)
- Niko Hastrich; Kirill Simonov (2026). Structural Parameterization of Steiner Tree Packing. (external link)
- Ivan Bliznets; Danil Sagunov; Kirill Simonov (2026). Partial Minimum Satisfiability: Fine-Grained Analysis. (external link)
- Tobias Friedrich; Kirill Simonov; Farehe Soheil (2025). Binary k-Center with Missing Entries: Structure Leads to Tractability. (external link)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2025). Tree Containment above Minimum Degree Is FPT. (external link)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2025). Edge Clique Partition and Cover Beyond Independence. (external link)
- Sayan Bandyapadhyay; Fedor Fomin; Petr Golovach et al. (2023). How to find a good explanation for clustering?. (external link)
- Fedor Fomin; Danil Sagunov; Kirill Simonov (2023). Building large k-cores from sparse graphs. (external link)
- Fedor Fomin; Petr Golovach; William Alexandre Lochet et al. (2022). Detours in Directed Graphs. (external link)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2022). Longest Cycle Above Erdös-Gallai Bound. (external link)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2022). Algorithmic Extensions of Dirac's Theorem. (external link)
- Sayan Bandyapadhyay; Fedor Fomin; Petr Golovach et al. (2022). How to Find a Good Explanation for Clustering?. (external link)
- Fedor Fomin; Danil Sagunov; Kirill Simonov (2020). Building large k-cores from sparse graphs. (external link)
- Sayan Bandyapadhyay; Fedor Fomin; Petr Golovach et al. (2022). FPT Approximation for Fair Minimum-Load Clustering. (external link)
- Sayan Bandyapadhyay; Fedor Fomin; Kirill Simonov (2024). On coresets for fair clustering in metric and Euclidean spaces and their applications. (external link)
- Fedor Fomin; Petr Golovach; Tuukka Korhonen et al. (2023). Fixed-Parameter Tractability of Maximum Colored Path and Beyond. (external link)
- Fedor Fomin; Petr Golovach; William Alexandre Lochet et al. (2023). Detours in directed graphs. (external link)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2023). Turán's Theorem Through Algorithmic Lens. (external link)
- Fedor Fomin; Petr Golovach; Kirill Simonov (2019). Parameterized k-Clustering: Tractability Island. (external link)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2024). Approximating Long Cycle Above Dirac’s Guarantee. (external link)
- Fedor Fomin; Petr Golovach; Fahad Panolan et al. (2020). Low-Rank Binary Matrix Approximation in Column-Sum Norm. (external link)
- Fedor Fomin; Petr Golovach; Fahad Panolan et al. (2019). Refined Complexity of PCA with Outliers. (external link)
- Fedor Fomin; Petr Golovach; Kirill Simonov (2020). Parameterized complexity of PCA. (external link)
- Sayan Bandyapadhyay; Fedor Fomin; Petr Golovach et al. (2023). Lossy Kernelization of Same-Size Clustering. (external link)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2022). Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms. (external link)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2023). Approximating Long Cycle Above Dirac's Guarantee. (external link)
Conference lecture
- Tobias Friedrich; Kirill Simonov; Farehe Soheil (2025). Binary k-Center with Missing Entries: Structure Leads to Tractability. (external link)
- Michelle Döring; Jan Fehse; Tobias Friedrich et al. (2025). Parameterized Complexity of Vehicle Routing. (external link)
- Aikaterini Niklanovits; Kirill Simonov; Shaily Verma et al. (2025). Connected Partitions via Connected Dominating Sets. (external link)