( en | de | ru )

 

Disambiguation of "Wiese, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
Real-Time Message Routing and Scheduling.

, , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 217-230. Springer, (2009)

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.

Andreas Wiese

Andreas Wiese

Andreas Wiese

Andreas Wiese

Andreas Wiese

 

Other publications of authors with the same name

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)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)Increasing Speed Scheduling and Flow Scheduling., and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 279-290. Springer, (2010)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)Scheduling and Fixed-Parameter Tractability., and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 381-392. Springer, (2014)Partitioned EDF scheduling on a few types of unrelated multiprocessors., , and . Real Time Syst., 49 (2): 219-238 (2013)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)New Approximation Schemes for Unsplittable Flow on a Path., , , , and . SODA, page 47-58. SIAM, (2015)Fixed-Parameter Approximation Schemes for Weighted Flowtime.. APPROX-RANDOM, volume 116 of LIPIcs, page 28:1-28:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)This House Proves That Debating is Harder Than Soccer., and . FUN, volume 49 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)