T. Biedl, B. Brejova, E. Demaine, A. Hamel, A. Lopez-ortiz et al., Finding Hidden Independent Sets in Interval Graphs, Theoretical Computer Science, vol.310, pp.1-3, 2004.
DOI : 10.1007/3-540-45071-8_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.7839

A. Brandst¨adtbrandst¨-brandst¨adt, V. B. Le, and J. , SPINRAD Graph Classes: A Survey, SIAM Monographs on Discrete Math. Appl, vol.3, 1999.

F. R. Chung, Labelings of graphs, Selected Topics in graph theory, pp.151-168, 1988.

J. D´iazd´iaz, J. Petit, and M. J. Serna, A survey of graph layout problems, ACM Computing Surveys, vol.34, issue.3, pp.313-356, 2002.
DOI : 10.1145/568522.568523

G. Even, S. Naor, B. Schieber, S. G. Rao, and . Even, Divide-and-conquer approximation algorithms via spreading metrics, Journal of the ACM, vol.47, issue.4, pp.585-616, 2000.
DOI : 10.1145/347476.347478
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.771

S. Even and Y. Shiloach, Completeness of Several Arrangement Problems The Technion, Computer Science Dept, 1975.

M. A. Goldberg and I. A. Klipker, Minimal placing of trees on a line, Academy of Sciences of Ukranian SSR, 1976.

M. Farach-colton, Y. Huang, and J. L. Woolford, Discovering temporal relations in molecular pathways using proteinprotein interactions, Proceedings of the 8th Annual International Conference on Computational Molecular Biology, pp.150-156, 2004.

U. Feige, Approximating the Bandwidth via Volume Respecting Embeddings, Journal of Computer and System Sciences, vol.60, issue.3, pp.510-539, 2000.
DOI : 10.1006/jcss.1999.1682

M. R. Garey, R. L. Graham, D. S. Johnson, and A. D. Knuth, Complexity Results for Bandwidth Minimization, SIAM Journal on Applied Mathematics, vol.34, issue.3, pp.477-495, 1978.
DOI : 10.1137/0134037

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

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

D. Johnson, The NP-completeness column: an ongoing guide, Journal of Algorithms, vol.6, issue.3, pp.434-451, 1985.
DOI : 10.1016/0196-6774(85)90012-4

D. J. Kleitman and R. V. Vohra, Computing the Bandwidth of Interval Graphs, SIAM Journal on Discrete Mathematics, vol.3, issue.3, pp.373-375, 1990.
DOI : 10.1137/0403033

D. Kratsch and L. K. Stewart, Approximating Bandwidth by Mixing Layouts of Interval Graphs, SIAM Journal on Discrete Mathematics, vol.15, issue.4, pp.435-449, 2002.
DOI : 10.1137/S0895480199359624

R. Mcconnell and J. Spinrad, Modular decomposition and transitive orientation, Discrete Math, pp.189-241, 1999.

B. Monien, The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.7, issue.4, pp.505-512, 1986.
DOI : 10.1137/0607057

S. Rao and A. Richa, New Approximation Techniques for Some Linear Ordering Problems, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98, pp.211-218, 1998.
DOI : 10.1137/S0097539702413197

Y. Shiloach, A Minimum Linear Arrangement Algorithm for Undirected Trees, SIAM Journal on Computing, vol.8, issue.1, pp.15-32, 1979.
DOI : 10.1137/0208002

A. P. Sprague, An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs, SIAM Journal on Discrete Mathematics, vol.7, issue.2, pp.213-220, 1994.
DOI : 10.1137/S0895480192232333

W. Unger, The complexity of the approximation of the bandwidth problem, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 1998.
DOI : 10.1109/SFCS.1998.743431

M. Waterman, Introduction to Computational Biology: Maps, Sequences and Genomes., Biometrics, vol.54, issue.1, 1995.
DOI : 10.2307/2534039