Spremljaj
Kirill Simonov
Kirill Simonov
Postdoc, TU Wien
Preverjeni e-poštni naslov na ac.tuwien.ac.at
Naslov
Navedeno
Navedeno
Leto
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
402024
How to find a good explanation for clustering?
S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ...
Artificial Intelligence, 103948, 2023
182023
Parameterized algorithms for upward planarity
S Chaplick, E Di Giacomo, F Frati, R Ganian, CN Raftopoulou, K Simonov
arXiv preprint arXiv:2203.05364, 2022
172022
Refined complexity of PCA with outliers
K Simonov, F Fomin, P Golovach, F Panolan
International Conference on Machine Learning, 5818-5826, 2019
152019
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
122022
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
102022
Parameterized k-clustering: tractability island
FV Fomin, PA Golovach, K Simonov
Journal of Computer and System Sciences 117, 50-74, 2021
102021
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
92021
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
82023
Weighted model counting with twin-width
R Ganian, F Pokrývka, A Schidler, K Simonov, S Szeider
arXiv preprint arXiv:2206.01706, 2022
82022
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
72020
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
62022
Longest Cycle above Erd\H {o} s-Gallai Bound
FV Fomin, PA Golovach, D Sagunov, K Simonov
arXiv preprint arXiv:2202.03061, 2022
62022
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
62021
Fixed-parameter tractability of maximum colored path and beyond
FV Fomin, PA Golovach, T Korhonen, K Simonov, G Stamoulis
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
52023
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
52022
Parameterized k-Clustering: The distance matters!
FV Fomin, PA Golovach, K Simonov
arXiv preprint arXiv:1902.08559, 2019
42019
Lossy kernelization of same-size clustering
S Bandyapadhyay, FV Fomin, PA Golovach, N Purohit, K Simonov
Theory of Computing Systems 67 (4), 785-824, 2023
32023
FPT Approximation for Fair Minimum-Load Clustering
S Bandyapadhyay, FV Fomin, PA Golovach, N Purohit, K Simonov
arXiv preprint arXiv:2107.09481, 2021
32021
Parameterized Complexity of PCA (Invited Talk)
FV Fomin, PA Golovach, K Simonov
17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), 2020
32020
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20