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

H. L. Bodlaender, R. G. Downey, M. R. Fellows, M. T. Hallett, and H. T. Wareham, Parameterized complexity analysis in computational biology, Bioinformatics, vol.11, issue.1, pp.49-57, 1995.
DOI : 10.1093/bioinformatics/11.1.49

C. Choffrut and J. Karhumäki, Combinatorics of words, Handbook of formal languages, pp.329-438, 1997.

M. J. Collins, D. Kempe, J. Saia, and M. Young, Nonnegative integral subset representations of integer sets, Information Processing Letters, vol.101, issue.3, pp.129-133, 2007.
DOI : 10.1016/j.ipl.2006.08.007

M. A. Fitch and R. E. Jamison, Minimum sum covers of small cyclic groups, Congressus Numerantium, vol.147, pp.65-81, 2000.

A. Gyárfás, Combinatorics of intervals, preliminary version, Institute for Mathematics and its Applications (IMA) Summer Workshop on Combinatorics and Its Applications, 2003.

H. Haanpää, Minimum sum and difference covers of abelian groups, Journal of Integer Sequences, vol.7, issue.2, 2004.

H. Haanpää, A. Huima, and P. R. Ostergård, Sets in <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:msub><mml:mi>???</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math> with distinct sums of pairs, Discrete Applied Mathematics, vol.138, issue.1-2, pp.99-106, 2004.
DOI : 10.1016/S0166-218X(03)00273-7

M. Hajiaghayi, K. Jain, L. Lau, A. Russell, I. Mandoiu et al., Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping, Proc. 6th International Conference on Computational Science (ICCS), Part II, pp.758-766, 2006.
DOI : 10.1007/11758525_102

D. Hermelin, D. Rawitz, R. Rizzi, and S. Vialette, The minimum substring cover problem, Proc. 5th International Workshop on Approximation and Online Algorithms (WAOA), pp.170-183, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00619729

L. Moser, On the representation of 1, 2, . . . , n by sums, Acta Arithmetica, vol.6, pp.11-13, 1960.

J. Néraud, Elementariness of a finite set of words is co-NP-complete, RAIRO - Theoretical Informatics and Applications, vol.24, issue.5, pp.459-470, 1990.
DOI : 10.1051/ita/1990240504591

R. Niedermeier, Invitation to fixed parameter algorithms, Lecture Series in Mathematics and Its Applications, 2006.

C. H. Papadimitriou, Computational complexity, 1994.

C. N. Swanson, Planar cyclic difference packings, Journal of Combinatorial Designs, vol.5, issue.6, pp.426-434, 2000.
DOI : 10.1002/1520-6610(2000)8:6<426::AID-JCD5>3.0.CO;2-4

D. Wiedemann, Cyclic difference covers through 133, Congressus Numerantium, vol.90, pp.181-185, 1992.