( 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

 

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

Undirected Graph Exploration with ⊝(log log n) Pebbles., , и . SODA, стр. 25-39. SIAM, (2016)Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition., , и . Ann. Oper. Res., 322 (1): 467-496 (марта 2023)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)A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP., , , и . ESA, том 308 из LIPIcs, стр. 15:1-15:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Hiring Secretaries over Time: The Benefit of Concurrent Employment., , , , , , , и . Math. Oper. Res., 45 (1): 323-352 (2020)Travelling on Graphs with Small Highway Dimension., , , и . WG, том 11789 из Lecture Notes in Computer Science, стр. 175-189. Springer, (2019)Unified Greedy Approximability Beyond Submodular Maximization., и . ISCO, том 13526 из Lecture Notes in Computer Science, стр. 299-311. Springer, (2022)An Improved Algorithm for Open Online Dial-a-Ride., , , и . WAOA, том 13538 из Lecture Notes in Computer Science, стр. 154-171. Springer, (2022)An improved lower bound for competitive graph exploration., , , и . Theor. Comput. Sci., (2021)