Thekla Hamm | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/thekla-hamm/Thekla HammHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngThekla Hammhttps://ac.tuwien.ac.at/team/thekla-hamm/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/The Complexity of Envy-Free Graph Cuttinghttps://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/Approximate Evaluation of Quantitative Second Order Querieshttps://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/Crossing and Independent Families Among Polygonshttps://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/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/Hedonic diversity games: A complexity picture with more than two colorshttps://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors-2/Maximizing Social Welfare in Score-Based Social Distance Gameshttps://ac.tuwien.ac.at/publication/maximizing-social-welfare-in-score-based-social-distance-games/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/maximizing-social-welfare-in-score-based-social-distance-games/Parameterized complexity of envy-free resource allocation in social networkshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/A Unifying Framework for Characterizing and Computing Width Measureshttps://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/An efficient algorithm for counting Markov equivalent DAGshttps://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/Hedonic Diversity Games: A Complexity Picture with More than Two Colorshttps://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/Parameterised Partially-Predrawn Crossing Numberhttps://ac.tuwien.ac.at/publication/parameterised-partially-predrawn-crossing-number/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterised-partially-predrawn-crossing-number/The Complexity of Envy-Free Graph Cuttinghttps://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/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 Complexity of Temporal Vertex Cover in Small-Degree Graphshttps://ac.tuwien.ac.at/publication/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs/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/Computing Kemeny Rankings from d-Euclidean Preferenceshttps://ac.tuwien.ac.at/publication/computing-kemeny-rankings-from-d-euclidean-preferences/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-kemeny-rankings-from-d-euclidean-preferences/Crossing-Optimal Extension of Simple Drawingshttps://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Measuring what matters: A hybrid approach to dynamic programming with treewidthhttps://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/The Complexity of Object Association in Multiple Object Trackinghttps://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/The Parameterized Complexity of Connected Fair Divisionhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/An Efficient Algorithm for Counting Markov Equivalent DAGshttps://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/Extending Nearly Complete 1-Planar Drawings in Polynomial Timehttps://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/Extending Nearly Complete 1-Planar Drawings in Polynomial Timehttps://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/Extending Partial 1-Planar Drawingshttps://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/Extending Partial 1-Planar Drawingshttps://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/Parameterized Complexity of Envy-Free Resource Allocation in Social Networkshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks/Stable Matchings with Diversity Constraints: Affirmative Action is beyond NPhttps://ac.tuwien.ac.at/publication/stable-matchings-with-diversity-constraints-affirmative-action-is-beyond-np/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/stable-matchings-with-diversity-constraints-affirmative-action-is-beyond-np/The Complexity Landscape of Resource-Constrained Schedulinghttps://ac.tuwien.ac.at/publication/the-complexity-landscape-of-resource-constrained-scheduling/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-resource-constrained-scheduling/Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Timehttps://ac.tuwien.ac.at/publication/finding-linear-arrangements-of-hypergraphs-with-bounded-cutwidth-in-linear-time/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-linear-arrangements-of-hypergraphs-with-bounded-cutwidth-in-linear-time/Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidthhttps://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth/