( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Near-Shortest Path Routing in Hybrid Communication Networks.

, , , , , , , и . OPODIS, том 217 из LIPIcs, стр. 11:1-11:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Rep Martijn

Martijn Kos

Martijn Gipmans

Martijn Rooker

Martijn Griensven

 

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

On the Hardness of Computing an Average Curve., , и . SWAT, том 162 из LIPIcs, стр. 19:1-19:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Minimum Scan Cover and Variants: Theory and Experiments, , , , , , , и . ACM J. Exp. Algorithmics, (2022)Minimum Scan Cover and Variants - Theory and Experiments., , , , , , , и . SEA, том 190 из LIPIcs, стр. 4:1-4:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fast Distributed Algorithms for LP-Type Problems of Low Dimension., , и . DISC, том 146 из LIPIcs, стр. 23:1-23:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Near-Shortest Path Routing in Hybrid Communication Networks., , , , , , , и . OPODIS, том 217 из LIPIcs, стр. 11:1-11:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension., , и . CoRR, (2019)Approximating (k, ℓ)-center clustering for curves., , , , , , и . SODA, стр. 2922-2938. SIAM, (2019)Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension (Brief Announcement)., , и . SPAA, стр. 393-394. ACM, (2019)A Sampling-based Strategy for Distributing Taxis in a Road Network for Occupancy Maximization (GIS Cup)., , , и . SIGSPATIAL/GIS, стр. 616-619. ACM, (2019)