Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition., , and . Ann. Oper. Res., 322 (1): 467-496 (March 2023)Exploration of Graphs with Excluded Minors., , , and . ESA, volume 274 of LIPIcs, page 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Incremental Maximization via Continuization., , , and . ICALP, volume 261 of LIPIcs, page 47:1-47:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Undirected Graph Exploration with ⊝(log log n) Pebbles., , and . SODA, page 25-39. SIAM, (2016)The Minimum Feasible Tileset Problem., , and . Algorithmica, 81 (3): 1126-1151 (2019)Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line., and . STACS, volume 126 of LIPIcs, page 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Degree-Constrained Orientations of Embedded Graphs., and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 506-516. Springer, (2012)Tight Bounds for Online TSP on the Line., , , , , , , , and . ACM Trans. Algorithms, 17 (1): 3:1-3:58 (2021)Improved Bounds for Open Online Dial-a-Ride on the Line., , and . APPROX-RANDOM, volume 145 of LIPIcs, page 21:1-21:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An improved lower bound for competitive graph exploration., , , and . Theor. Comput. Sci., (2021)