Kirill Simonov

102 papers A* 17A 7B 16Misc 1Journal 55Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Combining Crown Structures for Vulnerability Measures.
Algorithmica
Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif
2026 J jnl
Finding Minimum Distance Preservers: A Parameterized Study.
CoRR
Kirill Simonov, Farehe Soheil, Shaily Verma
2026 B conf
Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes.
SOFSEM
Nadym Mallek, Kirill Simonov
2026 J jnl
Packing Short Cycles.
ACM Trans. Algorithms
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2026 A conf
Structural Parameterization of Steiner Tree Packing.
STACS
Niko Hastrich, Kirill Simonov
2026 J jnl
Tree Containment above Minimum Degree Is FPT.
ACM Trans. Algorithms
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2025 J jnl
Binary
CoRR
Farehe Soheil, Kirill Simonov, Tobias Friedrich
2025 B conf
Binary k-Center with Missing Entries: Structure Leads to Tractability.
IPEC
Tobias Friedrich, Kirill Simonov, Farehe Soheil
2025 A conf
Connected Partitions via Connected Dominating Sets.
ESA
Aikaterini Niklanovits, Kirill Simonov, Shaily Verma, Ziena Zeif
2025 J jnl
Connected Partitions via Connected Dominating Sets.
CoRR
Aikaterini Niklanovits, Kirill Simonov, Shaily Verma, Ziena Zeif
2025 A conf
Edge Clique Partition and Cover Beyond Independence.
ESA
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2025 J jnl
Edge Clique Partition and Cover Beyond Independence.
CoRR
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2025 J jnl
Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes.
CoRR
Nadym Mallek, Kirill Simonov
2025 A* conf
Packing Short Cycles.
SODA
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2025 B conf
Parameterized Complexity of Vehicle Routing.
IPEC
Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm, Shaily Verma
2025 J jnl
Parameterized Complexity of Vehicle Routing.
CoRR
Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm, Shaily Verma
2025 J jnl
Structural Parameterization of Steiner Tree Packing.
CoRR
Niko Hastrich, Kirill Simonov
2024 — conf
A Contraction Tree SAT Encoding for Computing Twin-Width.
PAKDD (2)
Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov
2024 J jnl
Approximating Long Cycle Above Dirac's Guarantee.
Algorithmica
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024 B conf
Combining Crown Structures for Vulnerability Measures.
IPEC
Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif
2024 J jnl
Combining Crown Structures for Vulnerability Measures.
CoRR
Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif
2024 B conf
Counting Vanishing Matrix-Vector Products.
WALCOM
Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica
2024 J jnl
Counting vanishing matrix-vector products.
Theor. Comput. Sci.
Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica
2024 J jnl
Fixed-Parameter Tractability of Maximum Colored Path and Beyond.
ACM Trans. Algorithms
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
2024 J jnl
Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective.
CoRR
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024 J jnl
Integrating higher-order relations for enhanced twitter bot detection.
Soc. Netw. Anal. Min.
Sebastian Reiche, Sarel Cohen, Kirill Simonov, Tobias Friedrich
2024 J jnl
Longest Cycle above Erdős-Gallai Bound.
SIAM J. Discret. Math.
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024 J jnl
On coresets for fair clustering in metric and Euclidean spaces and their applications.
J. Comput. Syst. Sci.
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
2024 B conf
PACE Solver Description: Crossy - An Exact Solver for One-Sided Crossing Minimization.
IPEC
Tobias Röhr, Kirill Simonov
2024 J jnl
Packing Short Cycles.
CoRR
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2024 B conf
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs.
IPEC
Tomohiro Koana, Nidhi Purohit, Kirill Simonov
2024 J jnl
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs.
CoRR
Tomohiro Koana, Nidhi Purohit, Kirill Simonov
2024 J jnl
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
ACM Trans. Algorithms
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2024 A* conf
Tree Containment Above Minimum Degree is FPT.
SODA
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023 A* conf
A Parameterized Theory of PAC Learning.
AAAI
Cornelius Brand, Robert Ganian, Kirill Simonov
2023 J jnl
A Parameterized Theory of PAC Learning.
CoRR
Cornelius Brand, Robert Ganian, Kirill Simonov
2023 A* conf
Approximating Long Cycle Above Dirac's Guarantee.
ICALP
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023 J jnl
Approximating Long Cycle Above Dirac's Guarantee.
CoRR
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023 — conf
Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns.
COMPLEX NETWORKS (1)
Sebastian Reiche, Sarel Cohen, Kirill Simonov, Tobias Friedrich
2023 J jnl
Building large
J. Comput. Syst. Sci.
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
2023 B conf
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity.
IPEC
Robert Ganian, Liana Khazaliya, Kirill Simonov
2023 J jnl
Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity.
CoRR
Robert Ganian, Liana Khazaliya, Kirill Simonov
2023 J jnl
Counting Vanishing Matrix-Vector Products.
CoRR
Cornelius Brand, Viktoriia Korchemna, Michael Skotnica, Kirill Simonov
2023 J jnl
Detours in directed graphs.
J. Comput. Syst. Sci.
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
2023 A* conf
Fixed-Parameter Tractability of Maximum Colored Path and Beyond.
SODA
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
2023 J jnl
How to find a good explanation for clustering?
Artif. Intell.
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2023 J jnl
Lossy Kernelization of Same-Size Clustering.
Theory Comput. Syst.
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2023 J jnl
Parameterized Complexity of Feature Selection for Categorical Data Clustering.
ACM Trans. Comput. Theory
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2023 B conf
Proportionally Fair Matching with Multiple Groups.
WG
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
2023 J jnl
Proportionally Fair Matching with Multiple Groups.
CoRR
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
2023 B conf
Socially Fair Matching: Exact and Approximation Algorithms.
WADS
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
2023 A* conf
The Parameterized Complexity of Network Microaggregation.
AAAI
Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov
2023 B conf
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.
ISAAC
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023 J jnl
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable.
CoRR
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023 J jnl
Tree Containment Above Minimum Degree is FPT.
CoRR
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023 B conf
Turán's Theorem Through Algorithmic Lens.
WG
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023 J jnl
Turán's Theorem Through Algorithmic Lens.
CoRR
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023 — conf
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.
GD (2)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023 J jnl
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth.
CoRR
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2022 A* conf
Algorithmic Extensions of Dirac's Theorem.
SODA
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022 A conf
Detours in Directed Graphs.
STACS
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022 J jnl
Detours in Directed Graphs.
CoRR
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022 B conf
FPT Approximation for Fair Minimum-Load Clustering.
IPEC
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2022 A* conf
Fine-grained Complexity of Partial Minimum Satisfiability.
IJCAI
Ivan Bliznets, Danil Sagunov, Kirill Simonov
2022 J jnl
Fixed-Parameter Tractability of Maximum Colored Path and Beyond.
CoRR
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
2022 A* conf
How to Find a Good Explanation for Clustering?
AAAI
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2022 B conf
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk).
MFCS
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022 A conf
Longest Cycle Above Erdős-Gallai Bound.
ESA
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022 J jnl
Longest Cycle above Erdős-Gallai Bound.
CoRR
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022 Misc conf
Lossy Kernelization of Same-Size Clustering.
CSR
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2022 A* conf
Parameterized Algorithms for Upward Planarity.
SoCG
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
2022 J jnl
Parameterized Algorithms for Upward Planarity.
CoRR
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
2022 A conf
Testing Upward Planarity of Partial 2-Trees.
GD
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
2022 J jnl
Testing Upward Planarity of Partial 2-Trees.
CoRR
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
2022 A* conf
The Complexity of k-Means Clustering when Little is Known.
ICML
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2022 A* conf
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
ICALP
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2022 J jnl
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
CoRR
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2022 A conf
Weighted Model Counting with Twin-Width.
SAT
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
2022 J jnl
Weighted Model Counting with Twin-Width.
CoRR
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
2021 A* conf
EPTAS for
SODA
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2021 J jnl
FPT Approximation for Fair Minimum-Load Clustering.
CoRR
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2021 A* conf
Fixed-Parameter and Approximation Algorithms for PCA with Outliers.
ICML
Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2021 J jnl
How to Find a Good Explanation for Clustering?
CoRR
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2021 J jnl
Lossy Kernelization of Same-Size Clustering.
CoRR
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2021 A* conf
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications.
ICALP
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
2021 J jnl
Parameterized
J. Comput. Syst. Sci.
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2021 B conf
Parameterized Complexity of Feature Selection for Categorical Data Clustering.
MFCS
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2021 J jnl
Parameterized Complexity of Feature Selection for Categorical Data Clustering.
CoRR
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2020 J jnl
Algorithmic Extensions of Dirac's Theorem.
CoRR
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2020 B conf
Building Large k-Cores from Sparse Graphs.
MFCS
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
2020 J jnl
Building large k-cores from sparse graphs.
CoRR
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
2020 J jnl
EPTAS for k-means Clustering of Affine Subspaces.
CoRR
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2020 — conf
Low-Rank Binary Matrix Approximation in Column-Sum Norm.
APPROX-RANDOM
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
2020 A* conf
Manipulating Districts to Win Elections: Fine-Grained Complexity.
AAAI
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2020 J jnl
Manipulating Districts to Win Elections: Fine-Grained Complexity.
CoRR
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2020 J jnl
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications.
CoRR
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
2020 — conf
Parameterized Complexity of PCA (Invited Talk).
SWAT
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2019 J jnl
Low-rank binary matrix approximation in column-sum norm.
CoRR
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
2019 J jnl
Parameterized k-Clustering: The distance matters!
CoRR
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2019 — conf
Parameterized k-Clustering: Tractability Island.
FSTTCS
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2019 A* conf
Refined Complexity of PCA with Outliers.
ICML
Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
2019 J jnl
Refined Complexity of PCA with Outliers.
CoRR
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov