Thekla Hamm
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
25
Venues
11
Active years
2019–2026
Best venue rank
A*
Where they publish
Papers
25 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Edge-Binary Public Goods Games. | Thekla Hamm, Paloma T. Lima |
| 2026 | ESA | Linear-Time Vertex-Connectivity for Graphs of Bounded Genus. | Sergio Cabello, Alexander Dobler, Gasper Fijavz, Thekla Hamm, Mirko H. Wagner |
| 2026 | STACS | A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs. | Thekla Hamm, Sukanya Pandey, Krisztina Szilgyi |
| 2026 | WG | Parameterized Complexity of Power Network Design: Coordinating Cable Placement Is Hard. | Thekla Hamm, Bart M. P. Jansen, Faezeh Motiei |
| 2025 | ESA | On Algorithmic Applications of ℱ-Branchwidth. | Benjamin Bergougnoux, Thekla Hamm, Lars Jaffke, Paloma T. Lima |
| 2025 | ISAAC | A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth. | Sergio Cabello, Alexander Dobler, Gasper Fijavz, Thekla Hamm, Mirko H. Wagner |
| 2025 | LICS | Approximate Evaluation of Quantitative Second Order Queries. | Jan Dreier, Robert Ganian, Thekla Hamm |
| 2025 | WADS | Crossing and Independent Families Among Polygons. | Anna Brtzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada |
| 2023 | AAAI | A Structural Complexity Analysis of Synchronous Dynamical Systems. | Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna |
| 2023 | ESA | Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. | Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo |
| 2022 | AAAI | Hedonic Diversity Games: A Complexity Picture with More than Two Colors. | Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Such |
| 2022 | AAAI | The Complexity of Temporal Vertex Cover in Small-Degree Graphs. | Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis |
| 2022 | ICALP | The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
| 2022 | ICML | The Complexity of k-Means Clustering when Little is Known. | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
| 2022 | IJCAI | The Complexity of Envy-Free Graph Cutting. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2021 | AAAI | The Complexity of Object Association in Multiple Object Tracking. | Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2021 | ICALP | Crossing-Optimal Extension of Simple Drawings. | Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber |
| 2021 | IJCAI | The Parameterized Complexity of Connected Fair Division. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2020 | AAAI | Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. | Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2020 | AAAI | An Efficient Algorithm for Counting Markov Equivalent DAGs. | Robert Ganian, Thekla Hamm, Topi Talvitie |
| 2020 | ICALP | Extending Partial 1-Planar Drawings. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2020 | IJCAI | Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. | Jiehua Chen, Robert Ganian, Thekla Hamm |
| 2020 | IJCAI | The Complexity Landscape of Resource-Constrained Scheduling. | Robert Ganian, Thekla Hamm, Guillaume Mescoff |
| 2020 | MFCS | Extending Nearly Complete 1-Planar Drawings in Polynomial Time. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2019 | MFCS | Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. | Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon |