Kirill Simonov
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
36
Venues
18
Active years
2019–2026
Best venue rank
A*
Where they publish
Papers
36 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STOC | Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective. | Fedor V. Fomin, Petr A. Golovach, Nikola Jedlickov, Jan Kratochvl, Danil Sagunov, Kirill Simonov |
| 2026 | STACS | Structural Parameterization of Steiner Tree Packing. | Niko Hastrich, Kirill Simonov |
| 2026 | SOFSEM | Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes. | Nadym Mallek, Kirill Simonov |
| 2025 | ESA | Edge Clique Partition and Cover Beyond Independence. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2025 | ESA | Connected Partitions via Connected Dominating Sets. | Aikaterini Niklanovits, Kirill Simonov, Shaily Verma, Ziena Zeif |
| 2025 | SODA | Packing Short Cycles. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov |
| 2024 | PAKDD | A Contraction Tree SAT Encoding for Computing Twin-Width. | Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov |
| 2024 | SODA | Tree Containment Above Minimum Degree is FPT. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2024 | WALCOM | Counting Vanishing Matrix-Vector Products. | Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica |
| 2023 | AAAI | The Parameterized Complexity of Network Microaggregation. | Vclav Blazej, Robert Ganian, Dusan Knop, Jan Pokorn, Simon Schierreich, Kirill Simonov |
| 2023 | AAAI | A Parameterized Theory of PAC Learning. | Cornelius Brand, Robert Ganian, Kirill Simonov |
| 2023 | GD | Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. | Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov |
| 2023 | ICALP | Approximating Long Cycle Above Dirac's Guarantee. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2023 | ISAAC | The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. | Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov |
| 2023 | SODA | Fixed-Parameter Tractability of Maximum Colored Path and Beyond. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis |
| 2023 | WADS | Socially Fair Matching: Exact and Approximation Algorithms. | Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov |
| 2023 | WG | Proportionally Fair Matching with Multiple Groups. | Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov |
| 2023 | WG | Turn's Theorem Through Algorithmic Lens. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | AAAI | How to Find a Good Explanation for Clustering? | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov |
| 2022 | CSR | Lossy Kernelization of Same-Size Clustering. | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov |
| 2022 | ESA | Longest Cycle Above Erdős-Gallai Bound. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | GD | Testing Upward Planarity of Partial 2-Trees. | Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov |
| 2022 | ICALP | The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
| 2022 | ICML | The Complexity of k-Means Clustering when Little is Known. | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
| 2022 | IJCAI | Fine-grained Complexity of Partial Minimum Satisfiability. | Ivan Bliznets, Danil Sagunov, Kirill Simonov |
| 2022 | MFCS | Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | SODA | Algorithmic Extensions of Dirac's Theorem. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | STACS | Detours in Directed Graphs. | Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh |
| 2022 | SAT | Weighted Model Counting with Twin-Width. | Robert Ganian, Filip Pokrvka, Andr Schidler, Kirill Simonov, Stefan Szeider |
| 2021 | ICALP | On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. | Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov |
| 2021 | ICML | Fixed-Parameter and Approximation Algorithms for PCA with Outliers. | Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov |
| 2021 | MFCS | Parameterized Complexity of Feature Selection for Categorical Data Clustering. | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov |
| 2021 | SODA | EPTAS for | Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov |
| 2020 | AAAI | Manipulating Districts to Win Elections: Fine-Grained Complexity. | Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov |
| 2020 | MFCS | Building Large k-Cores from Sparse Graphs. | Fedor V. Fomin, Danil Sagunov, Kirill Simonov |
| 2019 | ICML | Refined Complexity of PCA with Outliers. | Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan |