K. Bogart, P. Fishburn, G. Isaak, and L. Langley, Proper and unit tolerance graphs, Discrete Applied Mathematics, vol.60, issue.1-3, pp.99-117, 1995.
DOI : 10.1016/0166-218X(94)00044-E

A. Buchsbaum, H. Karloff, C. Kenyon, N. Reingold, and M. Thorup, in Dynamic Storage Allocation, SIAM Journal on Computing, vol.33, issue.3, pp.632-646, 2004.
DOI : 10.1137/S0097539703423941

M. Chrobak and M. Slusarek, On some packing problem related to dynamic storage allocation, RAIRO Inform, Thor. Appl, vol.22, pp.487-499, 1988.

M. Golumbic and C. Monma, A generalization on of interval graphs with tolerances, Congress. Numer, vol.35, pp.321-331, 1982.

M. Golumbic, C. Monma, and W. Trotter, Tolerance graphs, Discrete Applied Math, vol.43, pp.157-170, 1984.

M. Golumbic and A. Trenk, Tolerance Graphs, 2004.
DOI : 10.1016/0166-218x(84)90016-7
URL : http://doi.org/10.1016/0166-218x(84)90016-7

H. Kierstead, The Linearity of First-Fit Coloring of Interval Graphs, SIAM Journal on Discrete Mathematics, vol.1, issue.4, pp.526-530, 1988.
DOI : 10.1137/0401048

H. Kierstead, A polynomial time approximation algorithm for dynamic storage allocation, Discrete Mathematics, vol.88, issue.2-3, pp.231-237, 1991.
DOI : 10.1016/0012-365X(91)90011-P

H. Kierstead and J. Qin, Coloring interval graphs with first-fit, Discrete Mathematics, vol.144, issue.1-3, pp.47-57, 1995.
DOI : 10.1016/0012-365X(94)00285-Q

H. Kierstead and K. Saoub, First-Fit coloring of bounded tolerance graphs, Discrete Applied Mathematics, vol.159, issue.7, pp.605-611, 2011.
DOI : 10.1016/j.dam.2010.05.002

H. Kierstead, D. Smith, and W. Trotter, First-fit coloring on interval graphs has performance ratio at least 5, European Journal of Combinatorics, vol.51
DOI : 10.1016/j.ejc.2015.05.015
URL : http://arxiv.org/abs/1506.00192

H. Kierstead and W. Trotter, An extremal problem in recursive combinatorics, Congr. Numer, vol.33, pp.143-153, 1981.

N. Narayanaswamy, R. Subhash, and . Babu, A Note on First-Fit Coloring of Interval Graphs, Order, vol.1, issue.4, pp.49-53, 2008.
DOI : 10.1007/s11083-008-9076-6

S. Pemmaraju, R. Raman, and K. Varadarajan, Buffer minimization using max-coloring, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.562-571, 2004.

D. Smith, The first-fit algorithm uses many colors on some interval graphs, 2010.