( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight Bounds for Online TSP on the Line.

, , , , , , , , и . ACM Trans. Algorithms, 17 (1): 3:1-3:58 (2021)

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.

Yann Disser

Bernd Disser

Stephan Disser

Georgios Yannis

Christos Yannissis

 

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

Breaking the Size Barrier: Universal Circuits Meet Lookup Tables., , , , , и . ASIACRYPT (1), том 14438 из Lecture Notes in Computer Science, стр. 3-37. Springer, (2023)Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint., , и . WAOA, том 12982 из Lecture Notes in Computer Science, стр. 206-223. Springer, (2021)Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride., , , и . WADS, том 14079 из Lecture Notes in Computer Science, стр. 43-64. Springer, (2023)Scheduling maintenance jobs in networks., , , , , , , и . Theor. Comput. Sci., (2019)Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents., , , , и . SIROCCO, том 11639 из Lecture Notes in Computer Science, стр. 139-153. Springer, (2019)A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules., и . ISAAC, том 283 из LIPIcs, стр. 27:1-27:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Efficient fully dynamic elimination forests with applications to detecting long paths and cycles., , , , , , , , , и 1 other автор(ы). SODA, стр. 796-809. SIAM, (2021)Exploration of Graphs with Excluded Minors., , , и . ESA, том 274 из LIPIcs, стр. 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Incremental Maximization via Continuization., , , и . ICALP, том 261 из LIPIcs, стр. 47:1-47:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Undirected Graph Exploration with ⊝(log log n) Pebbles., , и . SODA, стр. 25-39. SIAM, (2016)