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

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)A general lower bound for collaborative tree exploration., , , , and . Theor. Comput. Sci., (2020)Travelling on Graphs with Small Highway Dimension., , , and . Algorithmica, 83 (5): 1352-1370 (2021)An Exponential Lower Bound for Zadeh's pivot rule., , and . CoRR, (2019)Tight Bounds for Online TSP on the Line., , , , , , , , and . ACM Trans. Algorithms, 17 (1): 3:1-3:58 (2021)The Minimum Feasible Tileset Problem., , and . Algorithmica, 81 (3): 1126-1151 (2019)Degree-Constrained Orientations of Embedded Graphs., and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 506-516. Springer, (2012)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)Recoloring Interval Graphs with Limited Recourse Budget., , , , and . SWAT, volume 162 of LIPIcs, page 17:1-17:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Unified greedy approximability beyond submodular maximization., and . CoRR, (2020)