Kirill Simonov

Address:
Kirill Simonov
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room:	HF0413
Phone:	+43(1)58801–192148
Email:	ksimonov@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/ksimonov/

9 results

2021
[9]	Parameterized k-Clustering: Tractability island Fedor V. Fomin, Petr A. Golovach, Kirill Simonov Journal of Computer and System Sciences, volume 117, pages 50 - 74, 2021. [bibtex] [pdf] [doi]
[8]	Parameterized Complexity of Feature Selection for Categorical Data Clustering Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov CoRR, volume abs/2105.03753, 2021. [bibtex] [pdf]
[7]	EPTAS for \emphk-means Clustering of Affine Subspaces Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 (Dániel Marx, ed.), pages 2649–2659, 2021, SIAM. [bibtex] [pdf] [doi]
[6]	On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), 2021. [bibtex] [pdf] [doi]
2020
[5]	Algorithmic Extensions of Dirac's Theorem Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov CoRR, volume abs/2011.03619, 2020. [bibtex] [pdf]
[4]	Building Large k-Cores from Sparse Graphs Fedor V. Fomin, Danil Sagunov, Kirill Simonov 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) (Javier Esparza, Daniel Kráľ, eds.), volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35:1–35:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	Low-Rank Binary Matrix Approximation in Column-Sum Norm Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) (Jarosław Byrka, Raghu Meka, eds.), volume 176 of Leibniz International Proceedings in Informatics (LIPIcs), pages 32:1–32:18, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[2]	Manipulating Districts to Win Elections: Fine-Grained Complexity Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 1902–1909, 2020, AAAI Press. [bibtex] [pdf]
2019
[1]	Refined Complexity of PCA with Outliers Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Kamalika Chaudhuri, Ruslan Salakhutdinov, eds.), volume 97 of Proceedings of Machine Learning Research, pages 5818–5826, 2019, PMLR. [bibtex] [pdf]