1. Baker KA, Fishburn PC, Roberts FS (1971) Partial orders of dimension 2. Networks 2(1):11–28
2. Bean DR (1976) Effective coloration. J Symb Log 41(2):469–480
3. Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge
4. Coffman E Jr, Garey M, Johnson D (1996) Approximation algorithms for bin packing: a survey. In: Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, pp 46–93
5. Dosa G (2007) The tight bound of bin packing algorithm FFD is FFD(I) < = 11/9 OPT(I) + 6/9. In: Lecture Notes in Computer Sciences, vol 4614, ESCAPE 2007. Springer, Berlin, pp 1–11