The Complexity of Bayesian Network Learning: Revisiting the Superstructure. - Robert Ganian; Viktoriia Korchemna (NeurIPS, 2021)

The Complexity of k-Means Clustering when Little is Known. - Robert Ganian; Thekla Hamm; Viktoriia Korchemna; Karolina Okrasa; Kirill Simonov (ICML, 2022)

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. - Cornelius Brand; Esra Ceylan; Robert Ganian; Christian Hatschka; Viktoriia Korchemna (WG, 2022)

A Structural Complexity Analysis of Synchronous Dynamical Systems. - Eduard Eiben; Robert Ganian; Thekla Hamm; Viktoriia Korchemna (AAAI, 2023)

Deterministic Constrained Multilinear Detection. - Cornelius Brand; Viktoriia Korchemna; Michael Skotnica (MFCS, 2023)

The Complexity of Fair Division of Indivisible Items with Externalities. - Argyrios Deligkas; Eduard Eiben; Viktoriia Korchemna; Simon Schierreich (AAAI, 2024)

Efficient Approximation of Fractional Hypertree Width. - Viktoriia Korchemna; Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan; Jie Xue 003 (FOCS, 2024)

Revisiting Causal Discovery from a Complexity-Theoretic Perspective. - Robert Ganian; Viktoriia Korchemna; Stefan Szeider (IJCAI, 2024)

EF1 and EFX Orientations. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith; Viktoriia Korchemna (CoRR, 2024)

Counting vanishing matrix-vector products. - Cornelius Brand; Viktoriia Korchemna; Kirill Simonov; Michael Skotnica (Theor. Comput. Sci., 2024)

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. - Robert Ganian; Thekla Hamm; Viktoriia Korchemna; Karolina Okrasa; Kirill Simonov (ACM Trans. Algorithms, 2024)

Slim Tree-Cut Width. - Robert Ganian; Viktoriia Korchemna (Algorithmica, 2024)