Author of the publication

Online Load Balancing Made Simple: Greedy Strikes Back.

, , , , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 1108-1122. Springer, (2003)

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

To Weight or Not to Weight: Where is the Question?, , and . ISTCS, page 68-77. IEEE Computer Society, (1996)How to find the best approximation results., and . SIGACT News, 29 (4): 90-97 (1998)Greedily Improving Our Own Closeness Centrality in a Network., , , and . ACM Trans. Knowl. Discov. Data, 11 (1): 9:1-9:32 (2016)Reversible Simulation of Space-Bounded Computations., and . Theor. Comput. Sci., 143 (1): 159-165 (1995)On Computing the Diameter of (Weighted) Link Streams., , and . SEA, volume 190 of LIPIcs, page 11:1-11:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Adapting moodle to better support CS education., , , , , and . ITiCSE-WGR, page 15-27. ACM, (2010)From theory to practice: NP-completeness for every CS student., , and . ITiCSE, page 16-21. ACM, (2013)A Short Guide to Approximation Preserving Reductions.. CCC, page 262-273. IEEE Computer Society, (1997)Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering., , and . FUN, volume 49 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound., , , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 302-313. Springer, (2010)