TU Darmstadt / ULB / TUbiblio

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date | Language
Number of items: 3.

Bjelde, Antje ; Hackfeld, Jan ; Disser, Yann ; Hansknecht, Christoph ; Lipmann, Maarten ; Meißner, Julie ; Schlöter, Miriam ; Schewior, Kevin ; Stougie, Leen (2021):
Tight bounds for online TSP on the line.
In: ACM Transactions on Algorithms, 17 (1), ACM, DOI: 10.1145/3422362,
[Article]

Disser, Yann ; Hackfeld, Jan ; Klimm, Max (2019):
Tight bounds for undirected graph exploration with pebbles and multiple agents.
In: Journal of the ACM, 66 (6), ACM, ISSN 0004-5411,
DOI: 10.1145/3356883,
[Article]

Bjelde, Antje ; Disser, Yann ; Hackfeld, Jan ; Hansknecht, Christoph ; Lipmann, Maarten ; Meißner, Julie ; Schewior, Kevin ; Schlöter, Miriam ; Stougie, Leen (2017):
Tight bounds for online TSP on the line.
In: Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 994-1005,
SIAM, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 16.-19.01.2017, ISBN 978-1-61197-478-2,
DOI: 10.1137/1.9781611974782.63,
[Conference or Workshop Item]

This list was generated on Tue Oct 4 01:53:10 2022 CEST.