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 Tight Approximation for Fully Dynamic Bin Packing without Bundling., , and . CoRR, (2017)Scheduling with Interjob Communication on Parallel Processors., , , and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 563-577. Springer, (2016)Monitoring of Domain-Related Problems in Distributed Data Streams., , , , , , , , , and 3 other author(s). SIROCCO, volume 10641 of Lecture Notes in Computer Science, page 212-226. Springer, (2017)Pure Nash equilibria in restricted budget games., , , and . J. Comb. Optim., 37 (2): 620-638 (2019)Non-preemptive Scheduling on Machines with Setup Times., , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 542-553. Springer, (2015)Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times., , , and . WAOA, volume 10787 of Lecture Notes in Computer Science, page 207-222. Springer, (2017)Cost-Efficient Scheduling on Machines from the Cloud., , , and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 578-592. Springer, (2016)Towards Flexible Demands in Online Leasing Problems., , , , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 277-288. Springer, (2015)Scheduling with scarce resources (Scheduling mit knappen Ressourcen). Paderborn University, Germany, (2017)base-search.net (ftunivpaderb:oai:digital.ub.uni-paderborn.de:2647082).Fully-Dynamic Bin Packing with Little Repacking., , , , , , and . ICALP, volume 107 of LIPIcs, page 51:1-51:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)