Viktoria Korchemna

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

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

 

Publications:
12 results

2024
[12]Slim Tree-Cut Width
,
Algorithmica, volume 86, number 8, pages 2714–2738, 2024.
[bibtex] [pdf] [doi]
[11]The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
, , , ,
ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024.
[bibtex] [pdf] [doi]
[10]Revisiting Causal Discovery from a Complexity-Theoretic Perspective
, ,
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3377–3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
[bibtex] [doi]
[9]The Complexity of Fair Division of Indivisible Items with Externalities
, , ,
Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada (Michael J. Wooldridge, Jennifer G. Dy, Sriraam Natarajan, eds.), pages 9653–9661, 2024, AAAI Press.
[bibtex] [pdf] [doi]
[8]Counting Vanishing Matrix-Vector Products
, , ,
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
[7]A Structural Complexity Analysis of Synchronous Dynamical Systems
, , ,
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 6313–6321, 2023, AAAI Press.
[bibtex] [pdf]
[6]Deterministic Constrained Multilinear Detection
, ,
48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France (Jérôme Leroux, Sylvain Lombardy, David Peleg, eds.), volume 272 of LIPIcs, pages 25:1–25:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
2022
[5]Slim Tree-Cut Width
,
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell, Jesper Nederlof, eds.), volume 249 of LIPIcs, pages 15:1–15:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[4]The Complexity of k-Means Clustering when Little is Known
, , , ,
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]
[3]The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
, , , ,
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]
[2]Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
, , , ,
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos, Michael Kaufmann, eds.), volume 13453 of Lecture Notes in Computer Science, pages 98–113, 2022, Springer Verlag.
[bibtex] [pdf] [doi]
2021
[1]The Complexity of Bayesian Network Learning: Revisiting the Superstructure
,
Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual (Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, eds.), pages 430–442, 2021.
[bibtex] [pdf]