. Spinrad, Graph classes : a survey, Society for Industrial and Applied Mathematics, 1999.

F. Clautiaux, J. Carlier, and A. Moukrim, A new exact method for the two-dimensional orthogonal packing problem, European Journal of Operational Research, vol.183, issue.3, pp.1196-1211, 2007.
DOI : 10.1016/j.ejor.2005.12.048

S. P. Fekete and J. Schepers, A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing, Mathematics of Operations Research, vol.29, issue.2, pp.353-368, 2004.
DOI : 10.1287/moor.1030.0079

S. P. Fekete and J. Schepers, A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems, Mathematical Methods of Operational Research, vol.60, issue.2, pp.311-329, 2004.
DOI : 10.1007/s001860400376

S. P. Fekete, J. Schepers, and J. Van-der-veen, An Exact Algorithm for Higher-Dimensional Orthogonal Packing, Operations Research, vol.55, issue.3, pp.569-587, 2007.
DOI : 10.1287/opre.1060.0369

URL : http://arxiv.org/abs/cs/0604045

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

M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

R. E. Korf, Optimal rectangle packing, ICAPS, pp.142-149, 2004.
DOI : 10.1007/s10479-008-0463-6

N. Korte and R. H. Möhring, An Incremental Linear-Time Algorithm for Recognizing Interval Graphs, SIAM Journal on Computing, vol.18, issue.1, pp.68-81, 1989.
DOI : 10.1137/0218005

S. Martello, M. Monaci, and D. Vigo, An Exact Approach to the Strip-Packing Problem, INFORMS Journal on Computing, vol.15, issue.3, pp.310-319, 2003.
DOI : 10.1287/ijoc.15.3.310.16082

D. Michael, M. E. Moffitt, and . Pollack, Optimal rectangle packing : A meta-csp approach, ICAPS, pp.93-102, 2006.

T. Soh, K. Inoue, N. Tamura, M. Banbara, and H. Nabeshima, A sat-based method for solving the twodimensional strip packing problem, Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2008.