G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and approximation. Combinatorial optimization problems and their approximability properties, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00906941

A. Becker and D. Geiger, Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem, Artificial Intelligence, vol.83, issue.1, pp.167-188, 1996.
DOI : 10.1016/0004-3702(95)00004-6

E. Bonnet, B. Escoffier, E. Kim, V. Th, and . Paschos, On Subexponential and FPT-Time Inapproximability, Proc. of International Workshop on Parameterized and Exact Computation, IPEC'13, pp.54-65, 2013.
DOI : 10.1007/978-3-319-03898-8_6
URL : https://hal.archives-ouvertes.fr/hal-01496451

N. Bourgeois, B. Escoffier, and V. Th, Approximation of min coloring by moderately exponential algorithms, Information Processing Letters, vol.109, issue.16, pp.950-954, 2009.
DOI : 10.1016/j.ipl.2009.05.002
URL : https://hal.archives-ouvertes.fr/hal-00906946

N. Bourgeois, B. Escoffier, V. Th, and . Paschos, Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, Discrete Applied Mathematics, vol.159, issue.17, pp.1954-1970, 2011.
DOI : 10.1016/j.dam.2011.07.009

L. Brankovic and H. Fernau, Combining Two Worlds: Parameterised Approximation for Vertex Cover, Proc. of International Symposium on Algorithms and Computation, pp.390-402, 2010.
DOI : 10.1007/978-3-642-17517-6_35
URL : http://ogma.newcastle.edu.au:8080/vital/access/manager/Repository/uon:12013/ATTACHMENT01

L. Cai and X. Huang, Fixed-parameter approximation: conceptual framework and approximability results, Proc. of International Workshop on Parameterized and Exact Computation, IWPEC'06
DOI : 10.1007/11847250_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.2987

Y. Chen, M. Grohe, and M. Grüber, On Parameterized Approximability, Proc. of International Workshop on Parameterized and Exact Computation, IWPEC'06, pp.109-120, 2006.
DOI : 10.1007/11847250_10
URL : http://basics.sjtu.edu.cn/~chen/papers/paraappfull.pdf

F. , D. Croce, and V. Th, Paschos, Efficient algorithms for the max k-vertex cover problem, J. Comb. Optim, vol.28, pp.674-691, 2014.

M. Cygan and M. Pilipczuk, Exact and approximate bandwidth, Theoretical Computer Science, vol.411, issue.40-42, pp.3701-3713, 2010.
DOI : 10.1016/j.tcs.2010.06.018
URL : http://doi.org/10.1016/j.tcs.2010.06.018

E. Dantsin, M. Gavrilovich, E. A. Hirsch, and B. Konev, MAX SAT approximation beyond the limits of polynomial-time approximation, Annals of Pure and Applied Logic, vol.113, issue.1-3, pp.81-94, 2002.
DOI : 10.1016/S0168-0072(01)00052-5

F. Della-croce, M. J. Kaminski, and V. Th, An exact algorithm for MAX-CUT in sparse graphs, Operations Research Letters, vol.35, issue.3, pp.403-408, 2007.
DOI : 10.1016/j.orl.2006.04.001
URL : https://hal.archives-ouvertes.fr/hal-00116633

I. Dinur and M. Safra, The importance of being biased, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.33-42, 2002.
DOI : 10.1145/509907.509915

R. G. Downey, M. R. Fellows, and C. Mccartin, Parameterized Approximation Problems, Proc. of International Workshop on Parameterized and Exact Computation, IWPEC'06, pp.121-129, 2006.
DOI : 10.1007/11847250_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.467.9346

B. Escoffier, V. Th, E. Paschos, and . Tourniaire, Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms, Proc. of Theory and Applications of Models of Computation, TAMC'12, pp.202-213, 2012.
DOI : 10.1007/978-3-642-29952-0_23
URL : https://hal.archives-ouvertes.fr/hal-01099861

U. Feige and M. Langberg, Approximation Algorithms for Maximization Problems Arising in Graph Partitioning, Journal of Algorithms, vol.41, issue.2, pp.174-211, 2001.
DOI : 10.1006/jagm.2001.1183

F. V. Fomin and D. Kratsch, Exact exponential algorithms, EATCS, 2010.
DOI : 10.1007/978-3-642-16533-7
URL : https://hal.archives-ouvertes.fr/hal-00085561

F. V. Fomin and Y. Villanger, Finding induced subgraphs via minimal triangulations, Proc. of International Symposium on Theoretical Aspects of Computer Science, STACS'10, pp.383-394, 2010.
DOI : 10.1137/1.9781611973402.44
URL : https://hal.archives-ouvertes.fr/inria-00455360

F. V. Fomin, F. Grandoni, and D. Kratsch, A measure & conquer approach for the analysis of exact algorithms, Journal of the ACM, vol.56, issue.5, pp.56-57, 2009.
DOI : 10.1145/1552285.1552286

M. Fürer, S. Gaspers, and S. P. Kasiviswanathan, An exponential time 2-approximation algorithm for bandwidth, Proc. of International Workshop on Parameterized and Exact Computation, IWPEC'09, 2009.

M. R. Garey and D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness, 1979.

M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM, vol.42, issue.6, pp.1115-1145, 1995.
DOI : 10.1145/227683.227684

J. Håstad, Some optimal inapproximability results, Journal of the ACM, vol.48, issue.4, pp.798-859, 2001.
DOI : 10.1145/502090.502098

R. Impagliazzo and R. Paturi, Complexity of k-SAT, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), pp.367-375, 2001.
DOI : 10.1109/CCC.1999.766282

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 2001.
DOI : 10.1109/SFCS.1998.743516
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.8482

G. Jäger and A. Srivastav, Improved Approximation Algorithms for Maximum Graph Partitioning Problems, Journal of Combinatorial Optimization, vol.90, issue.1, pp.133-167, 2005.
DOI : 10.1007/s10878-005-2269-7

R. M. Karp, Reducibility among combinatorial problems Complexity of computer computations, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

D. Marx, Parameterized Complexity and Approximation Algorithms, The Computer Journal, vol.51, issue.1, pp.60-78, 2008.
DOI : 10.1093/comjnl/bxm048
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.728

C. H. 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
URL : http://doi.org/10.1016/0022-0000(91)90023-x

I. Razgon, Computing minimum directed feedback vertex set in o(1.9977 n ), Proc. of Italian Conference in Theoretical Computer Science, ICTCS'07, pp.70-81, 2007.