1. Azar, Y., Cohen, I.R., Kamara, S., Shepherd, F.B.: Tight bounds for online vector bin packing. In: Proceedings of the 45th ACM Symposium on Theory of Computing (STOC 2013), pp. 961–970 (2013)
2. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. In: Proceedings of the 26th European Symposium on Algorithms (ESA 2018), pp. 5:1–5:14 (2018)
3. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: Lower bounds for several online variants of bin packing. Theory Comput. Syst. 63(8), 1757–1780 (2019). https://doi.org/10.1007/s00224-019-09915-1
4. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: A new lower bound for classic online bin packing. CoRR, abs/1807.05554 (2018). Also in Proceedings of the WAOA 2019
5. Balogh, J., Békési, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theory Comput. Sys. 440–441, 1–13 (2012)