P. Alimonti, G. Ausiello, L. Giovaniello, and M. Protasi, On the complexity of approximating weighted satisfiability problems, 1997.

C. Bazgan, S. Toubaline, and D. Vanderpooten, Critical edges/nodes for the minimum spanning tree problem: complexity and approximation, Journal of Combinatorial Optimization, vol.17, issue.2, pp.178-189
DOI : 10.1016/0895-7177(93)90236-R

URL : https://hal.archives-ouvertes.fr/hal-01499697

C. Bazgan, C. Bentz, C. Picouleau, and B. Ries, Blockers for the stability number and the chromatic number. Graphs and Combinatorics, pp.73-90, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01505546

C. Bazgan, A. Nichterlein, and R. Niedermeier, A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths, Algorithms and Complexity -9th International Conference Proceedings, volume 9079 of Lecture Notes in Computer Science, pp.47-60, 2015.
DOI : 10.1007/978-3-319-18173-8_3

URL : https://hal.archives-ouvertes.fr/hal-01431247

H. L. Bodlaender, B. M. Jansen, and S. Kratsch, Kernelization Lower Bounds by Cross-Composition, SIAM Journal on Discrete Mathematics, vol.28, issue.1, pp.277-305, 2014.
DOI : 10.1137/120880240

A. Brandstädt, Partitions of graphs into one or two independent sets and cliques, Discrete Mathematics, vol.152, issue.1-3, pp.47-54, 1996.
DOI : 10.1016/0012-365X(94)00296-U

A. Chateau and R. Giroudeau, Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem, Proc. AlCoB '14, pp.47-58, 2014.
DOI : 10.1007/978-3-319-07953-0_4

URL : https://hal.archives-ouvertes.fr/lirmm-01007556

A. Chateau and R. Giroudeau, A complexity and approximation framework for the maximization scaffolding problem, Theoretical Computer Science, vol.595, pp.92-106, 2015.
DOI : 10.1016/j.tcs.2015.06.023

URL : https://hal.archives-ouvertes.fr/lirmm-01219622

J. Chen, B. Chor, M. Fellows, X. Huang, D. W. Juedes et al., Tight lower bounds for certain parameterized NP-hard problems, Information and Computation, vol.201, issue.2, pp.216-231, 2005.
DOI : 10.1016/j.ic.2005.05.001

P. Crescenzi, A short guide to approximation preserving reductions, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, pp.262-273, 1997.
DOI : 10.1109/CCC.1997.612321

A. Dayarian, T. Michael, and A. Sengupta, SOPRA: Scaffolding algorithm for paired reads via statistical optimization, BMC Bioinformatics, vol.11, issue.1, p.345, 2010.
DOI : 10.1186/1471-2105-11-345

URL : https://bmcbioinformatics.biomedcentral.com/track/pdf/10.1186/1471-2105-11-345?site=bmcbioinformatics.biomedcentral.com

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013.
DOI : 10.1007/978-1-4471-5559-1

URL : http://195.134.81.187/data/conferences/shonan018/slides/Rod Downey/maindoc.pdf

S. Gao, W. Sung, and N. Nagarajan, Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences, Journal of Computational Biology, vol.18, issue.11, pp.1681-1691, 2011.
DOI : 10.1089/cmb.2011.0170

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. publisherfreeman, 1979.

J. Håstad, Clique is hard to approximate within n/sup 1-??/, Proceedings of 37th Conference on Foundations of Computer Science, 1997.
DOI : 10.1109/SFCS.1996.548522

M. Hunt, C. Newbold, M. Berriman, and T. Otto, A comprehensive evaluation of assembly scaffolding tools, Genome Biology, vol.15, issue.3, p.42, 2014.
DOI : 10.1186/gb-2004-5-2-r12

URL : http://doi.org/10.1186/gb-2014-15-3-r42

R. Impagliazzo and R. Paturi, On the Complexity of k-SAT, Journal of Computer and System Sciences, vol.62, issue.2, pp.367-375, 2001.
DOI : 10.1006/jcss.2000.1727

URL : https://doi.org/10.1006/jcss.2000.1727

R. Impagliazzo, R. Paturi, and F. Zane, Which Problems Have Strongly Exponential Complexity?, Journal of Computer and System Sciences, vol.63, issue.4, pp.512-530, 2001.
DOI : 10.1006/jcss.2001.1774

URL : https://doi.org/10.1006/jcss.2001.1774

D. Lokshtanov, D. Marx, and S. Saurabh, Lower bounds based on the exponential time hypothesis, Bulletin of the EATCS, vol.105, pp.41-72, 2011.

J. Plesník, The np-completeness of the hamiltonian cycle problem in planar digraphs with degree bound two, Inf. Process. Lett, vol.879, issue.4, pp.199-2010020, 1979.

M. Weller, A. Chateau, and R. Giroudeau, On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs, Combinatorial Optimization and Applications -9th International Conference Proceedings, volume 9486 of Lecture Notes in Computer Science, pp.409-423978, 2015.
DOI : 10.1007/3-540-36478-1_17

URL : https://hal.archives-ouvertes.fr/lirmm-01250982

M. Weller, A. Chateau, and R. Giroudeau, Exact approaches for scaffolding, BMC Bioinformatics, vol.16, issue.Suppl 14, pp.1471-2105
DOI : 10.1186/1471-2105-16-S14-S2

URL : https://hal.archives-ouvertes.fr/lirmm-01219627

M. Weller, A. Chateau, and R. Giroudeau, On the implementation of polynomial-time approximation algorithms for scaffold problems, 2015.

G. Woeginger, Exact Algorithms for NP-Hard Problems: A Survey, In Combinatorial Optimization ? Eureka, You Shrink! Lecture Notes in Computer Science, vol.2570, pp.185-207, 2003.
DOI : 10.1007/3-540-36478-1_17

URL : http://www2.fiit.stuba.sk/%7Ekvasnicka/Seminar_of_AI/woeginger.pdf