Thekla Hamm

Orcid: 0000-0002-4595-9982

Affiliations:
  • TU Wien, Austria


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
ACM Trans. Algorithms, July, 2024

2023
Hedonic diversity games: A complexity picture with more than two colors.
Artif. Intell., December, 2023

Maximizing Social Welfare in Score-Based Social Distance Games.
Proceedings of the Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, 2023

Approximate Evaluation of Quantitative Second Order Queries.
CoRR, 2023

Parameterized complexity of envy-free resource allocation in social networks.
Artif. Intell., 2023

Polynomial-Time Approximation of Independent Set Parameterized by Treewidth.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Structural Complexity Analysis of Synchronous Dynamical Systems.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
An efficient algorithm for counting Markov equivalent DAGs.
Artif. Intell., 2022

A Unifying Framework for Characterizing and Computing Width Measures.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

The Complexity of Envy-Free Graph Cutting.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

The Complexity of k-Means Clustering when Little is Known.
Proceedings of the International Conference on Machine Learning, 2022

Parameterised Partially-Predrawn Crossing Number.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

The Complexity of Temporal Vertex Cover in Small-Degree Graphs.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Measuring what matters: A hybrid approach to dynamic programming with treewidth.
J. Comput. Syst. Sci., 2021

The Parameterized Complexity of Connected Fair Division.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Crossing-Optimal Extension of Simple Drawings.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Computing Kemeny Rankings from d-Euclidean Preferences.
Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

The Complexity of Object Association in Multiple Object Tracking.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Extending Nearly Complete 1-Planar Drawings in Polynomial Time.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

The Complexity Landscape of Resource-Constrained Scheduling.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Extending Partial 1-Planar Drawings.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019


  Loading...