Kirill Simonov

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 74

Top Topics

Parameterized Complexity

Sample Complexity

Euclidean Space

Weighted Model Counting

Top Venues

J. Comput. Syst. Sci.

Publications

Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov
A Contraction Tree SAT Encoding for Computing Twin-Width. PAKDD (2) (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Tree Containment Above Minimum Degree is FPT. SODA (2024)
Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica
Counting Vanishing Matrix-Vector Products. WALCOM (2024)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms 20 (3) (2024)
Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif
Combining Crown Structures for Vulnerability Measures. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. Algorithmica 86 (8) (2024)
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
On coresets for fair clustering in metric and Euclidean spaces and their applications. J. Comput. Syst. Sci. 142 (2024)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. GD (2) (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
Proportionally Fair Matching with Multiple Groups. WG (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Tree Containment Above Minimum Degree is FPT. CoRR (2023)
Robert Ganian, Liana Khazaliya, Kirill Simonov
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. IPEC (2023)
Robert Ganian, Liana Khazaliya, Kirill Simonov
Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. ICALP (2023)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth. CoRR (2023)
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Turán's Theorem Through Algorithmic Lens. WG (2023)
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. ISAAC (2023)
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
-cores from sparse graphs. J. Comput. Syst. Sci. 132 (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
Socially Fair Matching: Exact and Approximation Algorithms. WADS (2023)
Cornelius Brand, Viktoriia Korchemna, Michael Skotnica, Kirill Simonov
Counting Vanishing Matrix-Vector Products. CoRR (2023)
Cornelius Brand, Robert Ganian, Kirill Simonov
A Parameterized Theory of PAC Learning. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
Proportionally Fair Matching with Multiple Groups. CoRR (2023)
Sebastian Reiche, Sarel Cohen, Kirill Simonov, Tobias Friedrich
Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns. COMPLEX NETWORKS (1) (2023)
Cornelius Brand, Robert Ganian, Kirill Simonov
A Parameterized Theory of PAC Learning. AAAI (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to find a good explanation for clustering? Artif. Intell. 322 (2023)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
Detours in directed graphs. J. Comput. Syst. Sci. 137 (2023)
Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov
The Parameterized Complexity of Network Microaggregation. AAAI (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Turán's Theorem Through Algorithmic Lens. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67 (4) (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR (2022)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ICALP (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Longest Cycle Above Erdős-Gallai Bound. ESA (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. IPEC (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? AAAI (2022)
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
Weighted Model Counting with Twin-Width. SAT (2022)
Ivan Bliznets, Danil Sagunov, Kirill Simonov
Fine-grained Complexity of Partial Minimum Satisfiability. IJCAI (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Longest Cycle above Erdős-Gallai Bound. CoRR (2022)
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
Parameterized Algorithms for Upward Planarity. CoRR (2022)
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
Testing Upward Planarity of Partial 2-Trees. CoRR (2022)
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
Parameterized Algorithms for Upward Planarity. SoCG (2022)
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
Testing Upward Planarity of Partial 2-Trees. GD (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). MFCS (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Algorithmic Extensions of Dirac's Theorem. SODA (2022)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Complexity of k-Means Clustering when Little is Known. ICML (2022)
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
Weighted Model Counting with Twin-Width. CoRR (2022)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. STACS (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. ICALP (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
Lossy Kernelization of Same-Size Clustering. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
-Clustering: Tractability island. J. Comput. Syst. Sci. 117 (2021)
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
-means Clustering of Affine Subspaces. SODA (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Parameterized Complexity of Feature Selection for Categorical Data Clustering. CoRR (2021)
Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
Fixed-Parameter and Approximation Algorithms for PCA with Outliers. ICML (2021)
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI (2020)
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
Manipulating Districts to Win Elections: Fine-Grained Complexity. CoRR (2020)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
Low-Rank Binary Matrix Approximation in Column-Sum Norm. APPROX-RANDOM (2020)
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Parameterized Complexity of PCA (Invited Talk). SWAT (2020)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Algorithmic Extensions of Dirac's Theorem. CoRR (2020)
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
Building large k-cores from sparse graphs. CoRR (2020)
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
EPTAS for k-means Clustering of Affine Subspaces. CoRR (2020)
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
Building Large k-Cores from Sparse Graphs. MFCS (2020)
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. CoRR (2020)
Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
Refined Complexity of PCA with Outliers. ICML (2019)
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Parameterized k-Clustering: The distance matters! CoRR (2019)
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Parameterized k-Clustering: Tractability Island. FSTTCS (2019)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
Refined Complexity of PCA with Outliers. CoRR (2019)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
Low-rank binary matrix approximation in column-sum norm. CoRR (2019)