From post

Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.

, , и . ISAAC, том 123 из LIPIcs, стр. 64:1-64:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

 

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

Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings., , и . ISAAC, том 123 из LIPIcs, стр. 64:1-64:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity., и . SOFSEM, том 12011 из Lecture Notes in Computer Science, стр. 64-75. Springer, (2020)An Adversarial Model for Scheduling with Testing., , , и . Algorithmica, 82 (12): 3630-3675 (2020)Call Control in Rings., , , и . ICALP, том 2380 из Lecture Notes in Computer Science, стр. 788-799. Springer, (2002)Complexity and online algorithms for minimum skyline coloring of intervals., , , , , и . Theor. Comput. Sci., (2019)Two Moves per Time Step Make a Difference., , , , и . ICALP, том 132 из LIPIcs, стр. 141:1-141:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity., и . CoRR, (2019)Untrusted Predictions Improve Trustable Query Policies., , , , и . CoRR, (2020)Network Analysis, и . Springer-Verlag Berlin/Heidelberg, New York, (2005)Package Delivery Using Drones with Restricted Movement Areas., , и . ISAAC, том 248 из LIPIcs, стр. 49:1-49:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)