Thekla Hamm

54 papers A* 17A 4B 6Journal 26Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A conf
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs.
STACS
Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi
2026 J jnl
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs.
CoRR
Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi
2026 J jnl
A structural complexity analysis of synchronous dynamical systems.
Artif. Intell.
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
2026 A* conf
Edge-Binary Public Goods Games.
AAAI
Thekla Hamm, Paloma T. Lima
2026 J jnl
Even Faster Geosocial Reachability Queries.
CoRR
Rick van der Heijden, Nikolay Yakovets, Thekla Hamm
2025 B conf
A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth.
ISAAC
Sergio Cabello, Alexander Dobler, Gasper Fijavz, Thekla Hamm, Mirko H. Wagner
2025 J jnl
A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth.
CoRR
Sergio Cabello, Alexander Dobler, Gasper Fijavz, Thekla Hamm, Mirko H. Wagner
2025 A* conf
Approximate Evaluation of Quantitative Second Order Queries.
LICS
Jan Dreier, Robert Ganian, Thekla Hamm
2025 B conf
Crossing and Independent Families Among Polygons.
WADS
Anna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada
2025 A conf
On Algorithmic Applications of ℱ-Branchwidth.
ESA
Benjamin Bergougnoux, Thekla Hamm, Lars Jaffke, Paloma T. Lima
2025 J jnl
Oracle Separations for RPH.
CoRR
Thekla Hamm, Lucas Meijer, Tillmann Miltzow, Subhasree Patro
2024 J jnl
Computing crossing numbers with topological and geometric restrictions.
CoRR
Thekla Hamm, Fabian Klute, Irene Parada
2024 J jnl
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
ACM Trans. Algorithms
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2023 A* conf
A Structural Complexity Analysis of Synchronous Dynamical Systems.
AAAI
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
2023 J jnl
A Structural Complexity Analysis of Synchronous Dynamical Systems.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
2023 J jnl
Approximate Evaluation of Quantitative Second Order Queries.
CoRR
Jan Dreier, Robert Ganian, Thekla Hamm
2023 J jnl
Hedonic diversity games: A complexity picture with more than two colors.
Artif. Intell.
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2023 B conf
Maximizing Social Welfare in Score-Based Social Distance Games.
TARK
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023 J jnl
Maximizing Social Welfare in Score-Based Social Distance Games.
CoRR
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023 J jnl
Parameterized complexity of envy-free resource allocation in social networks.
Artif. Intell.
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2023 A conf
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth.
ESA
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
2023 J jnl
Polynomial-time Approximation of Independent Set Parameterized by Treewidth.
CoRR
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
2023 J jnl
The Complexity of Envy-Free Graph Cutting.
CoRR
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2022 A conf
A Unifying Framework for Characterizing and Computing Width Measures.
ITCS
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
2022 J jnl
An efficient algorithm for counting Markov equivalent DAGs.
Artif. Intell.
Robert Ganian, Thekla Hamm, Topi Talvitie
2022 A* conf
Hedonic Diversity Games: A Complexity Picture with More than Two Colors.
AAAI
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2022 J jnl
Hedonic Diversity Games: A Complexity Picture with More than Two Colors.
CoRR
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2022 A* conf
Parameterised Partially-Predrawn Crossing Number.
SoCG
Thekla Hamm, Petr Hlinený
2022 J jnl
Parameterised Partially-Predrawn Crossing Number.
CoRR
Thekla Hamm, Petr Hlinený
2022 A* conf
The Complexity of Envy-Free Graph Cutting.
IJCAI
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2022 A* conf
The Complexity of Temporal Vertex Cover in Small-Degree Graphs.
AAAI
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
2022 J jnl
The Complexity of Temporal Vertex Cover in Small-Degree Graphs.
CoRR
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
2022 A* conf
The Complexity of k-Means Clustering when Little is Known.
ICML
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2022 A* conf
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
ICALP
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2022 J jnl
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
CoRR
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2021 J jnl
A Unifying Framework for Characterizing and Computing Width Measures.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
2021 — conf
Computing Kemeny Rankings from d-Euclidean Preferences.
ADT
Thekla Hamm, Martin Lackner, Anna Rapberger
2021 A* conf
Crossing-Optimal Extension of Simple Drawings.
ICALP
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
2021 J jnl
Measuring what matters: A hybrid approach to dynamic programming with treewidth.
J. Comput. Syst. Sci.
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2021 A* conf
The Complexity of Object Association in Multiple Object Tracking.
AAAI
Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2021 A* conf
The Parameterized Complexity of Connected Fair Division.
IJCAI
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2020 A* conf
An Efficient Algorithm for Counting Markov Equivalent DAGs.
AAAI
Robert Ganian, Thekla Hamm, Topi Talvitie
2020 J jnl
Crossing-Optimal Extension of Simple Drawings.
CoRR
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
2020 B conf
Extending Nearly Complete 1-Planar Drawings in Polynomial Time.
MFCS
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 J jnl
Extending Nearly Complete 1-Planar Drawings in Polynomial Time.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 A* conf
Extending Partial 1-Planar Drawings.
ICALP
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 J jnl
Extending Partial 1-Planar Drawings.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 A* conf
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks.
AAAI
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2020 A* conf
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP.
IJCAI
Jiehua Chen, Robert Ganian, Thekla Hamm
2020 J jnl
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP.
CoRR
Jiehua Chen, Robert Ganian, Thekla Hamm
2020 A* conf
The Complexity Landscape of Resource-Constrained Scheduling.
IJCAI
Robert Ganian, Thekla Hamm, Guillaume Mescoff
2019 B conf
Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time.
IPEC
Thekla Hamm
2019 B conf
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.
MFCS
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2019 J jnl
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon