1. Lecture Notes in Computer Science;S Angelopoulos,2015
2. Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discret. Appl. Math. 143(1–3), 238–251 (2004)
3. Balogh, J., Békési, J.: Semi-on-line bin packing: a short overview and a new lower bound. CEJOR 21(4), 685–698 (2013)
4. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: Online bin packing with cardinality constraints resolved. The Computing Research Repository (CoRR) (2016).
http://arxiv.org/abs/1608.06415
. Also in ESA 2017 (to appear)
5. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: A new and improved algorithm for online bin packing. The Computing Research Repository (CoRR) (2017).
http://arxiv.org/abs/1707.01728