| Refined complexity of PCA with outliers K Simonov, F Fomin, P Golovach, F Panolan International Conference on Machine Learning, 5818-5826, 2019 | 13 | 2019 |
| On coresets for fair clustering in metric and euclidean spaces and their applications S Bandyapadhyay, FV Fomin, K Simonov arXiv preprint arXiv:2007.10137, 2020 | 12 | 2020 |
| Parameterized k-clustering: tractability island FV Fomin, PA Golovach, K Simonov Journal of Computer and System Sciences 117, 50-74, 2021 | 5 | 2021 |
| EPTAS for k-means Clustering of Affine Subspaces E Eiben, FV Fomin, PA Golovach, W Lochet, F Panolan, K Simonov Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 5 | 2021 |
| Algorithmic Extensions of Dirac's Theorem∗ FV Fomin, PA Golovach, D Sagunov, K Simonov Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 4 | 2022 |
| Manipulating districts to win elections: fine-grained complexity E Eiben, F Fomin, F Panolan, K Simonov Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1902-1909, 2020 | 4 | 2020 |
| Parameterized k-Clustering: The distance matters! FV Fomin, PA Golovach, K Simonov arXiv preprint arXiv:1902.08559, 2019 | 4 | 2019 |
| Parameterized Complexity of PCA (Invited Talk) FV Fomin, PA Golovach, K Simonov 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), 2020 | 3 | 2020 |
| Fixed-Parameter and Approximation Algorithms for PCA with Outliers Y Dahiya, F Fomin, F Panolan, K Simonov International Conference on Machine Learning, 2341-2351, 2021 | 2 | 2021 |
| Longest Cycle above Erd\H {o} s-Gallai Bound FV Fomin, PA Golovach, D Sagunov, K Simonov arXiv preprint arXiv:2202.03061, 2022 | 1 | 2022 |
| Detours in Directed Graphs FV Fomin, PA Golovach, W Lochet, D Sagunov, K Simonov, S Saurabh arXiv preprint arXiv:2201.03318, 2022 | 1 | 2022 |
| The fine-grained complexity of graph homomorphism parameterized by clique-width R Ganian, T Hamm, V Korchemna, K Okrasa, K Simonov 49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022 | 1 | 2022 |
| FPT Approximation for Fair Minimum-Load Clustering S Bandyapadhyay, FV Fomin, PA Golovach, N Purohit, K Simonov arXiv preprint arXiv:2107.09481, 2021 | 1 | 2021 |
| Parameterized Complexity of Feature Selection for Categorical Data Clustering S Bandyapadhyay, FV Fomin, PA Golovach, K Simonov arXiv preprint arXiv:2105.03753, 2021 | 1 | 2021 |
| Refined complexity of PCA with outliers FV Fomin, PA Golovach, F Panolan, K Simonov arXiv preprint arXiv:1905.04124, 2019 | 1 | 2019 |
| Fixed-Parameter Tractability of Maximum Colored Path and Beyond FV Fomin, PA Golovach, T Korhonen, K Simonov, G Stamoulis arXiv preprint arXiv:2207.07449, 2022 | | 2022 |
| The Complexity of k-Means Clustering when Little is Known R Ganian, T Hamm, V Korchemna, K Okrasa, K Simonov International Conference on Machine Learning, 6960-6987, 2022 | | 2022 |
| How to Find a Good Explanation for Clustering? S Bandyapadhyay, F Fomin, PA Golovach, W Lochet, N Purohit, ... Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3904-3912, 2022 | | 2022 |
| Weighted Model Counting with Twin-Width R Ganian, F Pokrývka, A Schidler, K Simonov, S Szeider arXiv preprint arXiv:2206.01706, 2022 | | 2022 |
| Parameterized algorithms for upward planarity S Chaplick, E Di Giacomo, F Frati, R Ganian, CN Raftopoulou, K Simonov arXiv preprint arXiv:2203.05364, 2022 | | 2022 |
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
