Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time. - Thekla Hamm (IPEC, 2019)

Extending Partial 1-Planar Drawings. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (ICALP, 2020)

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. - Jiehua Chen 001; Robert Ganian; Thekla Hamm (IJCAI, 2020)

The Complexity Landscape of Resource-Constrained Scheduling. - Robert Ganian; Thekla Hamm; Guillaume Mescoff (IJCAI, 2020)

Extending Nearly Complete 1-Planar Drawings in Polynomial Time. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (MFCS, 2020)

The Complexity of Object Association in Multiple Object Tracking. - Robert Ganian; Thekla Hamm; Sebastian Ordyniak (AAAI, 2021)

Computing Kemeny Rankings from d-Euclidean Preferences. - Thekla Hamm; Martin Lackner; Anna Rapberger (ADT, 2021)

Crossing-Optimal Extension of Simple Drawings. - Robert Ganian; Thekla Hamm; Fabian Klute; Irene Parada; Birgit Vogtenhuber (ICALP, 2021)

The Parameterized Complexity of Connected Fair Division. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (IJCAI, 2021)

Measuring what matters: A hybrid approach to dynamic programming with treewidth. - Eduard Eiben; Robert Ganian; Thekla Hamm; O-joung Kwon (J. Comput. Syst. Sci., 2021)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs. - Thekla Hamm; Nina Klobas; George B. Mertzios; Paul G. Spirakis (AAAI, 2022)

Parameterised Partially-Predrawn Crossing Number. - Thekla Hamm; Petr Hlinený (SoCG, 2022)

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

The Complexity of Envy-Free Graph Cutting. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (IJCAI, 2022)

A Unifying Framework for Characterizing and Computing Width Measures. - Eduard Eiben; Robert Ganian; Thekla Hamm; Lars Jaffke; O-joung Kwon (ITCS, 2022)

An efficient algorithm for counting Markov equivalent DAGs. - Robert Ganian; Thekla Hamm; Topi Talvitie (Artif. Intell., 2022)

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

Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. - Parinya Chalermsook; Fedor V. Fomin; Thekla Hamm; Tuukka Korhonen; Jesper Nederlof; Ly Orgo (ESA, 2023)

Parameterized complexity of envy-free resource allocation in social networks. - Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (Artif. Intell., 2023)

Approximate Evaluation of Quantitative Second Order Queries. - Jan Dreier; Robert Ganian; Thekla Hamm (CoRR, 2023)

Maximizing Social Welfare in Score-Based Social Distance Games. - Robert Ganian; Thekla Hamm; Dusan Knop; Sanjukta Roy 001; Simon Schierreich; Ondrej Suchý 001 (TARK, 2023)

Hedonic diversity games: A complexity picture with more than two colors. - Robert Ganian; Thekla Hamm; Dusan Knop; Simon Schierreich; Ondrej Suchý 001 (Artif. Intell., 2023)

Computing crossing numbers with topological and geometric restrictions. - Thekla Hamm; Fabian Klute; Irene Parada (CoRR, 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)

Crossing and Independent Families Among Polygons. - Anna Brötzner; Robert Ganian; Thekla Hamm; Fabian Klute; Irene Parada (WADS, 2025)

Oracle Separations for RPH. - Thekla Hamm; Lucas Meijer; Tillmann Miltzow; Subhasree Patro (CoRR, 2025)