Author of the publication

Robust Algorithms for Preemptive Scheduling.

, and . ESA, volume 6942 of Lecture Notes in Computer Science, page 567-578. Springer, (2011)

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

Improved randomized results for the interval selection problem., and . Theor. Comput. Sci., 411 (34-36): 3129-3135 (2010)Flow trees for vertex-capacitated networks., and . Discret. Appl. Math., 155 (4): 572-578 (2007)On nonlinear multi-covering problems., , , and . J. Comb. Optim., 33 (2): 645-659 (2017)Minimization of SONET ADMs in ring networks revisited., , and . Computing, 87 (1-2): 3-19 (2010)Nonoblivious 2-Opt heuristics for the traveling salesman problem., and . Networks, 62 (3): 201-219 (2013)Synthesis of 2-Commodity Flow Networks., and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 226-235. Springer, (2001)A Robust APTAS for the Classical Bin Packing Problem., and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 214-225. Springer, (2006)A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs., , and . ICALP, volume 107 of LIPIcs, page 85:1-85:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Online Bounded Analysis., , , , and . CSR, volume 9691 of Lecture Notes in Computer Science, page 131-145. Springer, (2016)Approximation Algorithms for Quickest Spanning Tree Problems., and . ESA, volume 3221 of Lecture Notes in Computer Science, page 395-402. Springer, (2004)