| On coresets for fair clustering in metric and euclidean spaces and their applications S Bandyapadhyay, FV Fomin, K Simonov Journal of Computer and System Sciences 142, 103506, 2024 | 47 | 2024 |
| How to find a good explanation for clustering? S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ... Artificial Intelligence 322, 103948, 2023 | 36 | 2023 |
| Parameterized algorithms for upward planarity S Chaplick, E Di Giacomo, F Frati, R Ganian, CN Raftopoulou, K Simonov arXiv preprint arXiv:2203.05364, 2022 | 21 | 2022 |
| Refined complexity of PCA with outliers K Simonov, F Fomin, P Golovach, F Panolan International Conference on Machine Learning, 5818-5826, 2019 | 18 | 2019 |
| The fine-grained complexity of graph homomorphism parameterized by clique-width R Ganian, T Hamm, V Korchemna, K Okrasa, K Simonov arXiv preprint arXiv:2210.06845, 2022 | 14 | 2022 |
| 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 | 14 | 2022 |
| Weighted model counting with twin-width R Ganian, F Pokrývka, A Schidler, K Simonov, S Szeider arXiv preprint arXiv:2206.01706, 2022 | 13 | 2022 |
| Fixed-parameter tractability of maximum colored path and beyond FV Fomin, PA Golovach, T Korhonen, K Simonov, G Stamoulis ACM Transactions on Algorithms 20 (4), 1-48, 2024 | 12 | 2024 |
| Parameterized k-clustering: tractability island FV Fomin, PA Golovach, K Simonov Journal of Computer and System Sciences 117, 50-74, 2021 | 11 | 2021 |
| 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 | 10 | 2020 |
| Detours in directed graphs FV Fomin, PA Golovach, W Lochet, D Sagunov, S Saurabh, K Simonov Journal of Computer and System Sciences 137, 66-86, 2023 | 9 | 2023 |
| Testing upward planarity of partial 2-trees S Chaplick, E Di Giacomo, F Frati, R Ganian, CN Raftopoulou, K Simonov International Symposium on Graph Drawing and Network Visualization, 175-187, 2022 | 9 | 2022 |
| 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 | 9 | 2021 |
| Longest cycle above Erdős–Gallai bound FV Fomin, PA Golovach, D Sagunov, K Simonov SIAM Journal on Discrete Mathematics 38 (4), 2721-2749, 2024 | 8 | 2024 |
| 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 | 8 | 2022 |
| 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 | 8 | 2021 |
| A parameterized theory of PAC learning C Brand, R Ganian, K Simonov Proceedings of the AAAI Conference on Artificial Intelligence 37 (6), 6834-6841, 2023 | 6 | 2023 |
| Parameterized complexity of feature selection for categorical data clustering S Bandyapadhyay, FV Fomin, PA Golovach, K Simonov ACM Transactions on Computation Theory 15 (3-4), 1-24, 2023 | 4 | 2023 |
| Upward and orthogonal planarity are W [1]-hard parameterized by treewidth BMP Jansen, L Khazaliya, P Kindermann, G Liotta, F Montecchiani, ... International Symposium on Graph Drawing and Network Visualization, 203-217, 2023 | 4 | 2023 |
| The parameterized complexity of network microaggregation V Blažej, R Ganian, D Knop, J Pokorný, Š Schierreich, K Simonov Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 6262-6270, 2023 | 4 | 2023 |
Fedor V. FominProfessor of Computer Science, University of BergenΗ διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα uib.no
