P. Alimonti and V. Kann, Hardness of approximating problems on cubic graphs, CIAC, volume 1203 of LNCS, p.288298, 1997.
DOI : 10.1007/3-540-62592-5_80

Z. Chen, B. Fu, M. Jiang, and B. Zhu, On recovering syntenic blocks from comparative maps, LNCS, vol.5165, p.319327, 2008.

V. Choi, C. Zheng, Q. Zhu, and D. Sanko, Algorithms for the Extraction of Synteny Blocks from Comparative Maps, WABI, p.277288, 2007.
DOI : 10.1007/978-3-540-74126-8_26

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

G. J. Minty, On maximal independent sets of vertices in claw-free graphs, Journal of Combinatorial Theory, Series B, vol.28, issue.3, p.284304, 1980.
DOI : 10.1016/0095-8956(80)90074-X

C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. Syst. Sci, vol.43, issue.3, p.425440, 1991.
DOI : 10.1016/0022-0000(91)90023-x
URL : http://doi.org/10.1016/0022-0000(91)90023-x

L. Wang and B. Zhu, On the tractability of maximal strip recovery, LNCS, vol.5532, p.400409, 2009.

C. Zheng, Q. Zhu, and D. Sanko, Removing noise and ambiguities from comparative maps in rearrangement analysis, IEEE/ACM Trans. Comput. Biology Bioinform, vol.4, issue.4, p.515522, 2007.