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

A Universal Randomized Packet Scheduling Algorithm.. Algorithmica, 67 (4): 498-515 (2013)Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics., , and . ISAAC, volume 149 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Scheduling multipacket frames with frame deadlines., , and . J. Sched., 20 (6): 623-634 (2017)A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue., , , , , , and . Theor. Comput. Sci., (2013)Tight Bounds for Double Coverage Against Weak Adversaries., , , , and . Theory Comput. Syst., 62 (2): 349-365 (2018)Online Scheduling of Bounded Length Jobs to Maximize Throughput., , and . WAOA, volume 5893 of Lecture Notes in Computer Science, page 116-127. Springer, (2009)Tight Bounds for Double Coverage Against Weak Adversaries., , , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 47-58. Springer, (2015)Online Scheduling of Jobs with Fixed Start Times on Related Machines., , , and . Algorithmica, 74 (1): 156-176 (2016)Randomized Algorithm for Agreeable Deadlines Packet Scheduling.. STACS, volume 5 of LIPIcs, page 489-500. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Better bounds for incremental frequency allocation in bipartite graphs., , and . Theor. Comput. Sci., (2013)