I. Adler, M. Grohe, and S. Kreutzer, Computing excluded minors, Proceedings of the 19th annual ACM-SIAM symposium on Discrete algorithms, pp.641-650, 2008.

J. Alber, N. Betzler, and R. Niedermeier, Experiments on data reduction for optimal domination in networks, Annals of Operations Research, vol.14, issue.2, pp.105-117, 2006.
DOI : 10.1007/s10479-006-0045-4

J. Alber, B. Dorn, and R. Niedermeier, A General Data Reduction Scheme for Domination in Graphs, Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science, pp.137-147, 2006.
DOI : 10.1007/11611257_11

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/pdf/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://www.labri.fr/perso/courcell/Textes1/BC-ArnbProskuSeese(1993).pdf

S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, vol.12, issue.2, pp.308-340, 1991.
DOI : 10.1016/0196-6774(91)90006-K
URL : http://www.aifb.uni-karlsruhe.de/CoM/seese/publications/../../publications/tree-decomposable_graphs.pdf

D. W. Bange, A. E. Barkauskas, and P. J. Slater, Efficient dominating sets in graphs, Applications of discrete mathematics, pp.189-199, 1986.

L. Hans and . Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput, vol.25, issue.6, pp.1305-1317, 1996.

L. Hans, B. Bodlaender, and . De-fluiter, Reduction algorithms for constructing solutions in graphs with small treewidth, Proceedings of the Second Annual International Conference on Computing and Combinatorics, pp.199-208, 1996.

L. Hans, R. G. Bodlaender, M. R. Downey, D. Fellows, and . Hermelin, On problems without polynomial kernels, J. Comput. Syst. Sci, issue.8, pp.75423-434, 2009.

L. Hans, F. V. Bodlaender, D. Fomin, E. Lokshtanov, S. Penninkx et al., (Meta) kernelization, Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp.629-638, 2009.

L. Hans, T. Bodlaender, and . Hagerup, Parallel algorithms with optimal speedup for bounded treewidth, SIAM J. Comput, vol.27, pp.1725-1746, 1998.

L. Hans, E. Bodlaender, and . Penninkx, A linear kernel for planar feedback vertex set, Proceedings of the 3rd international conference on parameterized and exact computation Lecture Notes Comp. Sci, pp.160-171, 2008.

L. Hans, E. Bodlaender, R. B. Penninkx, and . Tan, A linear kernel for the k-disjoint cycle problem on planar graphs, Proceedings of the 19th International Symposium on Algorithms and Computation, pp.306-317, 2008.

L. Hans, B. Bodlaender, and . Van-antwerpen-de-fluiter, Reduction algorithms for graphs of small treewidth, Inform. and Comput, vol.167, pp.86-119, 2001.

R. B. Borie, R. G. Parker, and C. A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, vol.50, issue.1-6, pp.555-581, 1992.
DOI : 10.1145/322326.322328

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://facweb.cs.depaul.edu/ikanj/papers/latex/kernel_journal.pdf

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://www.cs.tamu.edu/people/iakanj/wg.ps

J. Chen, Y. Liu, S. Lu, I. Barry-o-'sullivan, and . Razgon, A fixed-parameter algorithm for the directed feedback vertex set problem, J. ACM, vol.5521, issue.5, pp.1-2119, 2008.

B. Courcelle, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues, RAIRO - Theoretical Informatics and Applications, vol.26, issue.3, pp.257-286, 1992.
DOI : 10.1007/BFb0017421

B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic. In Handbook of graph grammars and computing by graph transformation, World Sci. Publ, vol.1, pp.313-400, 1997.

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

A. Dawar, M. Grohe, and S. Kreutzer, Locally Excluding a Minor, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.270-279, 2007.
DOI : 10.1109/LICS.2007.31
URL : http://www.cl.cam.ac.uk/~ad260/papers/lics07.pdf

F. Babette-de, Algorithms for Graphs of Small Treewidth, 1997.

G. Rodney, M. R. Downey, and . Fellows, Parameterized Complexity, 1998.

P. Duchet and H. Meyniel, On Hadwiger's Number and the Stability Number, Graph theory, pp.71-73, 1981.
DOI : 10.1016/S0304-0208(08)73549-7

Z. Dvorak, Constant-factor approximation of the domination number in sparse graphs, European Journal of Combinatorics, vol.34, issue.5, pp.833-840, 2013.
DOI : 10.1016/j.ejc.2012.12.004

D. Eppstein, Diameter and Treewidth in Minor-Closed Graph Families, Algorithmica, vol.27, issue.3, pp.275-291, 2000.
DOI : 10.1007/s004530010020
URL : http://arxiv.org/pdf/math/9907126v1.pdf

R. Michael, M. A. Fellows, and . Langston, An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations (extended abstract), Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), pp.520-525, 1989.

J. Flum and M. Grohe, Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, 2006.

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.503-510, 2010.
DOI : 10.1137/1.9781611973075.43
URL : http://arxiv.org/pdf/1606.05689

V. Fedor, D. Fomin, N. Lokshtanov, G. Misra, S. Philip et al., Hitting forbidden minors: Approximation and kernelization, Proceedings of the 8th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), volume 9 of LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.189-200, 2011.

V. Fedor, D. Fomin, N. Lokshtanov, S. Misra, and . Saurabh, Planar Fdeletion: Approximation, kernelization and optimal FPT algorithms, Proceedings of the 53rd Annual Symposium on Foundations of Computer Science, pp.470-479, 2012.

V. Fedor, D. Fomin, V. Lokshtanov, S. Raman, and . Saurabh, Bidimensionality and EPTAS, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp.748-759, 2011.

V. Fedor, D. Fomin, S. Lokshtanov, and . Saurabh, Bidimensionality and geometric graphs, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1563-1575, 2012.

V. Fedor, D. Fomin, S. Lokshtanov, D. M. Saurabh, and . Thilikos, Linear kernels for (connected) dominating set on H-minor-free graphs, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp.82-93, 2012.

V. Fedor, D. Fomin, S. Lokshtanov, D. M. Saurabh, and . Thilikos, Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl? Leibniz-Zentrum fuer Informatik, pp.92-103, 2013.

V. Fedor, S. Fomin, D. M. Saurabh, and . Thilikos, Strengthening Erd? os- Pósa property for minor-closed graph classes, J. Graph Theory, vol.66, issue.3, pp.235-240, 2011.

V. Fedor, D. M. Fomin, and . Thilikos, Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up, Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pp.581-592, 2004.

M. Frick and M. Grohe, Deciding first-order properties of locally tree-decomposable structures, Journal of the ACM, vol.48, issue.6, pp.1184-1206, 2001.
DOI : 10.1145/504794.504798
URL : http://arxiv.org/pdf/cs/0004007

M. Grohe, Logic, graphs, and algorithms Logic and Automata-History and Perspectives, pp.357-422, 2007.

M. Grohe, K. Kawarabayashi, D. Marx, and P. Wollan, Finding topological subgraphs is fixed-parameter tractable, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.479-488, 2011.
DOI : 10.1145/1993636.1993700
URL : http://arxiv.org/pdf/1011.1827

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, Proceedings of the 34th International Colloquium on Automata, Languages and Programming, pp.375-386, 2007.
DOI : 10.1007/978-3-540-73420-8_34
URL : http://theinf1.informatik.uni-jena.de/publications/kernel-planar-stamped.pdf

J. Guo, R. Niedermeier, and S. Wernicke, Fixed-parameter tractability results for full-degree spanning tree and its dual, Networks, vol.56, issue.2, pp.116-130, 2010.
DOI : 10.1007/11847250_19
URL : http://theinf1.informatik.uni-jena.de/publications/fulldegree-stamped.pdf

G. Gutin, T. Kloks, C. M. Lee, and A. Yeo, Kernels in planar digraphs, Journal of Computer and System Sciences, vol.71, issue.2, pp.174-184, 2005.
DOI : 10.1016/j.jcss.2005.02.003
URL : https://doi.org/10.1016/j.jcss.2005.02.003

G. Gutin, I. Razgon, and E. J. Kim, Minimum leaf out-branching and related problems, Theoretical Computer Science, vol.410, issue.45, pp.4571-4579, 2009.
DOI : 10.1016/j.tcs.2009.03.036
URL : https://doi.org/10.1016/j.tcs.2009.03.036

G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé, Hitting and Harvesting Pumpkins, Proceedings of the 19th Annual European Symposium on Algorithms, pp.394-407, 2011.
DOI : 10.1006/jctb.1995.1006
URL : https://hal.archives-ouvertes.fr/hal-01178192

M. Juvan, A. Malni?, and B. Mohar, Systems of Curves on Surfaces, Journal of Combinatorial Theory, Series B, vol.68, issue.1, pp.7-22, 1996.
DOI : 10.1006/jctb.1996.0053

M. Kaminski and D. M. Thilikos, Contraction checking in graphs on surfaces, Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science of Leibniz International Proceedings in Informatics (LIPIcs), pp.182-193, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678173

A. Iyad, M. J. Kanj, M. Pelsmajer, G. Schaefer, and . Xia, On the induced matching problem, J. Comput. Syst. Sci, vol.77, issue.6, pp.1058-1070, 2011.

E. J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith et al., Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions, Proceedings of the 40th Automata, Languages, and Programming International Colloquium (ICALP), pp.613-624, 2013.
DOI : 10.1007/978-3-642-39206-1_52
URL : https://hal.archives-ouvertes.fr/lirmm-00829999

E. J. Kim, C. Paul, and G. Philip, A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem, Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory, pp.119-130, 2012.
DOI : 10.1007/978-3-642-31155-0_11
URL : https://hal.archives-ouvertes.fr/hal-01496435

T. Kloks, C. M. Lee, and J. Liu, New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs, 28th International Workshop on Graph Theoretic Concepts in Computer Science, pp.282-295, 2002.
DOI : 10.1007/3-540-36379-3_25

S. Kratsch and M. Wahlström, Compression via Matroids, Proceedings of the 23rd Annual ACM- SIAM Symposium on Discrete Algorithms, pp.94-103, 2012.
DOI : 10.1016/j.orl.2003.10.009

S. Kreutzer, Algorithmic meta-theorems, Finite and algorithmic model theory, pp.177-270, 2011.
DOI : 10.1007/978-3-540-79723-4_3
URL : http://web.comlab.ox.ac.uk/people/Stephan.Kreutzer/Publications/08-iwpec.pdf

D. Lokshtanov, M. Mnich, and S. Saurabh, A linear kernel for a planar connected dominating set, Theoretical Computer Science, vol.412, issue.23, pp.2536-2543, 2011.
DOI : 10.1016/j.tcs.2010.10.045
URL : https://doi.org/10.1016/j.tcs.2010.10.045

B. Mohar, A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface, SIAM Journal on Discrete Mathematics, vol.12, issue.1, pp.6-26, 1999.
DOI : 10.1137/S089548019529248X

B. Mohar and C. Thomassen, Graphs on Surfaces, 2001.

H. Moser and S. Sikdar, The parameterized complexity of the induced matching problem, Discrete Applied Mathematics, vol.157, issue.4, pp.715-727, 2009.
DOI : 10.1016/j.dam.2008.07.011

J. Ne?et?il, P. Ossona, and . Mendez, Grad and classes with bounded expansion II. Algorithmic aspects, European Journal of Combinatorics, vol.29, issue.3, pp.777-791, 2008.
DOI : 10.1016/j.ejc.2006.07.014

G. Philip, V. Raman, and S. Sikdar, Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond, ACM Transactions on Algorithms, vol.9, issue.1, p.11, 2012.
DOI : 10.1145/2390176.2390187

W. V. Quine, The Problem of Simplifying Truth Functions, The American Mathematical Monthly, vol.59, issue.8, pp.521-531, 1952.
DOI : 10.2307/2308219

B. Reed, K. Smith, and A. Vetta, Finding odd cycle transversals, Operations Research Letters, vol.32, issue.4, pp.299-301, 2004.
DOI : 10.1016/j.orl.2003.10.009
URL : http://www.cs.mcgill.ca/~kaleigh/publications/foct.ps

N. Robertson and P. D. Seymour, Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995.
DOI : 10.1006/jctb.1995.1006
URL : https://doi.org/10.1006/jctb.1996.0059

N. Robertson, P. D. Seymour, and R. Thomas, Quickly Excluding a Planar Graph, Journal of Combinatorial Theory, Series B, vol.62, issue.2, pp.323-348, 1994.
DOI : 10.1006/jctb.1994.1073
URL : https://doi.org/10.1006/jctb.1994.1073

D. Paul, R. Seymour, and . Thomas, Graph searching and a minimax theorem for tree-width, J. Combin. Theory Ser. B, vol.58, pp.239-257, 1993.

S. Thomassé, A 4k 2 kernel for feedback vertex set, ACM Transactions on Algorithms, vol.6328, issue.2, pp.1-32, 2010.

M. M. Johan and . Van-rooij, Exact Exponential-Time Algorithms for Domination Problems in Graphs, 2011.

G. Xia and Y. Zhang, On the small cycle transversal of planar graphs, Theoretical Computer Science, vol.412, issue.29, pp.3501-3509, 2011.
DOI : 10.1016/j.tcs.2011.02.040

P. Cover, Almost-t-bounded treewidth, p-Almost-t-bounded pathwidth , p-H-Deletion, p-Edge Dominating Set, p-Minimum-Vertex Feedback Edge Set, p-Dominating Set, p-r-Dominating Set, p-q-Threshold Dominating Set, p-Efficient Dominating Set * , p-Connected Dominating Set, p- Connected Vertex Cover, p-Cycle Domination, p-Directed Domination, Partition Into Cliques Clique Cover * , and p-s-Cycle Transversal *, p.p- S-Covering p-Minimum p-Edge

P. Set, Acyclic Dominating Set, p-Independent Directed Domination, p-Maximum Internal Out-branching, p-Odd Set