Author of the publication

Lower Bounds for Several Online Variants of Bin Packing.

, , , , and . WAOA, volume 10787 of Lecture Notes in Computer Science, page 102-117. Springer, (2017)

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

Driver scheduling based on "driver-friendly" vehicle schedules., , , , , and . OR, page 323-328. Springer, (2011)A new lower bound for classic online bin packing., , , , and . CoRR, (2018)Bin packing problem with scenarios., and . Central Eur. J. Oper. Res., 27 (2): 377-395 (2019)More on ordered open end bin packing., , and . CoRR, (2020)Offline black and white bin packing., , , , , , and . Theor. Comput. Sci., (2015)A New Lower Bound for Classic Online Bin Packing., , , , and . WAOA, volume 11926 of Lecture Notes in Computer Science, page 18-28. Springer, (2019)Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems., , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 101-113. Springer, (2022)Online Bin Packing with Cardinality Constraints Resolved., , , , and . ESA, volume 87 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A New and Improved Algorithm for Online Bin Packing., , , , and . ESA, volume 112 of LIPIcs, page 5:1-5:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Truly asymptotic lower bounds for online vector bin packing., , and . CoRR, (2020)