N. Alon, R. Yuster, and U. Zwick, Color-coding, Journal of the ACM, vol.42, issue.4, pp.844-856, 1995.
DOI : 10.1145/210332.210337

B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM, vol.41, issue.1, pp.153-180, 1994.
DOI : 10.1145/174644.174650

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

K. Buchin, C. Knauer, K. Kriegel, A. Schulz, and R. Seidel, On the Number of Cycles in Planar Graphs, Proc. of the 13th Annual International Conference on Computing and Combinatorics (COCOON'07), pp.97-107, 2007.
DOI : 10.1007/978-3-540-73545-8_12

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

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

E. D. Demaine and M. T. Hajiaghayi, The Bidimensionality Theory and Its Algorithmic Applications, The Computer Journal, vol.51, issue.3, pp.292-302, 2008.
DOI : 10.1093/comjnl/bxm033

E. D. Demaine, M. T. Hajiaghayi, and K. Kawarabayashi, Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.637-646, 2005.
DOI : 10.1109/SFCS.2005.14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.5749

F. Dorn, F. V. Fomin, and D. M. Thilikos, Catalan structures and dynamic programming on Hminor-free graphs, Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.631-640, 2008.

F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, 2009.

D. Eppstein, Subgraph isomorphism in planar graphs and related problems, J. Graph Alg. and Appl, vol.3, pp.1-27, 1999.

D. Eppstein, Diameter and Treewidth in Minor-Closed Graph Families, Algorithmica, vol.27, issue.3, 2009.
DOI : 10.1007/s004530010020

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

F. V. Fomin and D. M. Thilikos, New upper bounds on the decomposability of planar graphs, Journal of Graph Theory, vol.14, issue.1, pp.53-81, 2006.
DOI : 10.1002/jgt.20121

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

J. E. Hopcroft and J. K. Wong, Linear time algorithm for isomorphism of planar graphs (Preliminary Report), Proceedings of the sixth annual ACM symposium on Theory of computing , STOC '74, pp.172-184, 1974.
DOI : 10.1145/800119.803896

Z. Li and S. Nakano, Efficient Generation of Plane Triangulations without Repetitions, Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01), pp.433-443, 2001.
DOI : 10.1007/3-540-48224-5_36

R. Niedermeier, Invitation to fixed-parameter algorithms, of Oxford Lecture Series in Mathematics and its Applications, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

D. Osthus, H. J. Prömel, and A. Taraz, On random planar graphs, the number of planar graphs and their triangulations, Journal of Combinatorial Theory, Series B, vol.88, issue.1, pp.119-134, 2003.
DOI : 10.1016/S0095-8956(02)00040-0

J. Plehn and B. Voigt, Finding minimally weighted subgraphs, Proc. of the 16th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'90), pp.18-29, 1990.
DOI : 10.1007/3-540-53832-1_28

N. Robertson, P. 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

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.43-76, 2003.
DOI : 10.1016/S0095-8956(03)00042-X
URL : http://doi.org/10.1006/jctb.1999.1919

H. Tamaki, A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs, Proc. of the 11th Annual European Symposium on Algorithms (ESA'03), pp.765-775, 2003.
DOI : 10.1007/978-3-540-39658-1_68

W. T. Tutte, A census of planar triangulations, Canad, J. Math, vol.14, pp.21-38, 1962.