From post

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.

 

Другие публикации лиц с тем же именем

A Tight Approximation for Fully Dynamic Bin Packing without Bundling., , и . CoRR, (2017)Scheduling with Interjob Communication on Parallel Processors., , , и . COCOA, том 10043 из Lecture Notes in Computer Science, стр. 563-577. Springer, (2016)Monitoring of Domain-Related Problems in Distributed Data Streams., , , , , , , , , и 3 other автор(ы). SIROCCO, том 10641 из Lecture Notes in Computer Science, стр. 212-226. Springer, (2017)Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times., , , и . WAOA, том 10787 из Lecture Notes in Computer Science, стр. 207-222. Springer, (2017)Pure Nash equilibria in restricted budget games., , , и . J. Comb. Optim., 37 (2): 620-638 (2019)Non-preemptive Scheduling on Machines with Setup Times., , , и . WADS, том 9214 из Lecture Notes in Computer Science, стр. 542-553. Springer, (2015)Cost-Efficient Scheduling on Machines from the Cloud., , , и . COCOA, том 10043 из Lecture Notes in Computer Science, стр. 578-592. Springer, (2016)Towards Flexible Demands in Online Leasing Problems., , , , и . COCOON, том 9198 из Lecture Notes in Computer Science, стр. 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., , , , , , и . ICALP, том 107 из LIPIcs, стр. 51:1-51:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)