Disser, Yann ; Feldmann, Andreas Emil ; Klimm, Max ; Könemann, Jochen (2021)
Travelling on Graphs with Small Highway Dimension.
In: Algorithmica, 83 (5)
doi: 10.1007/s00453-020-00785-5
Artikel, Bibliographie

Chen, Jiehua ; Czerwinski, Wojciech ; Disser, Yann ; Feldmann, Andreas Emil ; Hermelin, Danny ; Nadara, Wojciech ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Sorge, Manuel ; Wroblewski, Bartlomiej ; Zych-Pawlewicz, Anna (2021)
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.
32nd Annual ACM-SIAM Symposium on Discrete Algorithms. virtual Conference (10.-13.01.2021)
doi: 10.1137/1.9781611976465.50
Konferenzveröffentlichung, Bibliographie

Bosek, Bartlomiej ; Disser, Yann ; Feldmann, Andreas Emil ; Pawlewicz, Jakub ; Zych-Pawlewicz, Anna (2020)
Recoloring Interval Graphs with Limited Recourse Budget.
17th Scandinavian Symposium and Workshops on Algorithm Theory. Torshavn, Faroe Islands (22.-24.06.2020)
doi: 10.4230/LIPIcs.SWAT.2020.17
Konferenzveröffentlichung, Bibliographie

Disser, Yann ; Feldmann, Andreas Emil ; Klimm, Max ; Koenemann, Jochen (2019)
Travelling on Graphs with Small Highway Dimension.
45th International Workshop on Graph-Theoretic Concepts in Computer Science. Vall de Nuria, Spain (19.-21.06.2019)
doi: 10.1007/978-3-030-30786-8_14
Konferenzveröffentlichung, Bibliographie