I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos, Fast Minor Testing in Planar Graphs, Algorithms -ESA 2010, 18th Annual European Symposium, pp.97-109, 2010.
DOI : 10.1007/978-3-642-15775-2_9
URL : https://hal.archives-ouvertes.fr/lirmm-00736769

I. Adler, M. Grohe, and S. Kreutzer, Computing excluded minors, nineteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '08, pp.641-650, 2008.

I. Adler, S. G. Kolliopoulos, P. K. Krause, D. Lokshtanov, S. Saurabh et al., Tight Bounds for Linkages in Planar Graphs, Automata, Languages and Programming -38th International Colloquium, ICALP 2011, pp.110-121, 2011.
DOI : 10.1016/0166-218X(93)E0177-Z

J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier, Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs, Algorithmica, vol.33, issue.4, pp.461-493, 2002.
DOI : 10.1007/s00453-001-0116-5

J. Alber, F. Dorn, and R. Niedermeier, Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs, Structural Decompositions, Width Parameters, and Graph Labelings, pp.219-231, 2005.
DOI : 10.1016/j.dam.2004.01.013

J. Alber and R. Niedermeier, Improved Tree Decomposition Based Algorithms for Domination-like Problems, LATIN 2002: Theoretical Informatics, pp.221-233, 2002.
DOI : 10.1007/3-540-45995-2_52

E. Amir, Approximation Algorithms for Treewidth, Algorithmica, vol.2, issue.2, pp.448-479, 2010.
DOI : 10.1007/s00453-008-9180-4

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

N. Betzler, R. Niedermeier, and J. Uhlmann, Tree decompositions of graphs: Saving memory in dynamic programming, Graphs and Combinatorial Optimization, pp.220-229, 2006.
DOI : 10.1016/j.disopt.2006.05.008

D. Bienstock and N. Dean, On obstructions to small face covers in planar graphs, Journal of Combinatorial Theory, Series B, vol.55, issue.2, pp.163-189, 1992.
DOI : 10.1016/0095-8956(92)90040-5

A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto, Fourier meets Möbius: fast subset convolution, STOC, pp.67-74, 2007.

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

H. L. Bodlaender, Dynamic programming on graphs with bounded treewidth, 15th International Colloquium on Automata, Languages and Programming (ICALP), pp.105-118, 1988.
DOI : 10.1007/3-540-19488-6_110
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.8503

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, M. R. Fellows, and M. T. Hallett, Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy, twenty-sixth annual ACM symposium on Theory of computing, pp.449-458, 1994.

H. L. Bodlaender and J. A. Telle, Space-efficient construction variants of dynamic programming, Nordic J. Comput, vol.11, issue.4, pp.374-385, 2004.

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.1007/BF01758777

L. Cai and D. Juedes, On the existence of subexponential parameterized algorithms, Journal of Computer and System Sciences, vol.67, issue.4, pp.789-807, 2003.
DOI : 10.1016/S0022-0000(03)00074-6

K. Cattell, M. J. Dinneen, R. G. Downey, M. R. Fellows, and M. A. Langston, On computing graph minor obstruction sets, Theoretical Computer Science, vol.233, issue.1-2, pp.107-127, 2000.
DOI : 10.1016/S0304-3975(97)00300-9

J. Chlebíková, The structure of obstructions to treewidth and pathwidth, Discrete Applied Mathematics, vol.120, issue.1-3, pp.61-71, 2002.
DOI : 10.1016/S0166-218X(01)00281-5

B. Courcelle, R. G. Downey, and M. R. Fellows, A note on the computability of graph minor obstruction sets for monadic second order ideals, First Japan-New Zealand Workshop on Logic in Computer Science, pp.1194-1198, 1997.

M. Cygan, J. Nederlof, M. Pilipczuk, M. Pilipczuk, J. M. Van-rooij et al., Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.150-159, 2011.
DOI : 10.1109/FOCS.2011.23
URL : http://arxiv.org/abs/1103.0534

X. Dahan and J. Tillich, Ramanujan graphs of very large girth based on octonions, 2010.

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

A. Dawar and S. Kreutzer, Domination problems in nowhere-dense classes, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST-TCS 2009), pp.157-168, 2009.

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-51105, 2004.
DOI : 10.1137/S0895480103433410
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.6195

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

E. D. Demaine and M. Hajiaghayi, Bidimensionality, Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.590-601, 2005.
DOI : 10.1007/978-0-387-30162-4_47
URL : https://hal.archives-ouvertes.fr/lirmm-01483707

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

E. D. Demaine, M. Hajiaghayi, and K. Kawarabayashi, Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner???s Contraction, Algorithmica, vol.9, issue.6, pp.142-180, 2009.
DOI : 10.1007/s00453-007-9138-y
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.4250

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.
DOI : 10.1137/040616929

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.
DOI : 10.1006/jctb.1998.1862
URL : http://doi.org/10.1006/jctb.1998.1862

M. J. Dinneen, Too many minor order obstructions (for parameterized lower ideals) In First Japan-New Zealand Workshop on Logic in Computer Science, pp.1199-1206, 1997.

F. Dorn, Dynamic Programming and Fast Matrix Multiplication, 14th Annual European Symposium on Algorithms, pp.280-291, 2006.
DOI : 10.1007/11841036_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.2981

F. Dorn, F. V. Fomin, and D. M. Thilikos, Fast subexponential algorithm for nonlocal problems on graphs of bounded genus, 10th Scandinavian Workshop on Algorithm Theory, pp.172-183, 2006.

F. Dorn, F. V. Fomin, and D. M. Thilikos, Catalan structures and dynamic programming in H-minor-free graphs, ACM-SIAM Symposium on Discrete Algorithms, pp.631-640, 2008.
DOI : 10.1016/j.jcss.2012.02.004
URL : https://hal.archives-ouvertes.fr/lirmm-00904498

F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin, Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions, Algorithmica, vol.15, issue.2, pp.790-810, 2010.
DOI : 10.1007/s00453-009-9296-1

R. G. Downey and M. R. Fellows, Parameterized complexity. Monographs in Computer Science, 1999.
DOI : 10.1007/978-1-4612-0515-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.3797

J. A. Ellis, I. H. Sudborough, and J. S. Turner, The Vertex Separation and Search Number of a Graph, Information and Computation, vol.113, issue.1, pp.50-79, 1994.
DOI : 10.1006/inco.1994.1064

P. Erd?-os and H. Sachs, Reguläre graphen gegebener tailenweite mit minimaler knollenzahh, Wiss. Z. Univ. Halle-Willenberg Math. Nat, vol.12, pp.251-258, 1063.

M. R. Fellows, Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology, IWOCA, pp.2-10, 2009.
DOI : 10.1007/978-3-642-10217-2_2

M. R. Fellows and M. A. Langston, On search, decision, and the efficiency of polynomial-time algorithms, Journal of Computer and System Sciences, vol.49, issue.3, pp.769-779, 1994.
DOI : 10.1016/S0022-0000(05)80079-0

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

F. V. Fomin, S. S. Lokshtanov, and D. M. Thilikos, -minor-free graphs, 23st ACM?SIAM Symposium on Discrete Algorithms, 2012.
DOI : 10.1137/1.9781611973099.7
URL : https://hal.archives-ouvertes.fr/inria-00358112

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
URL : http://doi.org/10.1016/j.jctb.2011.02.008

F. V. Fomin, D. Lokshtanov, N. Misra, G. Philip, and S. Saurabh, Hitting Forbidden Minors: Approximation and Kernelization, STACS, pp.189-200, 2011.
DOI : 10.1137/140997889
URL : https://hal.archives-ouvertes.fr/hal-00573641

F. V. Fomin, D. Lokshtanov, V. Raman, and S. Saurabh, Bidimensionality and EPTAS, 22st ACM?SIAM Symposium on Discrete Algorithms, pp.748-759, 2011.
DOI : 10.1137/1.9781611973082.59
URL : http://arxiv.org/abs/1005.5449

F. V. Fomin, D. Lokshtanov, V. Raman, and S. Saurabh, Subexponential algorithms for partial cover problems, Information Processing Letters, vol.111, issue.16, pp.814-818, 2011.
DOI : 10.1016/j.ipl.2011.05.016
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.3313

F. V. Fomin, D. Lokshtanov, and S. Saurabh, Bidimensionality and Geometric Graphs, 23st ACM?SIAM Symposium on Discrete Algorithms, 2012.
DOI : 10.1137/1.9781611973099.124
URL : http://arxiv.org/abs/1107.2221

F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos, Bidimensionality and Kernels, 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp.503-510, 2010.
DOI : 10.1137/1.9781611973075.43
URL : http://arxiv.org/abs/1606.05689

F. V. Fomin and D. M. Thilikos, Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up, SIAM Journal on Computing, vol.36, issue.2, pp.281-309, 2006.
DOI : 10.1137/S0097539702419649

M. Frick and M. Grohe, The complexity of first-order and monadic second-order logic revisited, Annals of Pure and Applied Logic, vol.130, issue.1-3, pp.3-31, 2004.
DOI : 10.1016/j.apal.2004.01.007

H. Friedman, N. Robertson, and P. D. Seymour, The metamathematics of the graph minor theorem, Logic and combinatorics, pp.229-261, 1985.
DOI : 10.1090/conm/065/891251

H. M. Friedman, Internal finite tree embeddings, Reflections on the foundations of mathematics, pp.60-91, 1998.
DOI : 10.1017/9781316755983.004

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.
DOI : 10.1016/0095-8956(74)90094-X

J. F. Geelen, A. M. Gerards, N. Robertson, and G. P. Whittle, On the excluded minors for the matroids of branch-width k, Journal of Combinatorial Theory, Series B, vol.88, issue.2, pp.261-265, 2003.
DOI : 10.1016/S0095-8956(02)00046-1

A. C. Giannopoulou and D. M. Thilikos, Obstructions for Tree-depth, Electronic Notes in Discrete Mathematics, vol.34, pp.249-253, 2009.
DOI : 10.1016/j.endm.2009.07.041

A. C. Giannopoulou and D. M. Thilikos, Optimizing the Graph Minors Weak Structure Theorem, SIAM Journal on Discrete Mathematics, vol.27, issue.3, 2011.
DOI : 10.1137/110857027
URL : https://hal.archives-ouvertes.fr/lirmm-00904527

P. A. Golovach, M. Kami´nskikami´nski, D. Paulusma, and D. M. Thilikos, Induced packing of odd cycles in a planar graph, 20th International Symposium on Algorithms and Computation, pp.514-523, 2009.

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/abs/1011.1827

Q. Gu and H. Tamaki, Improved bounds on the planar branchwidth with respect to the largest grid minor size, Algorithms and Computation -21st International Symposium, pp.85-96, 2010.

P. Heggernes, P. Van-'t-hof, B. Jansen, S. Kratsch, and Y. Villanger, Parameterized complexity of vertex deletion into perfect graph classes, 18th International Symposium on Fundamentals of Computation Theory (FCT '11), pp.240-251, 2011.

P. Heggernes, P. Van-'t-hof, D. Lokshtanov, and C. Paul, Obtaining a Bipartite Graph by Contracting Few Edges, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp.217-228, 2011.
DOI : 10.1137/130907392
URL : https://hal.archives-ouvertes.fr/hal-01178184

G. Higman, Ordering by Divisibility in Abstract Algebras, Proc. London Math. Soc. (3), pp.326-336, 1952.
DOI : 10.1112/plms/s3-2.1.326

T. Ito, M. Kami´nskikami´nski, D. Paulusma, and D. M. Thilikos, Parameterizing cut sets in a graph by the number of their components, Theoretical Computer Science, vol.412, issue.45, pp.6340-6350, 2011.
DOI : 10.1016/j.tcs.2011.07.005

D. S. Johnson, The NP-completeness column: An ongoing guide, Journal of Algorithms, vol.8, issue.2, pp.285-303, 1987.
DOI : 10.1016/0196-6774(87)90043-5

M. Kami´nskikami´nski and N. Nishimura, Finding an induced path of given parity in planar graphs in polynomial time, Proceedings of the Twenty-Second Annual ACM- SIAM Symposium on Discrete Algorithms, pp.656-670, 2011.

M. Kami´nskikami´nski and D. M. Thilikos, Contraction checking in graphs on surfaces, 29th International Symposium on Theoretical Aspects of Computer ScienceSTACS 2012), pp.182-193, 2012.

K. Kawarabayashi, Half integral packing, Erd? os-Pósa-property and graph minors, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms , SODA '07, pp.1187-1196, 2007.

K. Kawarabayashi, Planarity Allowing Few Error Vertices in Linear Time, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp.639-648, 2009.
DOI : 10.1109/FOCS.2009.45

K. Kawarabayashi and Y. Kobayashi, The edge disjoint paths problem in eulerian graphs and 4-edge-connected graphs, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '10, pp.345-353, 2010.

K. Kawarabayashi and Y. Kobayashi, An Improved Algorithm for the Half-Disjoint Paths Problem, SIAM Journal on Discrete Mathematics, vol.25, issue.3, pp.1322-1330, 2011.
DOI : 10.1137/100808812

K. Kawarabayashi, Y. Kobayashi, and B. Reed, The disjoint paths problem in quadratic time, Journal of Combinatorial Theory, Series B, vol.102, issue.2, 2011.
DOI : 10.1016/j.jctb.2011.07.004

K. Kawarabayashi, S. Kreutzer, and B. Mohar, Linkless and flat embeddings in 3-space and the unknot problem, Proceedings of the 2010 annual symposium on Computational geometry, SoCG '10, pp.97-106, 2010.
DOI : 10.1145/1810959.1810975

K. Kawarabayashi, Z. Li, and B. A. Reed, Recognizing a totally odd K4- subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 201, pp.318-328, 2010.

K. Kawarabayashi, B. Mohar, and B. A. Reed, A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.771-780, 2008.
DOI : 10.1109/FOCS.2008.53

K. Kawarabayashi and B. A. Reed, Hadwiger's conjecture is decidable, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.445-454, 2009.
DOI : 10.1145/1536414.1536476

K. Kawarabayashi and B. A. Reed, Odd cycle packing, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.695-704, 2010.
DOI : 10.1145/1806689.1806785

K. Kawarabayashi and P. Wollan, A shorter proof of the graph minor algorithm, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.771-780, 2008.
DOI : 10.1145/1806689.1806784

J. Kneis and A. Langer, A Practical Approach to Courcelle's Theorem, Electronic Notes in Theoretical Computer Science, vol.251, pp.65-81, 2009.
DOI : 10.1016/j.entcs.2009.08.028

J. Kneis, A. Langer, and P. Rossmanith, Courcelle???s theorem???A game-theoretic approach, Discrete Optimization, vol.8, issue.4, 2011.
DOI : 10.1016/j.disopt.2011.06.001

Y. Kobayashi and K. Kawarabayashi, Algorithms for Finding an Induced Cycle in Planar Graphs and Bounded Genus Graphs, 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1146-1155, 2009.
DOI : 10.1137/1.9781611973068.124

A. Koutsonas, D. M. Thilikos, and K. Yamazaki, Outerplanar obstructions for matroid pathwidth, EuroComb 2011: European Conference on Combinatorics, Graph Theory and Applications, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-01225581

S. Kreutzer and S. Tazari, On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '10, pp.354-364, 2010.
DOI : 10.1137/1.9781611973075.30

K. Kuratowski, Sur leprobì eme des courbes gauches en topologie, Fund. Math, vol.15, pp.271-283, 1930.

J. Lagergren, Efficient Parallel Algorithms for Graphs of Bounded Tree-Width, Journal of Algorithms, vol.20, issue.1, pp.20-44, 1996.
DOI : 10.1006/jagm.1996.0002

J. Lagergren, Upper Bounds on the Size of Obstructions and Intertwines, Journal of Combinatorial Theory, Series B, vol.73, issue.1, pp.7-40, 1998.
DOI : 10.1006/jctb.1997.1788

D. Lokshtanov, D. Marx, and S. Saurabh, Slightly Superexponential Parameterized Problems, 22st ACM?SIAM Symposium on Discrete Algorithms, pp.760-776, 2011.
DOI : 10.1137/1.9781611973082.60
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.724

L. Lovász, Graph minor theory, Bulletin of the American Mathematical Society, vol.43, issue.01, pp.75-86, 2006.
DOI : 10.1090/S0273-0979-05-01088-8

D. Marx, Chordal Deletion is Fixed-Parameter Tractable, Algorithmica, vol.2, issue.1, pp.747-768, 2010.
DOI : 10.1007/s00453-008-9233-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.7774

D. Marx and I. Schlotter, Obtaining a Planar Graph by Vertex Deletion, Algorithmica, vol.10, issue.4, pp.807-822, 2012.
DOI : 10.1007/s00453-010-9484-z

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

C. S. Nash-williams, On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc, pp.833-835, 1963.

B. H. Neumann, On ordered division rings, Transactions of the American Mathematical Society, vol.66, issue.1, pp.202-252, 1949.
DOI : 10.1090/S0002-9947-1949-0032593-5

R. Niedermeier, Invitation to fixed-parameter algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications, 2006.

T. D. Parsons, Pursuit-evasion in a graph, Proceedings Internat. Conf., Western Mich, pp.426-441, 1976.
DOI : 10.1007/BFb0070400

S. Ramachandramurthi, The Structure and Number of Obstructions to Treewidth, SIAM Journal on Discrete Mathematics, vol.10, issue.1, pp.146-157, 1997.
DOI : 10.1137/S0895480195280010

B. A. Reed, Finding approximate separators and computing tree width quickly, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , STOC '92, pp.221-228, 1992.
DOI : 10.1145/129712.129734

B. A. Reed and D. R. Wood, Polynomial treewidth forces a large grid-like-minor, European Journal of Combinatorics, vol.33, issue.3, pp.374-379, 2012.
DOI : 10.1016/j.ejc.2011.09.004
URL : http://arxiv.org/abs/0809.0724

N. Robertson and P. D. Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1984.
DOI : 10.1016/0095-8956(84)90013-3
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4
URL : http://doi.org/10.1006/jctb.1999.1919

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.
DOI : 10.1016/0095-8956(86)90030-4
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.
DOI : 10.1016/0095-8956(91)90061-N
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph minors. XXII. Irrelevant vertices in linkage problems, preprint, 1992.
DOI : 10.1006/jctb.1999.1919
URL : http://doi.org/10.1006/jctb.1999.1919

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 : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph Minors. XVI. Excluding a non-planar graph, Journal of Combinatorial Theory, Series B, vol.89, issue.1, pp.1-27, 1999.
DOI : 10.1016/S0095-8956(03)00042-X
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004.
DOI : 10.1016/j.jctb.2004.08.001
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph minors. XXI. Graphs with unique linkages, Journal of Combinatorial Theory, Series B, vol.99, issue.3, pp.583-616, 2009.
DOI : 10.1016/j.jctb.2008.08.003
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph minors XXIII. Nash-Williams' immersion conjecture, Journal of Combinatorial Theory, Series B, vol.100, issue.2, pp.181-205, 2010.
DOI : 10.1016/j.jctb.2009.07.003
URL : http://doi.org/10.1006/jctb.1999.1919

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

J. Rué, I. Sau, and D. M. Thilikos, Dynamic programming for graphs on surfaces, Automata, Languages and Programming, 37th International Colloquium, pp.372-383, 2010.

J. Rué, K. S. Stavropoulos, and D. M. Thilikos, Outerplanar Obstructions for the Feedback Vertex Set, Electronic Notes in Discrete Mathematics, vol.34, pp.167-171, 2009.
DOI : 10.1016/j.endm.2009.07.028

P. Scheffler, A practical linear time algorithm for disjoint paths in graphs with bounded tree-width, 1994.

A. Takahashi, S. Ueno, and Y. Kajitani, Minimal acyclic forbidden minors for the family of graphs with bounded path-width, Graph theory and applications (Hakone, pp.293-304, 1990.
DOI : 10.1016/0012-365X(94)90092-2

D. M. Thilikos, Algorithms and obstructions for linear-width and related search parameters, Discrete Applied Mathematics, vol.105, issue.1-3, pp.239-271, 2000.
DOI : 10.1016/S0166-218X(00)00175-X

J. Van-leeuwen, Graph algorithms In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), pp.525-631, 1990.

J. M. Van-rooij, H. L. Bodlaender, and P. Rossmanith, Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution, ESA 121. K. Wagner. ¨ Uber eine eigenschaft der ebenen komplexe, pp.566-577570, 1007.
DOI : 10.1007/978-3-642-04128-0_51

A. Weiss, Girths of bipartite sextet graphs, Combinatorica, vol.12, issue.2-3, pp.241-245, 1984.
DOI : 10.1007/BF02579225