P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, vol.237, issue.1-2, pp.123-134, 2000.
DOI : 10.1016/S0304-3975(98)00158-3

B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-123, 1979.
DOI : 10.1016/0020-0190(79)90002-4

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

K. Hakata and H. Imai, The longest common subsequence problem for small alphabet size between many strings, Proc. 3rd International Symp. on Algorithms and Computation (ISAAC), pp.469-478, 1992.
DOI : 10.1007/3-540-56279-6_99

W. Hsu and M. Du, New algorithms for the LCS problem, Journal of Computer and System Sciences, vol.29, issue.2, pp.133-152, 1984.
DOI : 10.1016/0022-0000(84)90025-4

T. Jiang and M. Li, On the Approximation of Shortest Common Supersequences and Longest Common Subsequences, SIAM Journal on Computing, vol.24, issue.5, pp.1122-1139, 1995.
DOI : 10.1137/S009753979223842X

D. Maier, The Complexity of Some Problems on Subsequences and Supersequences, Journal of the ACM, vol.25, issue.2, pp.322-336, 1978.
DOI : 10.1145/322063.322075