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: 5.

Birx, Alexander (2020):
Competitive analysis of the online dial-a-ride problem.
Darmstadt, Technische Universität,
DOI: 10.25534/tuprints-00014134,
[Ph.D. Thesis]

Birx, Alexander and Disser, Y. (2020):
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.
In: SIAM Journal on Discrete Mathematics, 34 (2), pp. 1409-1443. Society for Industrial and Applied Mathematics, ISSN 0895-4801,
DOI: 10.1137/19M1268513,
[Article]

Birx, Alexander and Disser, Yann and Hopp, Alexander V. and Karousatou, Christina (2020):
Improved Lower Bound for Competitive Graph Exploration.
In: Data Structures and Algorithms, (Preprint), arXiv, 2002.10958, [Report]

Birx, Alexander and Disser, Y. and Schewior, Kevin Achlioptas, Dimitris and Végh‬, ‪László (eds.) (2019):
Improved Bounds for Open Online Dial-a-Ride on the Line.
pp. 21:1-21:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM 2019), Cambridge, USA, September 20-22, 2019, ISBN 978-3-95977-125-2,
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2019.21,
[Conference or Workshop Item]

Birx, Alexander and Disser, Y. Niedermeier, Rolf and Paul, Christophe (eds.) (2019):
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.
pp. 15:1-15:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Berlin, Germany, 13.-16.03., ISBN 978-3-95977-100-9,
DOI: 10.4230/LIPIcs.STACS.2019.15,
[Conference or Workshop Item]

This list was generated on Tue Nov 24 01:41:55 2020 CET.