1. The hardness of intervalizing four colored caterpillars;Àlvarez;Discrete Mathematics,2001
2. C. Àlvarez, J. Díaz, and M. Serna. Intervalizing colored graphs is NP-complete for caterpillars with hair length 2. Technical Report LSI 98-9-R, Universitat Politècnica de Catalunya, 1998
3. H. Bodlaender, M.R. Fellows, and M.T. Hallet. Beyond NP-completeness for problems of bounded width: hardness for the W-hierarchy. In ACM Symposium on Theory of Computing, pages 449–458, 1995
4. DNA physical mapping: Three ways difficult;Fellows,1993
5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979