Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Thekla Hamm
@article{DBLP:journals/ai/EibenGHO23,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Sebastian Ordyniak},
title = {Parameterized complexity of envy-free resource allocation in social
networks},
journal = {Artif. Intell.},
volume = {315},
pages = {103826},
year = {2023},
url = {https://doi.org/10.1016/j.artint.2022.103826},
doi = {10.1016/J.ARTINT.2022.103826},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/EibenGHO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/GanianHKSS23,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Hedonic diversity games: {A} complexity picture with more than two
colors},
journal = {Artif. Intell.},
volume = {325},
pages = {104017},
year = {2023},
url = {https://doi.org/10.1016/j.artint.2023.104017},
doi = {10.1016/J.ARTINT.2023.104017},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/GanianHKSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/EibenGHK23,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Viktoriia Korchemna},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {A Structural Complexity Analysis of Synchronous Dynamical Systems},
booktitle = {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},
pages = {6313--6321},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i5.25777},
doi = {10.1609/AAAI.V37I5.25777},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/EibenGHK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChalermsookFHKN23,
author = {Parinya Chalermsook and
Fedor V. Fomin and
Thekla Hamm and
Tuukka Korhonen and
Jesper Nederlof and
Ly Orgo},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Polynomial-Time Approximation of Independent Set Parameterized by
Treewidth},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {33:1--33:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.33},
doi = {10.4230/LIPICS.ESA.2023.33},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/ChalermsookFHKN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-2307-05061,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Sanjukta Roy and
Simon Schierreich and
Ondrej Such{\'{y}}},
editor = {Rineke Verbrugge},
title = {Maximizing Social Welfare in Score-Based Social Distance Games},
booktitle = {Proceedings Nineteenth conference on Theoretical Aspects of Rationality
and Knowledge, {TARK} 2023, Oxford, United Kingdom, 28-30th June 2023},
series = {{EPTCS}},
volume = {379},
pages = {272--286},
year = {2023},
url = {https://doi.org/10.4204/EPTCS.379.22},
doi = {10.4204/EPTCS.379.22},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-05061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-02056,
author = {Jan Dreier and
Robert Ganian and
Thekla Hamm},
title = {Approximate Evaluation of Quantitative Second Order Queries},
journal = {CoRR},
volume = {abs/2305.02056},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.02056},
doi = {10.48550/ARXIV.2305.02056},
eprinttype = {arXiv},
eprint = {2305.02056},
timestamp = {Fri, 05 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-02056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-01341,
author = {Parinya Chalermsook and
Fedor V. Fomin and
Thekla Hamm and
Tuukka Korhonen and
Jesper Nederlof and
Ly Orgo},
title = {Polynomial-time Approximation of Independent Set Parameterized by
Treewidth},
journal = {CoRR},
volume = {abs/2307.01341},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.01341},
doi = {10.48550/ARXIV.2307.01341},
eprinttype = {arXiv},
eprint = {2307.01341},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-01341.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07043,
author = {Argyrios Deligkas and
Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Sebastian Ordyniak},
title = {The Complexity of Envy-Free Graph Cutting},
journal = {CoRR},
volume = {abs/2312.07043},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07043},
doi = {10.48550/ARXIV.2312.07043},
eprinttype = {arXiv},
eprint = {2312.07043},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07632,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Sanjukta Roy and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Maximizing Social Welfare in Score-Based Social Distance Games},
journal = {CoRR},
volume = {abs/2312.07632},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07632},
doi = {10.48550/ARXIV.2312.07632},
eprinttype = {arXiv},
eprint = {2312.07632},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07632.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-08385,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Viktoriia Korchemna},
title = {A Structural Complexity Analysis of Synchronous Dynamical Systems},
journal = {CoRR},
volume = {abs/2312.08385},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.08385},
doi = {10.48550/ARXIV.2312.08385},
eprinttype = {arXiv},
eprint = {2312.08385},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-08385.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/GanianHT22,
author = {Robert Ganian and
Thekla Hamm and
Topi Talvitie},
title = {An efficient algorithm for counting Markov equivalent DAGs},
journal = {Artif. Intell.},
volume = {304},
pages = {103648},
year = {2022},
url = {https://doi.org/10.1016/j.artint.2021.103648},
doi = {10.1016/J.ARTINT.2021.103648},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/GanianHT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GanianHKSS22,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Hedonic Diversity Games: {A} Complexity Picture with More than Two
Colors},
booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI}
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22
- March 1, 2022},
pages = {5034--5042},
publisher = {{AAAI} Press},
year = {2022},
url = {https://doi.org/10.1609/aaai.v36i5.20435},
doi = {10.1609/AAAI.V36I5.20435},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/GanianHKSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HammKMS22,
author = {Thekla Hamm and
Nina Klobas and
George B. Mertzios and
Paul G. Spirakis},
title = {The Complexity of Temporal Vertex Cover in Small-Degree Graphs},
booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI}
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22
- March 1, 2022},
pages = {10193--10201},
publisher = {{AAAI} Press},
year = {2022},
url = {https://doi.org/10.1609/aaai.v36i9.21259},
doi = {10.1609/AAAI.V36I9.21259},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HammKMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/HammH22,
author = {Thekla Hamm and
Petr Hlinen{\'{y}}},
editor = {Xavier Goaoc and
Michael Kerber},
title = {Parameterised Partially-Predrawn Crossing Number},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {46:1--46:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.46},
doi = {10.4230/LIPICS.SOCG.2022.46},
timestamp = {Wed, 01 Jun 2022 16:45:26 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/HammH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GanianHKOS22,
author = {Robert Ganian and
Thekla Hamm and
Viktoriia Korchemna and
Karolina Okrasa and
Kirill Simonov},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {The Fine-Grained Complexity of Graph Homomorphism Parameterized by
Clique-Width},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {66:1--66:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.66},
doi = {10.4230/LIPICS.ICALP.2022.66},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GanianHKOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/GanianHKOS22,
author = {Robert Ganian and
Thekla Hamm and
Viktoriia Korchemna and
Karolina Okrasa and
Kirill Simonov},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {The Complexity of k-Means Clustering when Little is Known},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {6960--6987},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/ganian22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:52 +0200},
biburl = {https://dblp.org/rec/conf/icml/GanianHKOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/DeligkasEGHO22,
author = {Argyrios Deligkas and
Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Sebastian Ordyniak},
editor = {Luc De Raedt},
title = {The Complexity of Envy-Free Graph Cutting},
booktitle = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July
2022},
pages = {237--243},
publisher = {ijcai.org},
year = {2022},
url = {https://doi.org/10.24963/ijcai.2022/34},
doi = {10.24963/IJCAI.2022/34},
timestamp = {Wed, 27 Jul 2022 16:43:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/DeligkasEGHO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/EibenGHJK22,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Lars Jaffke and
O{-}joung Kwon},
editor = {Mark Braverman},
title = {A Unifying Framework for Characterizing and Computing Width Measures},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {63:1--63:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.63},
doi = {10.4230/LIPICS.ITCS.2022.63},
timestamp = {Wed, 26 Jan 2022 14:33:51 +0100},
biburl = {https://dblp.org/rec/conf/innovations/EibenGHJK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-09210,
author = {Robert Ganian and
Thekla Hamm and
Dusan Knop and
Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Hedonic Diversity Games: {A} Complexity Picture with More than Two
Colors},
journal = {CoRR},
volume = {abs/2202.09210},
year = {2022},
url = {https://arxiv.org/abs/2202.09210},
eprinttype = {arXiv},
eprint = {2202.09210},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-09210.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-13635,
author = {Thekla Hamm and
Petr Hlinen{\'{y}}},
title = {Parameterised Partially-Predrawn Crossing Number},
journal = {CoRR},
volume = {abs/2202.13635},
year = {2022},
url = {https://arxiv.org/abs/2202.13635},
eprinttype = {arXiv},
eprint = {2202.13635},
timestamp = {Thu, 03 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-13635.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-04832,
author = {Thekla Hamm and
Nina Klobas and
George B. Mertzios and
Paul G. Spirakis},
title = {The Complexity of Temporal Vertex Cover in Small-Degree Graphs},
journal = {CoRR},
volume = {abs/2204.04832},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.04832},
doi = {10.48550/ARXIV.2204.04832},
eprinttype = {arXiv},
eprint = {2204.04832},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-04832.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-06845,
author = {Robert Ganian and
Thekla Hamm and
Viktoriia Korchemna and
Karolina Okrasa and
Kirill Simonov},
title = {The Fine-Grained Complexity of Graph Homomorphism Parameterized by
Clique-Width},
journal = {CoRR},
volume = {abs/2210.06845},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.06845},
doi = {10.48550/ARXIV.2210.06845},
eprinttype = {arXiv},
eprint = {2210.06845},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-06845.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EibenGHK21,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
O{-}joung Kwon},
title = {Measuring what matters: {A} hybrid approach to dynamic programming
with treewidth},
journal = {J. Comput. Syst. Sci.},
volume = {121},
pages = {57--75},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2021.04.005},
doi = {10.1016/J.JCSS.2021.04.005},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/EibenGHK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GanianHO21,
author = {Robert Ganian and
Thekla Hamm and
Sebastian Ordyniak},
title = {The Complexity of Object Association in Multiple Object Tracking},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {1388--1396},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i2.16228},
doi = {10.1609/AAAI.V35I2.16228},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/GanianHO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/HammLR21,
author = {Thekla Hamm and
Martin Lackner and
Anna Rapberger},
editor = {Dimitris Fotakis and
David R{\'{\i}}os Insua},
title = {Computing Kemeny Rankings from d-Euclidean Preferences},
booktitle = {Algorithmic Decision Theory - 7th International Conference, {ADT}
2021, Toulouse, France, November 3-5, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13023},
pages = {147--161},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-87756-9\_10},
doi = {10.1007/978-3-030-87756-9\_10},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aldt/HammLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GanianHKPV21,
author = {Robert Ganian and
Thekla Hamm and
Fabian Klute and
Irene Parada and
Birgit Vogtenhuber},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Crossing-Optimal Extension of Simple Drawings},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {72:1--72:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.72},
doi = {10.4230/LIPICS.ICALP.2021.72},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GanianHKPV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/DeligkasEGHO21,
author = {Argyrios Deligkas and
Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Sebastian Ordyniak},
editor = {Zhi{-}Hua Zhou},
title = {The Parameterized Complexity of Connected Fair Division},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {139--145},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/20},
doi = {10.24963/IJCAI.2021/20},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/DeligkasEGHO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-14610,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Lars Jaffke and
O{-}joung Kwon},
title = {A Unifying Framework for Characterizing and Computing Width Measures},
journal = {CoRR},
volume = {abs/2109.14610},
year = {2021},
url = {https://arxiv.org/abs/2109.14610},
eprinttype = {arXiv},
eprint = {2109.14610},
timestamp = {Mon, 04 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-14610.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/EibenGHO20,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Sebastian Ordyniak},
title = {Parameterized Complexity of Envy-Free Resource Allocation in Social
Networks},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
February 7-12, 2020},
pages = {7135--7142},
publisher = {{AAAI} Press},
year = {2020},
url = {https://doi.org/10.1609/aaai.v34i05.6201},
doi = {10.1609/AAAI.V34I05.6201},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/EibenGHO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GanianHT20,
author = {Robert Ganian and
Thekla Hamm and
Topi Talvitie},
title = {An Efficient Algorithm for Counting Markov Equivalent DAGs},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
February 7-12, 2020},
pages = {10136--10143},
publisher = {{AAAI} Press},
year = {2020},
url = {https://ojs.aaai.org/index.php/AAAI/article/view/6573},
timestamp = {Mon, 07 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaai/GanianHT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EibenGHKN20,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Fabian Klute and
Martin N{\"{o}}llenburg},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Extending Partial 1-Planar Drawings},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {43:1--43:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.43},
doi = {10.4230/LIPICS.ICALP.2020.43},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EibenGHKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/ChenGH20,
author = {Jiehua Chen and
Robert Ganian and
Thekla Hamm},
editor = {Christian Bessiere},
title = {Stable Matchings with Diversity Constraints: Affirmative Action is
beyond {NP}},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {146--152},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/21},
doi = {10.24963/IJCAI.2020/21},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/ChenGH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/GanianHM20,
author = {Robert Ganian and
Thekla Hamm and
Guillaume Mescoff},
editor = {Christian Bessiere},
title = {The Complexity Landscape of Resource-Constrained Scheduling},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {1741--1747},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/241},
doi = {10.24963/IJCAI.2020/241},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/GanianHM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EibenGHKN20,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Fabian Klute and
Martin N{\"{o}}llenburg},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Extending Nearly Complete 1-Planar Drawings in Polynomial Time},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {31:1--31:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.31},
doi = {10.4230/LIPICS.MFCS.2020.31},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EibenGHKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-10087,
author = {Jiehua Chen and
Robert Ganian and
Thekla Hamm},
title = {Stable Matchings with Diversity Constraints: Affirmative Action is
beyond {NP}},
journal = {CoRR},
volume = {abs/2001.10087},
year = {2020},
url = {https://arxiv.org/abs/2001.10087},
eprinttype = {arXiv},
eprint = {2001.10087},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-10087.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-12222,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Fabian Klute and
Martin N{\"{o}}llenburg},
title = {Extending Partial 1-Planar Drawings},
journal = {CoRR},
volume = {abs/2004.12222},
year = {2020},
url = {https://arxiv.org/abs/2004.12222},
eprinttype = {arXiv},
eprint = {2004.12222},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-12222.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-05346,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
Fabian Klute and
Martin N{\"{o}}llenburg},
title = {Extending Nearly Complete 1-Planar Drawings in Polynomial Time},
journal = {CoRR},
volume = {abs/2007.05346},
year = {2020},
url = {https://arxiv.org/abs/2007.05346},
eprinttype = {arXiv},
eprint = {2007.05346},
timestamp = {Mon, 20 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-05346.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-07457,
author = {Robert Ganian and
Thekla Hamm and
Fabian Klute and
Irene Parada and
Birgit Vogtenhuber},
title = {Crossing-Optimal Extension of Simple Drawings},
journal = {CoRR},
volume = {abs/2012.07457},
year = {2020},
url = {https://arxiv.org/abs/2012.07457},
eprinttype = {arXiv},
eprint = {2012.07457},
timestamp = {Sat, 02 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-07457.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Hamm19,
author = {Thekla Hamm},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in
Linear Time},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.20},
doi = {10.4230/LIPICS.IPEC.2019.20},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Hamm19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EibenGHK19,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
O{-}joung Kwon},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Measuring what Matters: {A} Hybrid Approach to Dynamic Programming
with Treewidth},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {42:1--42:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.42},
doi = {10.4230/LIPICS.MFCS.2019.42},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EibenGHK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-10132,
author = {Eduard Eiben and
Robert Ganian and
Thekla Hamm and
O{-}joung Kwon},
title = {Measuring what Matters: {A} Hybrid Approach to Dynamic Programming
with Treewidth},
journal = {CoRR},
volume = {abs/1908.10132},
year = {2019},
url = {http://arxiv.org/abs/1908.10132},
eprinttype = {arXiv},
eprint = {1908.10132},
timestamp = {Thu, 29 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-10132.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-02-06 23:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
