1. Adamy U, Erlebach T (2003) Online coloring of intervals with bandwidth. In: Proceedings of the first international workshop on approximation and online algorithms (WAOA2003), Budapest, Hungary, pp 1–12
2. Azar Y, Fiat A, Levy M, Narayanaswamy NS (2006) An improved algorithm for online coloring of intervals with bandwidth. Theor Comput Sci 363(1):18–27
3. Bar-Noy A, Motwani R, Naor J (1992) The greedy algorithm is optimal for on-line edge coloring. Inf Process Lett 44(5):251–253
4. Chrobak M, Ślusarek M (1988) On some packing problems relating to dynamical storage allocation. RAIRO J Inf Theory Appl 22:487–499
5. Epstein L, Levin A (2012) On the max coloring problem. Theor Comput Sci 462(1):23–38