J. Akiyama and V. Chvátal, A short proof of the linear arboricity for cubic graphs. The bulletin of liberal arts & sciences, Nippon Medical School, vol.2, pp.1-3, 1982.

P. Alimonti and V. Kann, Hardness of approximating problems on cubic graphs, LNCS, vol.1203, pp.288-298, 1997.
DOI : 10.1007/3-540-62592-5_80

K. Appel and W. Haken, Every planar map is four colorable, Bulletin of the American Mathematics Society, pp.82-711, 1976.

T. C. Biedl, G. Kant, and M. Kaufmann, On triangulating planar graphs under the four-connectivity constraint, Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), pp.83-94, 1994.

L. Bulteau, G. Fertin, M. Jiang, and I. Rusu, Tractability and Approximability of Maximal Strip Recovery, Lecture Notes in Computer Science, vol.4, pp.336-349, 2011.
DOI : 10.1007/978-3-642-14355-7_33
URL : https://hal.archives-ouvertes.fr/hal-00606167

L. Bulteau, G. Fertin, and I. Rusu, Maximal strip recovery problem with gaps: Hardness and approximation algorithms, Dong et al. [14], pp.710-719
URL : https://hal.archives-ouvertes.fr/hal-00826876

J. Chen and S. B. Cooper, Theory and Applications of Models of Computation, 6th Annual Conference, Proceedings, 2009.

Z. Chen, B. Fu, M. Jiang, and B. Zhu, On recovering syntenic blocks from comparative maps, LNCS, vol.5165, pp.319-327, 2008.

Z. Chen, B. Fu, M. Jiang, and B. Zhu, On recovering syntenic blocks from comparative maps, Journal of Combinatorial Optimization, vol.4, issue.3, pp.307-318, 2009.
DOI : 10.1007/s10878-009-9233-x

M. Chlebík and J. Chlebíková, Complexity of approximating bounded variants of optimization problems, Theoretical Computer Science, vol.354, issue.3, pp.320-338, 2006.
DOI : 10.1016/j.tcs.2005.11.029

V. Choi, C. Zheng, Q. Zhu, and D. Sankoff, Algorithms for the Extraction of Synteny Blocks from Comparative Maps, LNCS, vol.4645, pp.277-288, 2007.
DOI : 10.1007/978-3-540-74126-8_26

A. Goldstein, P. Kolman, and J. Zheng, Minimum Common String Partition Problem: Hardness and Approximations, Electr. J. Comb, vol.12, 2005.
DOI : 10.1007/978-3-540-30551-4_43

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

H. Jiang, Z. Li, G. Lin, L. Wang, and B. Zhu, Exact and approximation algorithms for??the??complementary maximal strip recovery problem, Journal of Combinatorial Optimization, vol.4, issue.7, pp.1-14
DOI : 10.1007/s10878-010-9366-y

H. Jiang and B. Zhu, Weak kernels, Electronic Colloquium on Computational Complexity (ECCC), vol.17, issue.5, 2010.

M. Jiang, Inapproximability of maximal strip recovery, Theoretical Computer Science, vol.412, issue.29, pp.616-625
DOI : 10.1016/j.tcs.2011.04.021

M. Jiang, Inapproximability of Maximal Strip Recovery: II, Lecture Notes in Computer Science, vol.6213, pp.53-64, 2010.
DOI : 10.1007/978-3-642-14553-7_8

M. Jiang, Inapproximability of maximal strip recovery, Theoretical Computer Science, vol.412, issue.29, pp.3759-3774, 2011.
DOI : 10.1016/j.tcs.2011.04.021

Z. Li, R. Goebel, L. Wang, and G. Lin, An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem, FAW-AAIM, pp.46-57, 2011.
DOI : 10.1109/TCBB.2007.1075

G. Lin, R. Goebel, Z. Li, and L. Wang, An improved approximation algorithm for the complementary maximal strip recovery problem, Journal of Computer and System Sciences, vol.78, issue.3, pp.720-730, 2012.
DOI : 10.1016/j.jcss.2011.10.014

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

J. Misra and D. Gries, A constructive proof of Vizing's theorem, Information Processing Letters, vol.41, issue.3, pp.131-133, 1992.
DOI : 10.1016/0020-0190(92)90041-S

C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.
DOI : 10.1016/0022-0000(91)90023-X

N. Robertson, D. P. Sanders, P. D. Seymour, and R. Thomas, Efficiently four-coloring planar graphs, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.571-575, 1996.
DOI : 10.1145/237814.238005

D. Sankoff, C. Zheng, A. Muñoz, Z. Yang, Z. Adam et al., Issues in the Reconstruction of Gene Order Evolution, Journal of Computer Science and Technology, vol.323, issue.5920, pp.10-25, 2009.
DOI : 10.1007/s11390-010-9301-9

L. Wang and B. Zhu, On the tractability of maximal strip recovery, pp.400-409

L. Wang and B. Zhu, On the Tractability of Maximal Strip Recovery, Journal of Computational Biology, vol.17, issue.7, pp.907-914, 2010.
DOI : 10.1089/cmb.2009.0084

C. Zheng, Q. Zhu, and D. Sankoff, Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.4, pp.515-522, 2007.
DOI : 10.1109/TCBB.2007.1075

B. Zhu, Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems, pp.71-80
DOI : 10.1007/978-3-642-02017-9_10

B. Zhu, Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery, Lecture Notes in Computer Science, vol.6124, pp.325-333, 2010.
DOI : 10.1007/978-3-642-14355-7_33