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

Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs., and . ADHOC-NOW, volume 5198 of Lecture Notes in Computer Science, page 1-14. Springer, (2008)Increasing Speed Scheduling and Flow Scheduling., and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 279-290. Springer, (2010)A (2+) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem., and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 973-984. Springer, (2015)Scheduling and Fixed-Parameter Tractability., and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 381-392. Springer, (2014)Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs., and . DCOSS, volume 5067 of Lecture Notes in Computer Science, page 415-431. Springer, (2008)Packing Cars into Narrow Roads: PTASs for Limited Supply Highway., and . ESA, volume 144 of LIPIcs, page 54:1-54:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Partitioned EDF scheduling on a few types of unrelated multiprocessors., , and . Real Time Syst., 49 (2): 219-238 (2013)New Approximation Schemes for Unsplittable Flow on a Path., , , , and . SODA, page 47-58. SIAM, (2015)Scheduling periodic tasks in a hard real-time environment., , , , , and . Scheduling, volume 10071 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back., , and . ESA, volume 204 of LIPIcs, page 49:1-49:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)