I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos, Faster Parameterized Algorithms for Minor Containment, Proc. of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), vol.6139, pp.322-333, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00736522

I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos, Fast Minor Testing in Planar Graphs, Proc. of the 18th Annual European Symposium on Algorithms (ESA), vol.6346, pp.97-109, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00904515

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, pp.461-493, 2002.

N. Alon, R. Yuster, and U. Zwick, Color-coding, J. ACM, vol.42, issue.4, pp.844-856, 1995.

B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM, vol.41, pp.153-180, 1994.

H. L. Bodlaender, A. Grigoriev, and A. M. Koster, Treewidth Lower Bounds with Brambles, Algorithmica, vol.51, issue.1, pp.81-98, 2008.

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

E. D. Demaine, M. Hajiaghayi, and . Bidimensionality, , 2008.

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

E. D. Demaine, M. T. Hajiaghayi, and K. I. Kawarabayashi, Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring, Proc. of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.637-646, 2005.

R. Diestel, Graph Theory, vol.173, 2005.

M. Dinneen and L. Xiong, The Feasibility and Use of a Minor Containment Algorithm, Computer Science Technical Reports, vol.171, 2000.

F. Dorn, Planar Subgraph Isomorphism Revisited, Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), pp.263-274, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455215

F. Dorn, F. V. Fomin, and D. M. Thilikos, Subexponential parameterized algorithms, Computer Science Review, vol.2, issue.1, pp.29-39, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00455210

F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, Algorithmica, vol.58, issue.3, pp.790-810, 2010.

R. G. Downey and M. R. Fellows, , 1999.

M. R. Fellows and M. A. Langston, On search, decision and the efficiency of polynomial-time algorithms, J. Comp. Syst. Sc, vol.49, pp.769-779, 1994.

M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979.

Q. Gu and H. Tamaki, Constant-factor approximations of branchdecomposition and largest grid minor of planar graphs in O(n 1+? ) time, Proc. of the 20th International Symposium Algorithms and Computation (ISAAC), pp.984-993, 2009.

Q. P. Gu and H. Tamaki, Improved bound on the planar branchwidth with respect to the largest grid minor size, 2009.

I. V. Hicks, Branch decompositions and minor containment, Networks, vol.43, issue.1, pp.1-9, 2004.

J. E. Hopcroft and J. K. Wong, Linear time algorithm for isomorphism of planar graphs (preliminary report), Proc. of the 6th Annual ACM Symposium on Theory of Computing (STOC), pp.172-184, 1974.

K. I. Kawarabayashi and B. A. Reed, Hadwiger's conjecture is decidable, Proc. of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp.445-454, 2009.

K. I. Kawarabayashi and P. Wollan, A shorter proof of the Graph Minor Algorithm -The Unique Linkage Theorem, Proc. of the 42st Annual ACM Symposium on Theory of Computing (STOC), 2010.

Z. Li and S. Nakano, Efficient generation of plane triangulations without repetitions, Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP), vol.2076, pp.433-443, 2001.

R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem, SIAM J. Comput, vol.9, pp.615-627, 1980.

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

D. Osthus, H. J. Prömel, and A. Taraz, On random planar graphs, the number of planar graphs and their triangulations, J. Comb. Theory, Ser. B, vol.88, issue.1, pp.119-134, 2003.

B. A. Reed and Z. Li, Optimization and Recognition for K5-minor Free Graphs in Linear Time, Proc. of the 8th Latin American Symposium on Theoretical Informatics (LATIN), pp.206-215, 2008.

N. Robertson and P. Seymour, Graph Minors. XIII. The Disjoint Paths Problem, J. Comb. Theory, Ser. B, vol.63, issue.1, pp.65-110, 1995.

N. Robertson, P. Seymour, and R. Thomas, Quickly excluding a planar graph, J. Comb. Theory, Ser. B, vol.62, issue.2, pp.323-348, 1994.

N. Robertson and P. D. Seymour, Graph Minors. XX. Wagner's Conjecture, J. Comb. Theory, Ser. B, vol.92, issue.2, pp.325-357, 2004.

J. Rué, I. Sau, and D. M. Thilikos, Dynamic Programming for Graphs on Surfaces, Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP), vol.6198, pp.372-383, 2010.

D. P. Sanders, On Hamilton cycles in certain planar graphs, J. Graph Theory, vol.21, issue.1, pp.43-50, 1998.

P. D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994.

W. T. Tutte, A census of planar triangulations, Canadian Journal of Mathematics, vol.14, pp.21-38, 1962.

H. Whitney, A theorem on graphs, Annals of Mathematics, vol.32, pp.378-390, 1931.