N. Faisal, . Abu-khzam, R. Michael, . Fellows, A. Michael et al., Crown structures for vertex cover kernelization, Theory of Computing Systems, pp.411-430, 2007.

L. Bodlaender, G. Rodney, . Downey, R. Michael, D. Fellows et al., On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.423-434, 2009.
DOI : 10.1016/j.jcss.2009.04.001

URL : https://doi.org/10.1016/j.jcss.2009.04.001

. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75663, 1990.
DOI : 10.1016/0890-5401(90)90043-H

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

L. Cygan, M. Kowalik, and . Pilipczuk, Open problem session of the Workshop on Kernelization, 2013.

M. Cygan and D. Lokshtanov, Marcin Pilipczuk, Micha? Pilipczuk, and Saket Saurabh. On the hardness of losing width, Theory of Computing Systems, pp.73-82, 2014.

M. Dom, D. Lokshtanov, and S. Saurabh, Kernelization Lower Bounds Through Colors and IDs, ACM Transactions on Algorithms, vol.11, issue.2, p.13, 2014.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

V. Fedor, D. Fomin, S. Lokshtanov, D. M. Saurabh, and . Thilikos, Bidimensionality and kernels, Proc. of the 21st ACM-SIAM Symp. on Disc. Algorithms (SODA), pp.503-510, 2010.

V. Fedor, T. J. Fomin, and . Strømme, Vertex cover structural parameterization revisited. CoRR, abs/1603, 2016.

R. Fortnow and . Santhanam, Infeasibility of instance compression and succinct PCPs for NP, Journal of Computer and System Sciences, vol.77, issue.1, pp.91-106, 2011.
DOI : 10.1016/j.jcss.2010.06.007

J. Gajarský, P. H. Obdrzálek, S. Ordyniak, F. Reidl, P. Rossmanith et al., Kernelization using structural parameters on sparse graph classes, Journal of Computer and System Sciences, vol.84, pp.219-242, 2017.
DOI : 10.1016/j.jcss.2016.09.002

V. Garnero, C. Paul, I. Sau, and D. M. Thilikos, Explicit Linear Kernels via Dynamic Programming, SIAM Journal on Discrete Mathematics, vol.29, issue.4, pp.1864-1894, 2015.
DOI : 10.1137/140968975

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

J. Guo, F. Hüffner, and R. Niedermeier, A Structural View on Parameterizing Problems: Distance from Triviality, Proc. of the 1st International Workshop on Parameterized and Exact Computation (IWPEC), pp.162-173, 2004.
DOI : 10.1007/978-3-540-28639-4_15

B. Jansen and H. Bodlaender, Vertex Cover Kernelization Revisited, Proc. of the 28th Symposium on Theoretical Aspects of Computer Science (STACS), volume 9 of LIPIcs, pp.177-188, 2011.
DOI : 10.1002/jgt.3190150208

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

J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith et al., Linear kernels and single-exponential algorithms via protrusion decompositions, ACM Transactions on Algorithms, vol.12, issue.2, p.21, 2016.
DOI : 10.1007/978-3-642-39206-1_52

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

D. Majumdar, V. Raman, and S. Saurabh, Kernels for structural parameterizations of vertex cover -case of small degree modulators, Proc. of the 10th International Symposium on Parameterized and Exact Computation (IPEC), volume 43 of LIPIcs, pp.331-342, 2015.

J. Nesetril and P. Mendez, Sparsity: Graphs, Structures, and Algorithms. Algorithms and Combinatorics URL: https, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00768681

R. Niedermeier, Reflections on multivariate algorithmics and problem parameterization
URL : https://hal.archives-ouvertes.fr/inria-00456146

G. Philip, V. Raman, and S. Sikdar, Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels, Proc. of the 17th Annual European Symposium on Algorithms (ESA), pp.694-705, 2009.
DOI : 10.1112/jlms/s1-38.1.423

F. Reidl, P. Rossmanith, F. S. Villaamil, and S. Sikdar, A Faster Parameterized Algorithm for Treedepth, Proc. of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), pp.931-942, 2014.
DOI : 10.1007/978-3-662-43948-7_77