Kirill Simonov

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

Email:	ksimonov@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/ksimonov/

25 results


[25]	Algorithmic Extensions of Dirac's Theorem Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov Chapter in , pages 406-416. [bibtex] [pdf] [doi]
2024
[24]	The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024. [bibtex] [pdf] [doi]
[23]	Counting Vanishing Matrix-Vector Products Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of Lecture Notes in Computer Science, pages 335–349, 2024, Springer Verlag. [bibtex] [pdf] [doi]
2023
[22]	Consistency Checking Problems: A Gateway to Parameterized Sample Complexity Robert Ganian, Liana Khazaliya, Kirill Simonov 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 18:1–18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[21]	Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 203–217, 2023, Springer Verlag. [bibtex] [pdf] [doi]
[20]	A Parameterized Theory of PAC Learning Cornelius Brand, Robert Ganian, Kirill Simonov Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6834–6841, 2023, AAAI Press. [bibtex] [pdf]
[19]	The Parameterized Complexity of Network Microaggregation Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6262–6270, 2023, AAAI Press. [bibtex] [pdf]
2022
[18]	Fine-grained Complexity of Partial Minimum Satisfiability Ivan Bliznets, Danil Sagunov, Kirill Simonov Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22 (Lud De Raedt, ed.), pages 1774–1780, 7 2022, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track [bibtex] [pdf] [doi]
[17]	The Complexity of k-Means Clustering when Little is Known Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, Sivan Sabato, eds.), volume 162 of Proceedings of Machine Learning Research, pages 6960–6987, 2022, PMLR. [bibtex] [pdf]
[16]	The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, eds.), volume 229 of LIPIcs, pages 66:1–66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[15]	Weighted Model Counting with Twin-Width Robert Ganian, Filip Pokrývka, Andre Schidler, Kirill Simonov, Stefan Szeider 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 15:1–15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[14]	Longest Cycle above Erd\Hos–Gallai Bound Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov 30th Annual European Symposium on Algorithms (ESA 2022), volume 271 of LIPIcs, pages 13:1–13:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [doi]
[13]	Detours in Directed Graphs Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29:1–29:16, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[12]	Testing Upward Planarity of Partial 2-Trees Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of Lecture Notes in Computer Science, pages 175–187, 2022, Springer Verlag. [bibtex] [pdf] [doi]
[11]	Parameterized Algorithms for Upward Planarity Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 26:1–26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[10]	FPT Approximation for Fair Minimum-Load Clustering Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[9]	How to Find a Good Explanation for Clustering? Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 3904–3912, 2022, AAAI Press. [bibtex] [pdf]
2021
[8]	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]
[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]
[5]	Parameterized Complexity of Feature Selection for Categorical Data Clustering Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (Filippo Bonchi, Simon J. Puglisi, eds.), volume 202 of Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1–14:14, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
2020
[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]