Viktoriia Korchemna

According to our database, Viktoriia Korchemna authored at least 12 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

EF1 and EFX Orientations.

Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

2024

Counting Vanishing Matrix-Vector Products.

Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica

Proceedings of the WALCOM: Algorithms and Computation, 2024

Revisiting Causal Discovery from a Complexity-Theoretic Perspective.

Robert Ganian, Viktoriia Korchemna, Stefan Szeider

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Efficient Approximation of Fractional Hypertree Width.

Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

The Complexity of Fair Division of Indivisible Items with Externalities.

Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Deterministic Constrained Multilinear Detection.

Cornelius Brand, Viktoriia Korchemna, Michael Skotnica

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

A Structural Complexity Analysis of Synchronous Dynamical Systems.

Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.

Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Slim Tree-Cut Width.

Robert Ganian, Viktoriia Korchemna

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

The Complexity of k-Means Clustering when Little is Known.

Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov

Proceedings of the International Conference on Machine Learning, 2022

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.

Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

The Complexity of Bayesian Network Learning: Revisiting the Superstructure.

Robert Ganian, Viktoriia Korchemna

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021