Author of the publication

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Canadian Traveller Problem., and . SODA, page 261-270. ACM/SIAM, (1991)Approximate distributed Bellman-Ford algorithms., , and . IEEE Trans. Commun., 42 (8): 2515-2517 (1994)Improved Routing Strategies with Succinct Tables., , , and . J. Algorithms, 11 (3): 307-341 (1990)Minimum Color Sum of Bipartite Graphs., and . J. Algorithms, 28 (2): 339-365 (1998)A unified approach to approximating resource allocation and scheduling, , , , and . J. ACM, 48 (5): 1069--1090 (September 2001)Set It and Forget It: Approximating the Set Once Strip Cover Problem., , and . Algorithmica, 79 (2): 368-386 (2017)אלגוריתמים במערכת מבוזרת לא אמינה (Algorithms in an unreliable distributed system.).. Hebrew University of Jerusalem, Israel, (1987)Minimum Neighboring Degree Realization in Graphs and Trees., , , , and . ESA, volume 173 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Graph Realization of Distance Sets., , , and . MFCS, volume 241 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Minimum-Cost Broadcast through Varying-Size Neighborcast., , , and . ALGOSENSORS, volume 7111 of Lecture Notes in Computer Science, page 173-187. Springer, (2011)