1. U. Adamy, T. Erlebach, Online coloring of intervals with bandwidth, in: Proc. First Workshop on Approximation and Online Algorithms, 2003.
2. Y. Azar, A. Fiat, M. Levy, Improved algorithms for online coloring of intervals with bandwidth, Presented at the Workshop on Online Algorithms 2004, Rungstedgaard, Rungsted Kyst, Denmark, July 2004.
3. Online Computation and Competitive Analysis;Borodin,1998
4. On some packing problems related to dynamic storage allocation;Chrobak;RAIRO Inform. Theoret. Appl.,1988
5. A. Feldmann, B. Maggs, J. Sgall, D.D. Sleator, A. Tomkins, Competitive analysis of call admission algorithms that allow delay, Technical Report CMU-CS-95-102, Carnegie Mellon University, 1995.