J. Alber, M. R. Fellows, and R. Niedermeier, Polynomial-time data reduction for dominating set, Journal of the ACM, vol.51, issue.3, pp.363-384, 2004.
DOI : 10.1145/990308.990309
URL : http://arxiv.org/abs/cs/0207066

N. Alon and S. Gutner, Kernels for the dominating set problem on graphs with an excluded minor, 2008.

S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese, An algebraic theory of graph reduction, Journal of the ACM, vol.40, issue.5, pp.1134-1164, 1993.
DOI : 10.1145/174147.169807
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.3347

H. L. Bodlaender and B. De-fluiter, Reduction algorithms for constructing solutions in graphs with small treewidth, pp.199-208, 1996.
DOI : 10.1007/3-540-61332-3_153

H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.75423-434, 2009.
DOI : 10.1016/j.jcss.2009.04.001
URL : http://doi.org/10.1016/j.jcss.2009.04.001

H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh et al., (Meta) Kernelization, Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp.629-638, 2009.
DOI : 10.1109/focs.2009.46
URL : https://hal.archives-ouvertes.fr/lirmm-00904532

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, H. Fernau, I. A. Kanj, and G. Xia, Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size, SIAM Journal on Computing, vol.37, issue.4, pp.1077-1106, 2007.
DOI : 10.1137/050646354
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.1808

M. Cygan, F. Grandoni, and D. Hermelin, Tight Kernel Bounds for Problems on Graphs with Small Degeneracy, 2012.
DOI : 10.1007/978-3-642-40450-4_31
URL : http://arxiv.org/abs/1305.4914

M. Cygan, M. Pilipczuk, M. Pilipczuk, and J. Wojtaszczyk, Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs, Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, pp.147-158, 1997.
DOI : 10.1006/jctb.2000.2013

H. Dell, D. Van-melkebeek, E. D. Demaine, F. V. Fomin, M. Hajiaghayi et al., Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs, Proceedings of the 42nd ACM Symposium on Theory of Computing, pp.251-26033, 2005.

E. D. Demaine, F. V. Fomin, M. Hajiaghayi, D. M. Thilikos, E. D. Demaine et al., -minor-free graphs, Journal of the ACM, vol.52, issue.6, pp.866-893332, 2005.
DOI : 10.1145/1101821.1101823
URL : https://hal.archives-ouvertes.fr/lirmm-00904522

M. R. Fellows and M. A. Langston, An analogue of the myhill-nerode theorem and its use in computing finite-basis characterizations (extended abstract), FOCS, pp.520-525, 1989.

J. Flum, M. Grohe, F. V. Fomin, D. Lokshtanov, N. Misra et al., Parameterized Complexity Theory Hitting forbidden minors: Approximation and kernelization Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik Bidimensionality and EPTAS Bidimensionality and geometric graphs, Theoretical Computer Science. An EATCS Series Proceedings of the 8th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), volume 9 of LIPIcs Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011) Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms SIAM, 2012. 22 F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos. Bidimensionality and kernels Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp.189-200, 2006.

F. V. Fomin, D. Lokshtanov, S. Saurabh, D. M. Thilikos, and D. M. Thilikos, Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp.281-309, 2006.
DOI : 10.1137/S0097539702419649

M. Grohe, D. M. Haynes, S. T. Hedetniemi, P. J. Slater, R. Impagliazzo et al., 26 S. Gutner. Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor Fundamentals of domination in graphs Which problems have strongly exponential complexity?, Structure theorem and isomorphism test for graphs with excluded topological subgraphs. In STOC Proceedings of the 4th Workshop on Parameterized and Exact Computation Lect. Notes Comp. Sc. Linear kernels and single-exponential algorithms via protrusion decompositions. CoRR, abs, pp.173-192, 1207.

G. Philip, V. Raman, and S. Sikdar, Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels, Proceedings of the 17th Annual European Symposium on Algorithms, pp.694-70543, 2003.
DOI : 10.1007/978-3-642-04128-0_62