I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos, Faster Parameterized Algorithms for Minor Containment, Theoretical Comput. Science, issue.50, pp.4127018-7028, 2011.
DOI : 10.1007/978-3-642-13731-0_31
URL : https://hal.archives-ouvertes.fr/lirmm-00736522

J. Alber, M. 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

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

H. L. Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.
DOI : 10.1137/S0097539793251219

H. L. Bodlaender, Kernelization: New Upper and Lower Bound Techniques, Proc. of the 4th International Workshop on Parameterized and Exact Computation (IWPEC), pp.17-37, 2009.
DOI : 10.1007/978-3-642-11269-0_2

H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, On Problems without Polynomial Kernels (Extended Abstract), Proc. of the 35th International Colloquium on Automata, Languages and Programming (ICALP), pp.563-574, 2008.
DOI : 10.1007/978-3-540-70575-8_46
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.5222

H. L. Bodlaender, B. M. Jansen, and S. Kratsch, Cross-composition: A new technique for kernelization lower bounds, Proc. of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 9 of LIPIcs, pp.165-176, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573603

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

C. Chekuri and J. Chuzhoy, Polynomial Bounds for the Grid-Minor Theorem. CoRR, abs/1305, 2013.
DOI : 10.1145/2591796.2591813
URL : http://arxiv.org/abs/1305.6577

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

H. Dell and D. Van-melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses, Proc. of the 42nd ACM symposium on Theory of computing (STOC), pp.251-260, 2010.
DOI : 10.1145/1806689.1806725
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.8104

E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos, )-center in planar graphs and map graphs, ACM Transactions on Algorithms, vol.1, issue.1, pp.33-47, 2005.
DOI : 10.1145/1077464.1077468

E. D. Demaine and M. Hajiaghayi, Linearity of grid minors in treewidth with applications through bidimensionality, Combinatorica, vol.14, issue.2, pp.19-36, 2008.
DOI : 10.1007/s00493-008-2140-4

U. Feige, M. Hajiaghayi, and J. R. Lee, Improved Approximation Algorithms for Minimum Weight Vertex Separators, SIAM Journal on Computing, vol.38, issue.2, pp.629-657, 2008.
DOI : 10.1137/05064299X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.597.5634

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

F. V. Fomin, P. A. Golovach, and D. M. Thilikos, Contraction obstructions for treewidth, Journal of Combinatorial Theory, Series B, vol.101, issue.5, pp.302-314, 2011.
DOI : 10.1016/j.jctb.2011.02.008

F. V. Fomin, D. Lokshtanov, N. Misra, and S. Saurabh, Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.470-479, 2012.
DOI : 10.1109/FOCS.2012.62

F. V. Fomin, D. Lokshtanov, V. Raman, and S. Saurabh, Bidimensionality and EPTAS, Proc. of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.748-759, 2011.
DOI : 10.1137/1.9781611973082.59

F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos, Bidimensionality and Kernels, Proc. of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.503-510, 2010.
DOI : 10.1137/1.9781611973075.43

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

K. Ichi-kawarabayashi and Y. Kobayashi, Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid, Proc. of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS), pp.278-289, 2012.

E. J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith et al., Linear kernels and single-exponential algorithms via protrusion decompositions, Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP), pp.613-624, 2013.
DOI : 10.1007/978-3-642-39206-1_52
URL : https://hal.archives-ouvertes.fr/hal-01383776

T. Kloks and . Treewidth, Computations and Approximations, LNCS, 1994.

A. Leaf and P. D. Seymour, Treewidth and planar minors, 2012.

D. Lokshtanov, D. Marx, and S. Saurabh, Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal, Proc. of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.777-789, 2011.
DOI : 10.1137/1.9781611973082.61

D. Lokshtanov, D. Marx, and S. Saurabh, Slightly Superexponential Parameterized Problems, Proc. of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.760-776, 2011.
DOI : 10.1137/1.9781611973082.60

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

B. Van-antwerpen-de-fluiter, Algorithms for graphs of small treewidth, 1997.