F. N. Abu-khzam, M. R. Fellows, M. A. Langston, and W. H. Suters, Crown Structures for Vertex Cover Kernelization, Theory of Computing Systems, vol.41, issue.3, pp.411-430, 2007.
DOI : 10.1007/s00224-007-1328-0

B. Balasundaram, S. Butenko, I. V. Hicks, and S. Sachdeva, -Plex Problem, Operations Research, vol.59, issue.1, 2008.
DOI : 10.1287/opre.1100.0851
URL : https://hal.archives-ouvertes.fr/hal-00823716

N. Baldwin, E. Chesler, S. Kirov, M. Langston, J. Snoddy et al., Computational, Integrative, and Comparative Methods for the Elucidation of Genetic Coexpression Networks, Journal of Biomedicine and Biotechnology, vol.2005, issue.2, pp.172-180, 2005.
DOI : 10.1155/JBB.2005.172

R. Bar-yehuda and S. Even, A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem, Ann. of Discrete Math, vol.25, pp.27-45, 1985.
DOI : 10.1016/S0304-0208(08)73101-3

H. L. Bodlaender and E. Penninkx, A Linear Kernel for Planar Feedback Vertex Set, Proc. 3rd IWPEC, pp.160-171, 2008.
DOI : 10.1007/978-3-540-79723-4_16

H. L. Bodlaender and B. Van-antwerpen-de-fluiter, Reduction Algorithms for Graphs of Small Treewidth, Information and Computation, vol.167, issue.2, pp.86-119, 2001.
DOI : 10.1006/inco.2000.2958

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
URL : http://anyserver.cityu.edu.hk/weijia/publication/vertex_cover.pdf

E. J. Chesler, L. Lu, S. Shou, Y. Qu, J. Gu et al., Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function, Nature Genetics, vol.143, issue.3, pp.233-242, 2005.
DOI : 10.1093/bioinformatics/btg112

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

J. Flum and M. Grohe, Parameterized Complexity Theory, 2006.

J. Guo, A more effective linear kernelization for cluster editing, Theor. Comput. Sci, 2008.

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

J. Guo and R. Niedermeier, Linear Problem Kernels for NP-Hard Problems on Planar Graphs, Proc. 34th ICALP, pp.375-386, 2007.
DOI : 10.1007/978-3-540-73420-8_34

I. A. Kanj, M. J. Pelsmajer, G. Xia, and M. Schaefer, On the induced matching problem, Journal of Computer and System Sciences, vol.77, issue.6, 2009.
DOI : 10.1016/j.jcss.2010.09.001
URL : https://hal.archives-ouvertes.fr/hal-00231081

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. Khuller, Algorithms column, ACM SIGACT News, vol.33, issue.2, pp.31-33, 2002.
DOI : 10.1145/564585.564598

C. Komusiewicz, F. Hüffner, H. Moser, and R. Niedermeier, Isolation Concepts for Enumerating Dense Subgraphs, Proc. 13th COCOON, pp.140-150, 2007.
DOI : 10.1007/978-3-540-73545-8_16

G. 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

N. Nishimura, P. Ragde, and D. M. Thilikos, Fast fixed-parameter tractable algorithms for nontrivial generalizations of Vertex Cover, Discrete Appl. Math, vol.152, pp.1-3229, 2005.

E. Prieto and C. Sloper, Looking at the stars, Theoretical Computer Science, vol.351, issue.3, pp.437-445, 2006.
DOI : 10.1016/j.tcs.2005.10.009

S. B. Seidman and B. L. Foster, A graph???theoretic generalization of the clique concept*, The Journal of Mathematical Sociology, vol.33, issue.1, pp.139-154, 1978.
DOI : 10.1002/bs.3830110409

J. Wang, D. Ning, Q. Feng, and J. Chen, An Improved Parameterized Algorithm for a Generalized Matching Problem, Proc. 5th TAMC, pp.212-222, 2008.
DOI : 10.1007/978-3-540-79228-4_19