Articoli con mandati relativi all'accesso pubblico - Kirill SimonovUlteriori informazioni
Disponibili pubblicamente: 30
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
Mandati: European Commission, Research Council of Norway
How to find a good explanation for clustering?
S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ...
Artificial Intelligence 322, 103948, 2023
Mandati: German Research Foundation, European Commission, Research Council of Norway
Refined complexity of PCA with outliers
K Simonov, F Fomin, P Golovach, F Panolan
International Conference on Machine Learning, 5818-5826, 2019
Mandati: Research Council of Norway
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
Mandati: Austrian Science Fund, Research Council of Norway
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
Mandati: Austrian Science Fund, Research Council of Norway, Agence Nationale de la …
Parameterized k-clustering: tractability island
FV Fomin, PA Golovach, K Simonov
Journal of Computer and System Sciences 117, 50-74, 2021
Mandati: Research Council of Norway
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
Mandati: Austrian Science Fund, Governo Italiano
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
Mandati: European Commission
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
Mandati: Research Council of Norway
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
Mandati: Research Council of Norway
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
Mandati: German Research Foundation, European Commission, Research Council of Norway
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
Mandati: Austrian Science Fund
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
Mandati: Austrian Science Fund, European Commission
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
Mandati: Research Council of Norway
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
Mandati: Austrian Science Fund, German Research Foundation
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
Mandati: Austrian Science Fund, German Research Foundation, European Commission …
Proportionally fair matching with multiple groups
S Bandyapadhyay, FV Fomin, T Inamdar, K Simonov
International Workshop on Graph-Theoretic Concepts in Computer Science, 1-15, 2023
Mandati: European Commission, Research Council of Norway
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
Mandati: German Research Foundation, Research Council of Norway
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
Mandati: German Research Foundation, European Commission, Research Council of Norway
Parameterized complexity of PCA
F Fomin, P Golovach, K Simonov
Dagstuhl publishing, 2020
Mandati: Research Council of Norway
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software