Author of the publication

All-Around Near-Optimal Solutions for the Online Bin Packing Problem.

, and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 727-739. Springer, (2015)

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

Context-Based Algorithms for the List-Update Problem under Alternative Cost Models., , , and . DCC, page 361-370. IEEE, (2013)Online Bin Packing with Advice., , , and . STACS, volume 25 of LIPIcs, page 174-186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Interruptible Algorithms for Multiproblem Solving., and . CoRR, (2018)On universally easy classes for NP-complete problems., , and . Theor. Comput. Sci., 304 (1-3): 471-476 (2003)Algorithmic foundations of the internet. SIGACT News, 36 (2): 45--62 (June 2005)A linear lower bound on index size for text retrieval., and . J. Algorithms, 48 (1): 2-15 (2003)List Colouring and Partial List Colouring of Graphs On-line., , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 124-135. Springer, (2015)Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design.. CAAN, volume 4852 of Lecture Notes in Computer Science, page 3-12. Springer, (2007)Online Bin Packing with Advice., , , and . Algorithmica, 74 (1): 507-527 (2016)On the online fault-tolerant server consolidation problem., , and . SPAA, page 12-21. ACM, (2014)