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 FPTAS for Flows over Time with Aggregate Arc Capacities., и . WAOA, том 6534 из Lecture Notes in Computer Science, стр. 106-117. Springer, (2010)Traffic Networks and Flows over Time., , и . Algorithmics of Large and Complex Networks, том 5515 из Lecture Notes in Computer Science, стр. 166-196. Springer, (2009)Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria., и . ESA, том 1284 из Lecture Notes in Computer Science, стр. 416-429. Springer, (1997)Nash Equilibria and the Price of Anarchy for Flows over Time., и . SAGT, том 5814 из Lecture Notes in Computer Science, стр. 323-334. Springer, (2009)The freeze-tag problem: how to wake up a swarm of robots., , , , и . SODA, стр. 568-577. ACM/SIAM, (2002)Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem.. Math. Oper. Res., 23 (4): 909-929 (1998)Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem.. SODA, стр. 501-508. ACM/SIAM, (1997)Scheduling periodic tasks in a hard real-time environment., , , , , и . Scheduling, том 10071 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method., , и . SODA, стр. 90-102. SIAM, (2022)An Introduction to Network Flows over Time. Research Trends in Combinatorial Optimization, Springer-Verlag, (2009)