Thekla Hamm

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 42

Top Topics

Complexity Analysis

Multiple Object Tracking

Parameterized Complexity

Top Venues

Publications

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)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR (2023)
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
Maximizing Social Welfare in Score-Based Social Distance Games. TARK (2023)
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
A Structural Complexity Analysis of Synchronous Dynamical Systems. CoRR (2023)
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
Hedonic diversity games: A complexity picture with more than two colors. Artif. Intell. 325 (2023)
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Parameterized complexity of envy-free resource allocation in social networks. Artif. Intell. 315 (2023)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA (2023)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Envy-Free Graph Cutting. CoRR (2023)
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
A Structural Complexity Analysis of Synchronous Dynamical Systems. AAAI (2023)
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
Maximizing Social Welfare in Score-Based Social Distance Games. CoRR (2023)
Jan Dreier, Robert Ganian, Thekla Hamm
Approximate Evaluation of Quantitative Second Order Queries. CoRR (2023)
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. AAAI (2022)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ICALP (2022)
Thekla Hamm, Petr Hlinený
Parameterised Partially-Predrawn Crossing Number. SoCG (2022)
Robert Ganian, Thekla Hamm, Topi Talvitie
An efficient algorithm for counting Markov equivalent DAGs. Artif. Intell. 304 (2022)
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. AAAI (2022)
Thekla Hamm, Petr Hlinený
Parameterised Partially-Predrawn Crossing Number. 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)
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
A Unifying Framework for Characterizing and Computing Width Measures. ITCS (2022)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Envy-Free Graph Cutting. IJCAI (2022)
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. CoRR (2022)
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. CoRR (2022)
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
Crossing-Optimal Extension of Simple Drawings. ICALP (2021)
Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Object Association in Multiple Object Tracking. AAAI (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
Measuring what matters: A hybrid approach to dynamic programming with treewidth. J. Comput. Syst. Sci. 121 (2021)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Parameterized Complexity of Connected Fair Division. IJCAI (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
A Unifying Framework for Characterizing and Computing Width Measures. CoRR (2021)
Thekla Hamm, Martin Lackner, Anna Rapberger
Computing Kemeny Rankings from d-Euclidean Preferences. ADT (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Partial 1-Planar Drawings. CoRR (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. CoRR (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. AAAI (2020)
Robert Ganian, Thekla Hamm, Topi Talvitie
An Efficient Algorithm for Counting Markov Equivalent DAGs. AAAI (2020)
Robert Ganian, Thekla Hamm, Guillaume Mescoff
The Complexity Landscape of Resource-Constrained Scheduling. IJCAI (2020)
Jiehua Chen, Robert Ganian, Thekla Hamm
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. CoRR (2020)
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
Crossing-Optimal Extension of Simple Drawings. CoRR (2020)
Jiehua Chen, Robert Ganian, Thekla Hamm
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. IJCAI (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. MFCS (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Partial 1-Planar Drawings. ICALP (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. CoRR (2019)
Thekla Hamm
Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time. IPEC (2019)
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. MFCS (2019)