Viktoriia Korchemna | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/viktoriia-korchemna/Viktoriia KorchemnaHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngViktoriia Korchemnahttps://ac.tuwien.ac.at/team/viktoriia-korchemna/A Fixed-Parameter Algorithm for Extending Upward Planar Drawingshttps://ac.tuwien.ac.at/publication/a-fixed-parameter-algorithm-for-extending-upward-planar-drawings/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-fixed-parameter-algorithm-for-extending-upward-planar-drawings/A structural complexity analysis of synchronous dynamical systemshttps://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/Counting Vanishing Matrix-Vector Productshttps://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/Revisiting Causal Discovery from a Complexity-Theoretic Perspectivehttps://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/Slim Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/slim-tree-cut-width-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/slim-tree-cut-width-2/The Complexity of Fair Division of Indivisible Items with Externalitieshttps://ac.tuwien.ac.at/publication/the-complexity-of-fair-division-of-indivisible-items-with-externalities/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-fair-division-of-indivisible-items-with-externalities/The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Widthhttps://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/A Structural Complexity Analysis of Synchronous Dynamical Systemshttps://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/Deterministic Constrained Multilinear Detectionhttps://ac.tuwien.ac.at/publication/deterministic-constrained-multilinear-detection/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/deterministic-constrained-multilinear-detection/Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cutshttps://ac.tuwien.ac.at/publication/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts/Slim Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/slim-tree-cut-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/slim-tree-cut-width/The Complexity of k-Means Clustering when Little is Knownhttps://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Widthhttps://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/The Complexity of Bayesian Network Learning: Revisiting the Superstructurehttps://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/