Parameterized k-Clustering: Tractability Island. - Fedor V. Fomin; Petr A. Golovach; Kirill Simonov (FSTTCS, 2019)

Refined Complexity of PCA with Outliers. - Kirill Simonov; Fedor V. Fomin; Petr A. Golovach; Fahad Panolan (ICML, 2019)

Parameterized k-Clustering: The distance matters! - Fedor V. Fomin; Petr A. Golovach; Kirill Simonov (CoRR, 2019)

Manipulating Districts to Win Elections: Fine-Grained Complexity. - Eduard Eiben; Fedor V. Fomin; Fahad Panolan; Kirill Simonov (AAAI, 2020)

Low-Rank Binary Matrix Approximation in Column-Sum Norm. - Fedor V. Fomin; Petr A. Golovach; Fahad Panolan; Kirill Simonov (APPROX-RANDOM, 2020)

Building Large k-Cores from Sparse Graphs. - Fedor V. Fomin; Danil Sagunov; Kirill Simonov (MFCS, 2020)

Parameterized Complexity of PCA (Invited Talk). - Fedor V. Fomin; Petr A. Golovach; Kirill Simonov (SWAT, 2020)

EPTAS for k-means Clustering of Affine Subspaces. - Eduard Eiben; Fedor V. Fomin; Petr A. Golovach; William Lochet; Fahad Panolan; Kirill Simonov (CoRR, 2020)

Fixed-Parameter and Approximation Algorithms for PCA with Outliers. - Yogesh Dahiya; Fedor V. Fomin; Fahad Panolan; Kirill Simonov (ICML, 2021)

EPTAS for k-means Clustering of Affine Subspaces. - Eduard Eiben; Fedor V. Fomin; Petr A. Golovach; William Lochet; Fahad Panolan; Kirill Simonov (SODA, 2021)

Parameterized k-Clustering: Tractability island. - Fedor V. Fomin; Petr A. Golovach; Kirill Simonov (J. Comput. Syst. Sci., 2021)

Parameterized Algorithms for Upward Planarity. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (SoCG, 2022)

Testing Upward Planarity of Partial 2-Trees. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (GD, 2022)

The Complexity of k-Means Clustering when Little is Known. - Robert Ganian; Thekla Hamm; Viktoriia Korchemna; Karolina Okrasa; Kirill Simonov (ICML, 2022)

Fine-grained Complexity of Partial Minimum Satisfiability. - Ivan Bliznets; Danil Sagunov; Kirill Simonov (IJCAI, 2022)

FPT Approximation for Fair Minimum-Load Clustering. - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; Nidhi Purohit; Kirill Simonov (IPEC, 2022)

Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (MFCS, 2022)

Weighted Model Counting with Twin-Width. - Robert Ganian; Filip Pokrývka; André Schidler; Kirill Simonov; Stefan Szeider (SAT, 2022)

Algorithmic Extensions of Dirac's Theorem. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (SODA, 2022)

Weighted Model Counting with Twin-Width: Experimental Results. - Robert Ganian; Filip Pokrývka; André Schidler; Kirill Simonov; Stefan Szeider (Zenodo, 2022)

The Parameterized Complexity of Network Microaggregation. - Václav Blazej; Robert Ganian; Dusan Knop; Jan Pokorný; Simon Schierreich; Kirill Simonov (AAAI, 2023)

A Parameterized Theory of PAC Learning. - Cornelius Brand; Robert Ganian; Kirill Simonov (AAAI, 2023)

Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns. - Sebastian Reiche; Sarel Cohen; Kirill Simonov; Tobias Friedrich 001 (COMPLEX NETWORKS (1), 2023)

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 (GD (2), 2023)

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. - Liana Khazaliya; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani; Kirill Simonov (ISAAC, 2023)

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. - Robert Ganian; Liana Khazaliya; Kirill Simonov (IPEC, 2023)

Socially Fair Matching: Exact and Approximation Algorithms. - Sayan Bandyapadhyay; Fedor V. Fomin; Tanmay Inamdar 002; Fahad Panolan; Kirill Simonov (WADS, 2023)

Proportionally Fair Matching with Multiple Groups. - Sayan Bandyapadhyay; Fedor V. Fomin; Tanmay Inamdar 002; Kirill Simonov (WG, 2023)

Turán's Theorem Through Algorithmic Lens. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (WG, 2023)

Building large k-cores from sparse graphs. - Fedor V. Fomin; Danil Sagunov; Kirill Simonov (J. Comput. Syst. Sci., 2023)

Parameterized Complexity of Feature Selection for Categorical Data Clustering. - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; Kirill Simonov (ACM Trans. Comput. Theory, 2023)

Lossy Kernelization of Same-Size Clustering. - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; Nidhi Purohit; Kirill Simonov (Theory Comput. Syst., 2023)

How to find a good explanation for clustering? - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; William Lochet; Nidhi Purohit; Kirill Simonov (Artif. Intell., 2023)

Detours in directed graphs. - Fedor V. Fomin; Petr A. Golovach; William Lochet; Danil Sagunov; Saket Saurabh 001; Kirill Simonov (J. Comput. Syst. Sci., 2023)

Combining Crown Structures for Vulnerability Measures. - Katrin Casel; Tobias Friedrich 001; Aikaterini Niklanovits; Kirill Simonov; Ziena Zeif (IPEC, 2024)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs. - Tomohiro Koana; Nidhi Purohit; Kirill Simonov (IPEC, 2024)

PACE Solver Description: Crossy - An Exact Solver for One-Sided Crossing Minimization. - Tobias Röhr; Kirill Simonov (IPEC, 2024)

A Contraction Tree SAT Encoding for Computing Twin-Width. - Yinon Horev; Shiraz Shay; Sarel Cohen; Tobias Friedrich 001; Davis Issac; Lior Kamma; Aikaterini Niklanovits; Kirill Simonov (PAKDD (2), 2024)

Tree Containment Above Minimum Degree is FPT. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (SODA, 2024)

Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (CoRR, 2024)

On coresets for fair clustering in metric and Euclidean spaces and their applications. - Sayan Bandyapadhyay; Fedor V. Fomin; Kirill Simonov (J. Comput. Syst. Sci., 2024)

Longest Cycle above Erdős-Gallai Bound. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (SIAM J. Discret. Math., 2024)

Counting vanishing matrix-vector products. - Cornelius Brand; Viktoriia Korchemna; Kirill Simonov; Michael Skotnica (Theor. Comput. Sci., 2024)

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. - Robert Ganian; Thekla Hamm; Viktoriia Korchemna; Karolina Okrasa; Kirill Simonov (ACM Trans. Algorithms, 2024)

Approximating Long Cycle Above Dirac's Guarantee. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (Algorithmica, 2024)

Fixed-Parameter Tractability of Maximum Colored Path and Beyond. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Kirill Simonov; Giannos Stamoulis (ACM Trans. Algorithms, 2024)

Integrating higher-order relations for enhanced twitter bot detection. - Sebastian Reiche; Sarel Cohen; Kirill Simonov; Tobias Friedrich 001 (Soc. Netw. Anal. Min., 2024)

Packing Short Cycles. - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; William Lochet; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Kirill Simonov (SODA, 2025)

Binary k-Center with Missing Entries: Structure Leads to Tractability. - Farehe Soheil; Kirill Simonov; Tobias Friedrich 001 (CoRR, 2025)

Connected Partitions via Connected Dominating Sets. - Aikaterini Niklanovits; Kirill Simonov; Shaily Verma; Ziena Zeif (CoRR, 2025)

Structural Parameterization of Steiner Tree Packing. - Niko Hastrich; Kirill Simonov (CoRR, 2025)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes. - Nadym Mallek; Kirill Simonov (CoRR, 2025)

Edge Clique Partition and Cover Beyond Independence. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (CoRR, 2025)