\begin{thebibliography}{1}

\bibitem{BrightwellKiersteadTrotter}
G.~Brightwell, H.~A. Kierstead, and W.~T. Trotter.
\newblock A note on the first-fit coloring of interval graphs.
\newblock personal communication, 2003.

\bibitem{BuchsbaumKarloffKenyonReingoldThorup}
Adam~L. Buchsbaum, Howard Karloff, Claire Kenyon, Nick Reingold, and Mikkel
  Thorup.
\newblock {OPT} versus {LOAD} in dynamic storage allocation.
\newblock {\em SIAM J. Comput.}, 33(3):632--646, 2004.

\bibitem{CorneilOlariuStewart}
D.G. Corneil, S.~Olariu, and L.~Stewart.
\newblock The ultimate interval graph recognition algorithm? (extended
  abstract).
\newblock In {\em Proceedings of the 9th ACM-SIAM Symposium on Discrete
  Algorithms}, pages 175--180, 1998.

\bibitem{NarayanaswamyBabu}
N.S. Narayanaswamy and R.~Subhash Babu.
\newblock Analysis of first-fit coloring of interval graphs.
\newblock personal communication, 2004.

\bibitem{PemmarajuRamanVaradarajan}
S.V. Pemmaraju, R.~Raman, and K.~Varadarajan.
\newblock Buffer minimization using max-coloring.
\newblock In {\em Proceedings of The ACM-SIAM Symposium on Discrete Algorithms
  (SODA)}, pages 562--571, 2004.

\end{thebibliography}
