Kirill Simonov
Stilling
Førsteamanuensis
Tilhørighet
- E-post
- kirill.simonov@uib.no
- Besøksadresse
-
HIB - Thormøhlens gate 55
5006 Bergen - Postadresse
-
Postboks 7803
5020 Bergen
Følg meg
Kirill Simonov
Stilling
Førsteamanuensis
Tilhørighet
Publikasjoner
Vitenskapelig artikkel
- Bart Maarten Paul Jansen; Liana Khazaliya; Philipp Kindermann et al. (2026). Upward and Rectilinear Planarity are W[1]-Hard Parameterized by Treewidth. (ekstern lenke)
- Niko Hastrich; Kirill Simonov (2026). Structural Parameterization of Steiner Tree Packing. (ekstern lenke)
- Ivan Bliznets; Danil Sagunov; Kirill Simonov (2026). Partial Minimum Satisfiability: Fine-Grained Analysis. (ekstern lenke)
- Tobias Friedrich; Kirill Simonov; Farehe Soheil (2025). Binary k-Center with Missing Entries: Structure Leads to Tractability. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2025). Tree Containment above Minimum Degree Is FPT. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2025). Edge Clique Partition and Cover Beyond Independence. (ekstern lenke)
- Sayan Bandyapadhyay; Fedor Fomin; Petr Golovach et al. (2023). How to find a good explanation for clustering?. (ekstern lenke)
- Fedor Fomin; Danil Sagunov; Kirill Simonov (2023). Building large k-cores from sparse graphs. (ekstern lenke)
- Fedor Fomin; Petr Golovach; William Alexandre Lochet et al. (2022). Detours in Directed Graphs. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2022). Longest Cycle Above Erdös-Gallai Bound. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2022). Algorithmic Extensions of Dirac's Theorem. (ekstern lenke)
- Sayan Bandyapadhyay; Fedor Fomin; Petr Golovach et al. (2022). How to Find a Good Explanation for Clustering?. (ekstern lenke)
- Fedor Fomin; Danil Sagunov; Kirill Simonov (2020). Building large k-cores from sparse graphs. (ekstern lenke)
- Sayan Bandyapadhyay; Fedor Fomin; Petr Golovach et al. (2022). FPT Approximation for Fair Minimum-Load Clustering. (ekstern lenke)
- Sayan Bandyapadhyay; Fedor Fomin; Kirill Simonov (2024). On coresets for fair clustering in metric and Euclidean spaces and their applications. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tuukka Korhonen et al. (2023). Fixed-Parameter Tractability of Maximum Colored Path and Beyond. (ekstern lenke)
- Fedor Fomin; Petr Golovach; William Alexandre Lochet et al. (2023). Detours in directed graphs. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2023). Turán's Theorem Through Algorithmic Lens. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Kirill Simonov (2019). Parameterized k-Clustering: Tractability Island. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2024). Approximating Long Cycle Above Dirac’s Guarantee. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Fahad Panolan et al. (2020). Low-Rank Binary Matrix Approximation in Column-Sum Norm. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Fahad Panolan et al. (2019). Refined Complexity of PCA with Outliers. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Kirill Simonov (2020). Parameterized complexity of PCA. (ekstern lenke)
- Sayan Bandyapadhyay; Fedor Fomin; Petr Golovach et al. (2023). Lossy Kernelization of Same-Size Clustering. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2022). Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2023). Approximating Long Cycle Above Dirac's Guarantee. (ekstern lenke)
Konferanseforedrag
- Tobias Friedrich; Kirill Simonov; Farehe Soheil (2025). Binary k-Center with Missing Entries: Structure Leads to Tractability. (ekstern lenke)
- Michelle Döring; Jan Fehse; Tobias Friedrich et al. (2025). Parameterized Complexity of Vehicle Routing. (ekstern lenke)
- Aikaterini Niklanovits; Kirill Simonov; Shaily Verma et al. (2025). Connected Partitions via Connected Dominating Sets. (ekstern lenke)