Kirill Simonov

Orcid: 0000-0001-9436-7310

According to our database1, Kirill Simonov authored at least 39 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Counting Vanishing Matrix-Vector Products.
Proceedings of the WALCOM: Algorithms and Computation, 2024

2023
Detours in directed graphs.
J. Comput. Syst. Sci., November, 2023

How to find a good explanation for clustering?
Artif. Intell., September, 2023

Lossy Kernelization of Same-Size Clustering.
Theory Comput. Syst., August, 2023

Building large <i>k</i>-cores from sparse graphs.
J. Comput. Syst. Sci., 2023

Tree Containment Above Minimum Degree is FPT.
CoRR, 2023

Turán's Theorem Through Algorithmic Lens.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Proportionally Fair Matching with Multiple Groups.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Socially Fair Matching: Exact and Approximation Algorithms.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Fixed-Parameter Tractability of Maximum Colored Path and Beyond.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Approximating Long Cycle Above Dirac's Guarantee.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

A Parameterized Theory of PAC Learning.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

The Parameterized Complexity of Network Microaggregation.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Algorithmic Extensions of Dirac's Theorem.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Weighted Model Counting with Twin-Width.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk).
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

FPT Approximation for Fair Minimum-Load Clustering.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Fine-grained Complexity of Partial Minimum Satisfiability.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

The Complexity of k-Means Clustering when Little is Known.
Proceedings of the International Conference on Machine Learning, 2022

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Testing Upward Planarity of Partial 2-Trees.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Longest Cycle Above Erdős-Gallai Bound.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Parameterized Algorithms for Upward Planarity.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Parameterized <i>k</i>-Clustering: Tractability island.
J. Comput. Syst. Sci., 2021

EPTAS for <i>k</i>-means Clustering of Affine Subspaces.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Parameterized Complexity of Feature Selection for Categorical Data Clustering.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Fixed-Parameter and Approximation Algorithms for PCA with Outliers.
Proceedings of the 38th International Conference on Machine Learning, 2021

On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
EPTAS for k-means Clustering of Affine Subspaces.
CoRR, 2020

Parameterized Complexity of PCA (Invited Talk).
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Building Large k-Cores from Sparse Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Low-Rank Binary Matrix Approximation in Column-Sum Norm.
Proceedings of the Approximation, 2020

Manipulating Districts to Win Elections: Fine-Grained Complexity.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Parameterized k-Clustering: The distance matters!
CoRR, 2019

Refined Complexity of PCA with Outliers.
Proceedings of the 36th International Conference on Machine Learning, 2019

Parameterized k-Clustering: Tractability Island.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019


  Loading...