Full name Familienname, Vorname
Hamm, Thekla
 
Main Affiliation Organisations­zuordnung
 

Results 1-12 of 12 (Search time: 0.001 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Ganian, Robert ; Hamm, Thekla ; Knop, Dusan ; Roy, Sanjukta ; Schierreich, Šimon ; Suchý, Ondřej Maximizing Social Welfare in Score-Based Social Distance GamesInproceedings Konferenzbeitrag 11-Jul-2023
2Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Ordyniak, Sebastian Parameterized complexity of envy-free resource allocation in social networksArticle Artikel Feb-2023
3Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Korchemna, Viktoriia A Structural Complexity Analysis of Synchronous Dynamical SystemsInproceedings Konferenzbeitrag 2023
4Ganian-2022-The Fine-Grained Complexity of Graph Homomorphism Parameteriz...-vor.pdf.jpgGanian, Robert ; Hamm, Thekla ; Korchemna, Viktoriia ; Okrasa, Karolina ; Simonov, Kirill The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-WidthInproceedings Konferenzbeitrag 1-Jul-2022
5Ganian-2022-Hedonic Diversity Games A Complexity Picture with More than T...-vor.pdf.jpgGanian, Robert ; Hamm, Thekla ; Knop, Dušan ; Schierreich, Šimon ; Suchý, Ondřej Hedonic Diversity Games: A Complexity Picture with More than Two ColorsInproceedings Konferenzbeitrag 30-Jun-2022
6Hamm-2022-The Complexity of Temporal Vertex Cover in Small-Degree Graphs-vor.pdf.jpgHamm, Thekla ; Klobas, Nina ; Mertzios, George ; Spirakis, Paul G. The Complexity of Temporal Vertex Cover in Small-Degree GraphsInproceedings Konferenzbeitrag 28-Jun-2022
7Hamm-2022-Parameterised Partially-Predrawn Crossing Number-vor.pdf.jpgHamm, Thekla ; Hliněný, Petr Parameterised Partially-Predrawn Crossing NumberInproceedings Konferenzbeitrag 1-Jun-2022
8Ganian, Robert ; Hamm, Thekla ; Talvitie, Topi An efficient algorithm for counting Markov equivalent DAGsArticle Artikel Mar-2022
9Eiben-2022-A Unifying Framework for Characterizing and Computing Width Me...-vor.pdf.jpgEiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Jaffke, Lars ; Kwon, O-Joung A Unifying Framework for Characterizing and Computing Width MeasuresInproceedings Konferenzbeitrag Jan-2022
10Ganian-2022-The Complexity of k-Means Clustering when Little is Known-vor.pdf.jpgGanian, Robert ; Hamm, Thekla ; Korchemna, Viktoriia ; Okrasa, Karolina ; Simonov, Kirill The Complexity of k-Means Clustering when Little is KnownInproceedings Konferenzbeitrag 2022
11Deligkas-2022-The Complexity of Envy-Free Graph Cutting-vor.pdf.jpgDeligkas, Argyrios ; Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Ordyniak, Sebastian The Complexity of Envy-Free Graph CuttingInproceedings Konferenzbeitrag 2022
12Hamm Thekla - 2022 - Algorithmic Advances via Graph Decomposition.pdf.jpgHamm, Thekla Algorithmic advances via graph decompositionThesis Hochschulschrift 2022