1. Albers, S., Hellwig, M.: Online makespan minimization with parallel schedules. Algorithmica 78(2), 492–520 (2017)
2. Lecture Notes in Computer Science;S Angelopoulos,2015
3. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: 26th Annual European Symposium on Algorithms (ESA 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)
4. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. arXiv preprint
arXiv:1807.05554
(2018). (To appear at 17th Workshop on Approximation and Online Algorithms (WAOA))
5. Boyar, J., Favrholdt, L.M., Kudahl, C., Larsen, K.S., Mikkelsen, J.W.: Online algorithms with advice: a survey. ACM Comput. Surv. (CSUR) 50(2), 19 (2017)