Thekla Hamm

Address:
Thekla Hamm
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room:	HA0402
Phone:	+43(1)58801–192121
Email:	thamm@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/thamm/

Publications

20 results

2022
[20]	An Efficient Algorithm for Counting Markov Equivalent DAGs Robert Ganian, Thekla Hamm, Topi Talvitie Artificial Intelligence, 2022. [bibtex]
[19]	The Complexity of Temporal Vertex Cover in Small-Degree Graphs Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis Proceeding of AAAI-22, the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022, AAAI Press. Note: to appear [bibtex]
[18]	Parameterised Partially-Predrawn Crossing Number Thekla Hamm, Petr Hlinený 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[17]	Hedonic Diversity Games: A Complexity Picture with More than Two Colors Robert Ganian, Thekla Hamm, Dušan Knop, Šimon Schierreich, Ondrej Suchý Proceeding of AAAI-22, the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022, AAAI Press. Note: to appear [bibtex]
[16]	The Complexity of k-Means Clustering when Little is Known Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov 39th Thirty-ninth International Conference on Machine Learning (ICML 2022), 2022. Note: to appear [bibtex]
[15]	The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France, 2022. Note: to appear [bibtex]
[14]	A Unifying Framework for Characterizing and Computing Width Measures Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[13]	The Complexity of Envy-Free Graph Cutting Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastiak Ordyniak Proceeding of IJCAI-22, the 31st International Joint Conference on Artificial Intelligence, 2022. Note: to appear [bibtex]
2021
[12]	Measuring what matters: A hybrid approach to dynamic programming with treewidth Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon J. Comput. Syst. Sci., volume 121, pages 57–75, 2021. [bibtex] [pdf]
[11]	Computing Kemeny Rankings from d-Euclidean Preferences Thekla Hamm, Martin Lackner, Anna Rapberger Algorithmic Decision Theory - 7th International Conference, ADT 2021, Toulouse, France, November 3-5, 2021, Proceedings, volume 13023 of Lecture Notes in Computer Science, pages 147–161, 2021, Springer Verlag. [bibtex]
[10]	The Complexity of Object Association in Multiple Object Tracking Robert Ganian, Thekla Hamm, Sebastian Ordyniak Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388–1396, 2021, AAAI Press. [bibtex] [pdf]
[9]	Crossing-Optimal Extension of Simple Drawings Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal, Emanuela Merelli, James Worrell, eds.), volume 198 of LIPIcs, pages 72:1–72:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[8]	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, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou, ed.), pages 139–145, 2021, ijcai.org. [bibtex] [pdf]
2020
[7]	An Efficient Algorithm for Counting Markov Equivalent DAGs Robert Ganian, Thekla Hamm, Topi Talvitie The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136–10143, 2020, AAAI Press. [bibtex] [pdf]
[6]	The Complexity Landscape of Resource-Constrained Scheduling Robert Ganian, Thekla Hamm, Guillaume Mescoff Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 1741–1747, 2020, ijcai.org. [bibtex] [pdf]
[5]	Parameterized Complexity of Envy-Free Resource Allocation in Social Networks Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 7135–7142, 2020, AAAI Press. [bibtex] [pdf]
[4]	Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[3]	Extending Partial 1-Planar Drawings Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[2]	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, IJCAI 2020 (Christian Bessiere, ed.), pages 146–152, 2020, ijcai.org. [bibtex] [pdf]
2019
[1]	Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen, eds.), pages 42:1–42:15, 2019. [bibtex] [pdf]