Thekla Hamm

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

Email: thamm@ac.tuwien.ac.at
Web: http://www.ac.tuwien.ac.at/people/thamm/

Publications

26 results
2023
[26]Hedonic Diversity Games: A Complexity Picture with More than Two Colors
, , , ,
Artificial Intelligence, 2023.
Note: to appear
[bibtex]
[25]Parameterized complexity of envy-free resource allocation in social networks
, , ,
Artif. Intell., volume 315, pages 103826, 2023.
[bibtex] [pdf] [doi]
[24]Maximizing Social Welfare in Score-Based Social Distance Games
, , , , ,
Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023 (Rineke Verbrugge, ed.), volume 379 of EPTCS, pages 272–286, 2023.
[bibtex] [pdf] [doi]
[23]A Structural Complexity Analysis of Synchronous Dynamical Systems
, , ,
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6313–6321, 2023, AAAI Press.
[bibtex] [pdf]
[22]Approximate Evaluation of Quantitative Second Order Queries
, ,
2023, arXiv.
[bibtex] [pdf]
2022
[21]An efficient algorithm for counting Markov equivalent DAGs
, ,
Artificial Intelligence, volume 304, pages 103648, 2022.
[bibtex] [pdf] [doi]
[20]The Complexity of Temporal Vertex Cover in Small-Degree Graphs
, , ,
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 10193–10201, 2022, AAAI Press.
[bibtex] [pdf]
[19]Parameterised Partially-Predrawn Crossing Number
,
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 46:1–46:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[18]Hedonic Diversity Games: A Complexity Picture with More than Two Colors
, , , ,
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 5034–5042, 2022, AAAI Press.
[bibtex] [pdf]
[17]The Complexity of k-Means Clustering when Little is Known
, , , ,
International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, Sivan Sabato, eds.), volume 162 of Proceedings of Machine Learning Research, pages 6960–6987, 2022, PMLR.
[bibtex] [pdf]
[16]The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
, , , ,
49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, eds.), volume 229 of LIPIcs, pages 66:1–66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[15]A Unifying Framework for Characterizing and Computing Width Measures
, , , ,
13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[14]The Complexity of Envy-Free Graph Cutting
, , , ,
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 237–243, 2022, ijcai.org.
[bibtex] [pdf] [doi]
2021
[13]Measuring what matters: A hybrid approach to dynamic programming with treewidth
, , ,
J. Comput. Syst. Sci., volume 121, pages 57–75, 2021.
[bibtex] [pdf]
[12]Computing Kemeny Rankings from d-Euclidean Preferences
, ,
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]
[11]The Complexity of Object Association in Multiple Object Tracking
, ,
Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388–1396, 2021, AAAI Press.
[bibtex] [pdf]
[10]Crossing-Optimal Extension of Simple Drawings
, , , ,
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]
[9]The Parameterized Complexity of Connected Fair Division
, , , ,
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
[8]An Efficient Algorithm for Counting Markov Equivalent DAGs
, ,
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]
[7]The Complexity Landscape of Resource-Constrained Scheduling
, ,
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 1741–1747, 2020, ijcai.org.
[bibtex] [pdf]
[6]Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
, , ,
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]
[5]Extending Nearly Complete 1-Planar Drawings in Polynomial Time
, , , ,
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]
[4]Extending Partial 1-Planar Drawings
, , , ,
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]
[3]Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
, ,
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
[2]Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time

14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany (Bart M. P. Jansen, Jan Arne Telle, eds.), volume 148 of LIPIcs, pages 20:1–20:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1]Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
, , ,
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]