Viktoriia Korchemna

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 17

Top Topics

Top Venues

Publications

Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
The Complexity of Fair Division of Indivisible Items with Externalities. AAAI (2024)
Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica
Counting Vanishing Matrix-Vector Products. WALCOM (2024)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms 20 (3) (2024)
Robert Ganian, Viktoriia Korchemna
Slim Tree-Cut Width. Algorithmica 86 (8) (2024)
Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
The Complexity of Fair Division of Indivisible Items with Externalities. CoRR (2023)
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
A Structural Complexity Analysis of Synchronous Dynamical Systems. CoRR (2023)
Cornelius Brand, Viktoriia Korchemna, Michael Skotnica, Kirill Simonov
Counting Vanishing Matrix-Vector Products. CoRR (2023)
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
A Structural Complexity Analysis of Synchronous Dynamical Systems. AAAI (2023)
Cornelius Brand, Viktoriia Korchemna, Michael Skotnica
Deterministic Constrained Multilinear Detection. MFCS (2023)
Robert Ganian, Viktoriia Korchemna
Slim Tree-Cut Width. CoRR (2022)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ICALP (2022)
Robert Ganian, Viktoriia Korchemna
Slim Tree-Cut Width. IPEC (2022)
Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. CoRR (2022)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Complexity of k-Means Clustering when Little is Known. ICML (2022)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. CoRR (2022)
Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. WG (2022)
Robert Ganian, Viktoriia Korchemna
The Complexity of Bayesian Network Learning: Revisiting the Superstructure. NeurIPS (2021)