A. Asinowski, E. Cohen, M. C. Golumbic, V. Limouzy, M. Lipshteyn et al., Vertex Intersection Graphs of Paths on a Grid Journal of Graph Algorithms and Applications, vol.16, issue.2, pp.129-150, 2012.

Y. Aumann, M. Lewenstein, O. Melamud, R. Y. Pinter, and Z. Yakhini, Dotted interval graphs and high throughput genotyping, Proc. of the 16th Annual Symposium on Discrete Algorithms, SODA '05, pp.339-348, 2005.

R. Bar-yehuda, M. M. Halldórsson, and J. S. Naor, Hadas Shachnai, and Irina Shapira. Scheduling split intervals, SIAM J. Comput, vol.36, pp.1-15, 2006.

P. Berman and T. Fujito, On approximation properties of the Independent set problem for degree 3 graphs, Proceedings of the 4th Workshop on Algorithms and Data Structures, WADS '95, vol.955, pp.449-460, 1995.

A. Butman, D. Hermelin, M. Lewenstein, and D. Rawitz, Optimization problems in multiple-interval graphs, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07, pp.268-277, 2007.

S. Cabello, J. Cardinal, and S. Langerman, The Clique Problem in Ray Intersection Graph, 2011.

M. Chlebík and J. Chlebíkova, The complexity of combinatorial optimization problems on d-dimensional boxes, SIAM Journal on Discrete Mathematics, vol.21, issue.1, pp.158-169, 2007.

M. Crochemore, D. Hermelin, G. Landau, D. Rawitz, and S. Vialette, Approximating the 2-interval pattern problem, Proc. of the 13th Annual European Symposium on Algorithms, ESA '05, pp.426-437, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00619979

R. Michael, D. S. Garey, and . Johnson, Rectilinear steiner tree problem is NP-complete, SIAM J. Appl. Math, vol.6, pp.826-834, 1977.

F. Gavril, Algorithms for a maximum clique and a maximum independent set of a circle graph, Networks, vol.3, pp.261-273, 1973.

F. Gavril, Maximum weight independent sets and cliques in intersection graphs of filaments. Information Processing Letters, vol.73, pp.181-188, 2000.

D. S. Hochbaum and A. Levin, Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms, Disc. Optimiz, vol.3, issue.4, p.327340, 2006.

W. Hsu, Maximum weight clique algorithms for circular-arc graphs and circle graphs, SIAM J. Comput, vol.14, issue.1, pp.224-231, 1985.

M. Jiang and Y. Zhang, Parameterized Complexity in Multiple-Interval Graphs: Domination, Partition, Separation, Irredundancy. arXiv, 2011.

T. Kaiser, Transversals of d-Intervals, Discrete Comput Geom, vol.18, pp.195-203, 1997.

F. Kammer, T. Tholey, and H. Voepel, Approximation algorithms for intersection graphs, Proceedings of the 13th international workshop on Approximation Algorithms for Combinatorial Optimization Problems and 14th International workshop on Randomization and Computation, AP-PROX/RANDOM'10, pp.260-273, 2010.

F. G. König, Sorting with objectives, 2009.

J. Kratochvíl and J. Ne?et?il, Independent set and clique problems in intersection-defined classes of graphs, vol.31, p.8593, 1990.

M. Middendorf and F. Pfeiffer, The max clique problem in classes of string-graphs, Discrete Mathematics, vol.108, pp.365-372, 1992.

B. Monien and E. Speckenmeyer, Ramsey numbers and an approximation algorithm for the vertex cover problem, Acta Inf, vol.22, pp.115-123, 1985.

C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci, vol.43, pp.425-440, 1991.

E. R. Scheinerman, The maximum interval number of graphs with given genus, Journal of Graph Theory, vol.11, issue.3, pp.441-446, 1987.

R. Edward, D. B. Scheinerman, and . West, The interval number of a planar graph: Three intervals suffice, Journal of Combinatorial Theory, Series B, vol.35, issue.3, pp.224-239, 1983.

T. William, F. Trotter, and . Harary, On double and multiple interval graphs, Journal of Graph Theory, vol.3, issue.3, pp.205-211, 1979.

L. G. Valiant, Universality considerations in VLSI circuits, IEEE Transactions on Computers, vol.30, issue.2, pp.135-140, 1981.

B. Douglas, D. B. West, and . Shmoys, Recognizing graphs with fixed interval number is NP-complete, Discrete Applied Mathematics, vol.8, issue.3, pp.295-305, 1984.

D. Zuckerman, Linear degree extractors and the inapproximability of max clique and chromatic number, Proc. 38th ACM Symp. Theory of Computing, STOC '06, 681690, 2006.