N. Faisal, R. L. Abu-khzam, M. R. Collins, M. A. Fellows, W. H. Langston et al., Kernelization algorithms for the vertex cover problem: Theory and experiments, Proc. 6th ALENEX/ANALC, pp.62-69, 2004.

N. Faisal, M. R. Abu-khzam, M. A. Fellows, W. H. Langston, and . Suters, Crown structures for vertex cover kernelization, Theory Comput. Syst, vol.41, issue.3, pp.411-430, 2007.

V. Bafna, P. Berman, and T. Fujito, A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem, SIAM Journal on Discrete Mathematics, vol.12, issue.3, pp.289-297, 1999.
DOI : 10.1137/S0895480196305124

L. Hans, B. M. Bodlaender, S. Jansen, and . Kratsch, Cross-composition: A new technique for kernelization lower bounds, 1011.

L. Hans, S. Bodlaender, A. Thomassé, and . Yeo, Kernel bounds for disjoint cycles and disjoint paths, Proc. 17th ESA, pp.635-646, 2009.

J. F. Buss and J. Goldsmith, Nondeterminism within $P^ * $, SIAM Journal on Computing, vol.22, issue.3, pp.560-572, 1993.
DOI : 10.1137/0222038

L. Cai, Parameterized complexity of vertex colouring, Discrete Applied Mathematics, vol.127, issue.3, pp.415-429, 2003.
DOI : 10.1016/S0166-218X(02)00242-1

J. Chen, I. A. Kanj, and W. Jia, Vertex Cover: Further Observations and Further Improvements, Journal of Algorithms, vol.41, issue.2, pp.280-301, 2001.
DOI : 10.1006/jagm.2001.1186

J. Chen, I. A. Kanj, and G. Xia, Improved Parameterized Upper Bounds for Vertex Cover, Proc. 31st MFCS, pp.238-249, 2006.
DOI : 10.1007/11821069_21

M. Chlebík and J. Chlebíková, Crown reductions for the Minimum Weighted Vertex Cover problem, Discrete Applied Mathematics, vol.156, issue.3, pp.292-312, 2008.
DOI : 10.1016/j.dam.2007.03.026

M. Chor, D. W. Fellows, and . Juedes, Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps, Proc. 30th WG, pp.257-269, 2004.
DOI : 10.1007/978-3-540-30559-0_22

H. Dell and D. Van-melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses, Proc. 42nd STOC, pp.251-260, 2010.

J. Díaz, J. Petit, and D. M. Thilikos, Kernels for the Vertex Cover Problem on the Preferred Attachment Model, Proc. 5th WEA, pp.231-240, 2006.
DOI : 10.1007/11764298_21

M. Dom, D. Lokshtanov, and S. Saurabh, Incompressibility through Colors and IDs, Proc. 36th ICALP, pp.378-389, 2009.
DOI : 10.1007/978-3-642-02927-1_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.1154

R. Downey and M. R. Fellows, Parameterized Complexity. Monographs in Computer Science, 1999.

R. G. Downey, M. R. Fellows, and U. Stege, Parameterized complexity: A framework for systematically confronting computational intractability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.49-99, 1997.
DOI : 10.1007/978-1-4612-0515-9

V. Estivill-castro, M. Fellows, M. Langston, and F. R. , FPT is P-time extremal structure I, Proc. 1st ACiD, pp.1-41, 2005.

R. Michael and . Fellows, Towards fully multivariate algorithmics: Some new results and directions in parameter ecology, Proc. 20th IWOCA, pp.2-10, 2009.

R. Michael, D. Fellows, N. Lokshtanov, M. Misra, F. A. Mnich et al., The complexity ecology of parameters: An illustration using bounded max leaf number, Theory Comput. Syst, vol.45, issue.4, pp.822-848, 2009.

R. Michael, D. Fellows, N. Lokshtanov, F. A. Misra, S. Rosamond et al., Graph layout problems parameterized by vertex cover, Proc. 19th ISAAC, pp.294-305, 2008.

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

J. Guo and R. Niedermeier, Invitation to data reduction and problem kernelization, ACM SIGACT News, vol.38, issue.1, pp.31-45, 2007.
DOI : 10.1145/1233481.1233493

M. P. Bart, H. L. Jansen, and . Bodlaender, Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter, 2010.

S. Khot and O. Regev, Vertex cover might be hard to approximate to within <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:mn>2</mml:mn><mml:mo>???</mml:mo><mml:mi>??</mml:mi></mml:math>, Journal of Computer and System Sciences, vol.74, issue.3, pp.335-349, 2008.
DOI : 10.1016/j.jcss.2007.06.019

S. Kratsch and P. Schweitzer, Isomorphism for Graphs of Bounded Feedback Vertex Set Number, Proc. 12th SWAT, pp.81-92, 2010.
DOI : 10.1007/978-3-642-13731-0_9

L. Nemhauser and L. E. Trotter, Vertex packings: Structural properties and algorithms, Mathematical Programming, vol.5, issue.1, pp.232-248, 1975.
DOI : 10.1007/BF01580444

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

R. Niedermeier, Reflections on multivariate algorithmics and problem parameterization, Proc. 27th STACS, pp.17-32, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00456146

R. Niedermeier and P. Rossmanith, On efficient fixed-parameter algorithms for weighted vertex cover, Journal of Algorithms, vol.47, issue.2, pp.63-77, 2003.
DOI : 10.1016/S0196-6774(03)00005-1

J. Uhlmann and M. Weller, Two-layer planarization parameterized by feedback edge set, Proc. 7th TAMC, pp.431-442, 2010.
DOI : 10.1007/978-3-642-13562-0_39
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.3033

J. Zito, The structure and maximum number of maximum independent sets in trees, Journal of Graph Theory, vol.7, issue.2, pp.207-221, 1991.
DOI : 10.1002/jgt.3190150208