S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, vol.12, pp.308-340, 1991.

L. Hans, M. Bodlaender, S. Cygan, J. Kratsch, and . Nederlof, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information and Computation, vol.243, pp.86-111, 2015.

J. Chuzhoy, Improved bounds for the excluded grid theorem, 2016.

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation, vol.85, pp.12-75, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00353765

B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic. Handbook of Graph Grammars, pp.313-400, 1997.

J. Baste, D. M. Thilikos, and X. X. , , p.11

M. Cygan, J. Nederlof, M. Pilipczuk, M. Pilipczuk, J. M. Van-rooij et al., Solving connectivity problems parameterized by treewidth in single exponential time, Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), pp.150-159, 2011.

E. D. Demaine, Algorithmic Graph Minors and Bidimensionality, Proceedings of the 36th International Conference on Graph-theoretic Concepts in Computer Science (WG 2010), pp.2-2, 2010.

E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos, Bidimensional parameters and local treewidth, SIAM Journal on Discrete Mathematics, vol.18, issue.3, pp.501-511, 2005.

E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos, Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, Journal of the ACM, vol.52, issue.6, pp.866-893, 2005.

E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos, Bidimensional structures: Algorithms, combinatorics and logic, Dagstuhl Reports, vol.3, issue.3, pp.51-74, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00904522

E. D. Demaine and M. Hajiaghayi, Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth, Proceedings of the 12th International Symposium on Graph Drawing, vol.3383, pp.517-533, 2004.

E. D. Demaine and M. Hajiaghayi, Bidimensionality: New connections between FPT algorithms and PTASs, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp.590-601, 2005.

E. D. Demaine and M. Hajiaghayi, The bidimensionality theory and its algorithmic applications, The Computer Journal, vol.51, issue.3, pp.292-302, 2008.

E. D. Demaine and M. Hajiaghayi, Linearity of grid minors in treewidth with applications through bidimensionality, Combinatorica, vol.28, issue.1, pp.19-36, 2008.

E. D. Demaine, M. Hajiaghayi, and D. M. Thilikos, The bidimensional theory of bounded-genus graphs, SIAM Journal on Discrete Mathematics, vol.20, issue.2, pp.357-371, 2006.

E. D. Demaine, M. Hajiaghayi, and D. M. Thilikos, The bidimensional theory of bounded-genus graphs, SIAM Journal on Discrete Mathematics, vol.20, issue.2, pp.357-371, 2006.

R. Diestel, T. R. Jensen, K. Y. Gorbunov, and C. Thomassen, Highly connected sets and the excluded grid theorem, Journal of Combinatorial Theory. Series B, vol.75, issue.1, pp.61-73, 1999.

F. Dorn, V. Fedor, D. M. Fomin, and . Thilikos, Fast subexponential algorithm for non-local problems on graphs of bounded genus, Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, vol.4059, pp.172-183, 2006.

F. Dorn, V. Fedor, D. M. Fomin, and . Thilikos, Catalan structures and dynamic programming in H-minor-free graphs, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp.631-640, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00904498

V. Fedor, E. D. Fomin, M. Demaine, . Hajiaghayi, and . Bidimensionality, Encyclopedia of Algorithms, 2015.

V. Fedor, P. A. Fomin, D. M. Golovach, and . Thilikos, Contraction obstructions for treewidth, Journal of Combinatorial Theory. Series B, vol.101, issue.5, pp.302-314, 2011.

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

, XX:12 Contraction-Bidimensionality of Geometric Intersection Graphs

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

V. Fedor, D. Fomin, S. Lokshtanov, and . Saurabh, Efficient computation of representative sets with applications in parameterized and exact algorithms, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp.142-151, 2014.

V. Fedor, D. Fomin, S. Lokshtanov, D. M. Saurabh, and . Thilikos, Bidimensionality and kernels, Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp.503-510, 2010.

V. Fedor, D. Fomin, and . Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos. Bidimensionality and kernels. CoRR, 2016.

V. Fedor and D. M. Fomin, Thilikos Petr Golovach and. Contraction bidimensionality: the accurate picture, 17th Annual European Symposium on Algorithms, vol.5757, pp.706-717, 2009.

F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.1, pp.47-56, 1974.

C. Archontia, D. M. Giannopoulou, and . Thilikos, Optimizing the graph minors weak structure theorem, SIAM Journal on Discrete Mathematics, vol.27, issue.3, pp.1209-1227, 2013.

A. Grigoriev, A. Koutsonas, and D. M. Thilikos, Bidimensionality of Geometric Intersection Graphs, Proceedings of the 40th International Conference on Current Trends in Theory and Practice of Computer Science, vol.8327, pp.293-305, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-00904537

K. Kawarabayashi and Y. Kobayashi, Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid, Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012, vol.14, pp.278-289, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678187

K. Kawarabayashi, R. Thomas, and P. Wollan, New proof of the flat wall theorem, Journal of Combinatorial Theory, Series B, 2017.

A. Leaf and P. D. Seymour, Tree-width and planar minors, Journal of Combinatorial Theory. Series B, vol.111, pp.38-53, 2015.

J. Matou?ek, String graphs and separators, Geometry, Structure and Randomness in Combinatorics, pp.61-97, 2014.

M. Pilipczuk, Problems parameterized by treewidth tractable in single exponential time: A logical approach, Proceedings of the 36th International Conference on Mathematical Foundations of Computer Science (MFCS 2011), pp.520-531, 2011.

N. Robertson and P. D. Seymour, Graph Minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, pp.309-322, 1986.

N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory. Series B, vol.41, issue.1, pp.92-114, 1986.

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.

J. Rué, I. Sau, and D. M. Thilikos, Dynamic programming for H-minorfree graphs, Proceedings of Computing and Combinatorics-18th Annual International Conference, pp.86-97, 2012.

J. Rué, I. Sau, and D. M. Thilikos, Dynamic programming for graphs on surfaces, ACM Transactions on Algorithms, vol.10, issue.2, pp.1-8, 2014.

D. M. Thilikos, Graph minors and parameterized algorithm design, The Multivariate Algorithmic Revolution and Beyond-Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, pp.228-256, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-01083542