Thekla Hamm

According to our database, Thekla Hamm authored at least 23 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

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, July, 2024

2023

Hedonic diversity games: A complexity picture with more than two colors.

Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý

Artif. Intell., December, 2023

Maximizing Social Welfare in Score-Based Social Distance Games.

Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý

Proceedings of the Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, 2023

Approximate Evaluation of Quantitative Second Order Queries.

Jan Dreier, Robert Ganian, Thekla Hamm

CoRR, 2023

Parameterized complexity of envy-free resource allocation in social networks.

Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

Artif. Intell., 2023

Polynomial-Time Approximation of Independent Set Parameterized by Treewidth.

Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Structural Complexity Analysis of Synchronous Dynamical Systems.

Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

An efficient algorithm for counting Markov equivalent DAGs.

Robert Ganian, Thekla Hamm, Topi Talvitie

Artif. Intell., 2022

A Unifying Framework for Characterizing and Computing Width Measures.

Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

The Complexity of Envy-Free Graph Cutting.

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

The Complexity of k-Means Clustering when Little is Known.

Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov

Proceedings of the International Conference on Machine Learning, 2022

Parameterised Partially-Predrawn Crossing Number.

Thekla Hamm, Petr Hlinený

Proceedings of the 38th International Symposium on Computational Geometry, 2022

The Complexity of Temporal Vertex Cover in Small-Degree Graphs.

Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

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 Parameterized Complexity of Connected Fair Division.

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Crossing-Optimal Extension of Simple Drawings.

Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Computing Kemeny Rankings from d-Euclidean Preferences.

Thekla Hamm, Martin Lackner, Anna Rapberger

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

The Complexity of Object Association in Multiple Object Tracking.

Robert Ganian, Thekla Hamm, Sebastian Ordyniak

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Extending Nearly Complete 1-Planar Drawings in Polynomial Time.

Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

The Complexity Landscape of Resource-Constrained Scheduling.

Robert Ganian, Thekla Hamm, Guillaume Mescoff

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP.

Jiehua Chen, Robert Ganian, Thekla Hamm

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Extending Partial 1-Planar Drawings.

Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time.

Thekla Hamm

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019