关注
Thekla Hamm
Thekla Hamm
在 ac.tuwien.ac.at 的电子邮件经过验证
标题
引用次数
引用次数
年份
Measuring what matters: A hybrid approach to dynamic programming with treewidth
E Eiben, R Ganian, T Hamm, O Kwon
Journal of Computer and System Sciences 121, 57-75, 2021
302021
Parameterized complexity of envy-free resource allocation in social networks
E Eiben, R Ganian, T Hamm, S Ordyniak
Artificial Intelligence 315, 103826, 2023
192023
Extending partial 1-planar drawings
E Eiben, R Ganian, T Hamm, F Klute, M Nöllenburg
arXiv preprint arXiv:2004.12222, 2020
182020
The complexity of temporal vertex cover in small-degree graphs
T Hamm, N Klobas, GB Mertzios, PG Spirakis
Proceedings of the AAAI Conference on Artificial Intelligence 36 (9), 10193 …, 2022
172022
The Parameterized Complexity of Connected Fair Division.
A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak
IJCAI, 139-145, 2021
172021
A unifying framework for characterizing and computing width measures
E Eiben, R Ganian, T Hamm, L Jaffke, O Kwon
arXiv preprint arXiv:2109.14610, 2021
152021
The fine-grained complexity of graph homomorphism parameterized by clique-width
R Ganian, T Hamm, V Korchemna, K Okrasa, K Simonov
arXiv preprint arXiv:2210.06845, 2022
142022
An efficient algorithm for counting Markov equivalent DAGs
R Ganian, T Hamm, T Talvitie
Artificial Intelligence 304, 103648, 2022
132022
The complexity of envy-free graph cutting
A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak
arXiv preprint arXiv:2312.07043, 2023
102023
Hedonic diversity games: A complexity picture with more than two colors
R Ganian, T Hamm, D Knop, Š Schierreich, O Suchý
Artificial Intelligence 325, 104017, 2023
102023
Crossing-optimal extension of simple drawings
R Ganian, T Hamm, F Klute, I Parada, B Vogtenhuber
arXiv preprint arXiv:2012.07457, 2020
102020
Extending nearly complete 1-planar drawings in polynomial time
E Eiben, R Ganian, T Hamm, F Klute, M Nöllenburg
arXiv preprint arXiv:2007.05346, 2020
102020
Stable matchings with diversity constraints: Affirmative action is beyond NP
J Chen, R Ganian, T Hamm
arXiv preprint arXiv:2001.10087, 2020
102020
The complexity landscape of resource-constrained scheduling
R Ganian, T Hamm, G Mescoff
Proceedings of the Twenty-Ninth International Conference on International …, 2021
92021
Parameterised partially-predrawn crossing number
T Hamm, P Hliněný
arXiv preprint arXiv:2202.13635, 2022
82022
The complexity of k-means clustering when little is known
R Ganian, T Hamm, V Korchemna, K Okrasa, K Simonov
International Conference on Machine Learning, 6960-6987, 2022
62022
The Complexity of Object Association in Multiple Object Tracking
R Ganian, T Hamm, S Ordyniak
Proceedings of the AAAI Conference on Artificial Intelligence 35 (2), 1388-1396, 2021
62021
Computing Kemeny Rankings from d-Euclidean Preferences
T Hamm, M Lackner, A Rapberger
Algorithmic Decision Theory: 7th International Conference, ADT 2021 …, 2021
32021
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
R Ganian, T Hamm, V Korchemna, K Okrasa, K Simonov
ACM Transactions on Algorithms 20 (3), 1-26, 2024
22024
Maximizing social welfare in score-based social distance games
R Ganian, T Hamm, D Knop, S Roy, Š Schierreich, O Suchý
arXiv preprint arXiv:2312.07632, 2023
22023
系统目前无法执行此操作,请稍后再试。
文章 1–20