From post

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.

 

Другие публикации лиц с тем же именем

An improved lower bound for competitive graph exploration., , , и . Theor. Comput. Sci., (2021)Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line., и . STACS, том 126 из LIPIcs, стр. 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Improved Bounds for Open Online Dial-a-Ride on the Line., , и . APPROX-RANDOM, том 145 из LIPIcs, стр. 21:1-21:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)