E. Balas and C. S. Yu, On graphs with polynomially solvable maximum-weight clique problem, Networks, vol.10, issue.2, pp.247-253, 1989.
DOI : 10.1002/net.3230190206

C. Berge, Graphs and Hypergraphs. Number 6 in North-Holland Mathematical Library, 1973.

A. Brandstädt, V. B. Le, J. P. Spinrad-]-e, L. Cenek, and . Stewart, Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications Maximum independent set and maximum clique algorithms for overlap graphs, Society for Industrial and Applied Mathematics Discrete Applied Mathematics, vol.131, issue.41, pp.77-91, 1999.

G. Durán, Some new results on circle graphs, Matemática Contemporânea, vol.25, pp.91-106, 2003.

D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.
DOI : 10.2140/pjm.1965.15.835

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, 1979.

M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete problems, Proceedings of the sixth annual ACM symposium on Theory of computing , STOC '74, pp.47-63, 1974.
DOI : 10.1145/800119.803884

M. R. Garey, D. S. Johnson, and R. E. Tarjan, The Planar Hamiltonian Circuit Problem is NP-Complete, SIAM Journal on Computing, vol.5, issue.4, pp.704-714, 1976.
DOI : 10.1137/0205049

F. Gavril, Algorithms on circular-arc graphs. Networks, pp.357-369, 1974.

F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.1, pp.47-56, 1974.
DOI : 10.1016/0095-8956(74)90094-X

D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

L. T. Kou, L. J. Stockmeyer, and C. K. Wong, Covering edges by cliques with regard to keyword conflicts and intersection graphs, Communications of the ACM, vol.21, issue.2, pp.135-139, 1978.
DOI : 10.1145/359340.359346

D. T. Lee and J. Y. Leung, On the 2-Dimensional Channel Assignment Problem, IEEE Transactions on Computers, vol.33, issue.1, pp.2-6, 1984.
DOI : 10.1109/TC.1984.5009310

J. W. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics, vol.3, issue.1, pp.23-28, 1965.
DOI : 10.1007/BF02760024

E. Prisner, Graphs with few cliques, Proceedings of the 7th Quadrennial International Conference on the Theory and Applications of Graphs Graph Theory, Combinatorics, and Applications, pp.945-956, 1992.

C. S. Rim and K. Nakajima, On rectangle intersection and overlap graphs IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, pp.549-553, 1995.

J. P. Spinrad, Efficient Graph Representations. Number 19 in Fields Institute Monographs, 2003.
DOI : 10.1090/fim/019

S. Tsukiyama, M. Ide, H. Arioyoshi, and I. Shirakawa, A New Algorithm for Generating All the Maximal Independent Sets, SIAM Journal on Computing, vol.6, issue.3, pp.505-517, 1977.
DOI : 10.1137/0206036