G. Andrews, The Theory of Partitions, 1984.

S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability -a survey, BIT, vol.25, issue.1, pp.2-23, 1985.

V. Arvind and P. Mukhopadhyay, Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size, Proc. of APPROX-RANDOM, vol.5171, pp.276-289, 2008.

H. L. Bodlaender, Dynamic programming on graphs with bounded treewidth, Proc. of the 15th International Colloquium on Automata, Languages and Programming (ICALP), vol.317, pp.105-118, 1988.

P. Bonsma, Surface split decompositions and subgraph isomorphism in graphs on surfaces, Proc. of STACS, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00678193

L. Cai and D. W. Juedes, On the existence of subexponential parameterized algorithms, Journal of Computer and System Sciences, vol.67, issue.4, pp.789-807, 2003.

B. Courcelle, The monadic second-order logic of graphs: definable sets of finite graphs, Proc. of the 14th International Workshop on Graph-theoretic Concepts in Computer Science (WG), vol.344, pp.30-53, 1988.

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

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. T. Hajiaghayi, and K. 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.

F. Dorn, F. V. Fomin, and D. M. Thilikos, Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus, Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT), vol.4059, pp.172-183, 2006.

F. Dorn, F. V. Fomin, and D. M. Thilikos, Subexponential parameterized algorithms, Proc. of the 34th International Colloquium on Automata, Languages and Programming (ICALP), vol.4596, pp.15-27, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00455210

F. Dorn, F. V. Fomin, and D. M. Thilikos, Catalan Structures and Dynamic Programming in H-minor-free Graphs, Proc. of the 19th annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp.631-640, 2008.
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.58, issue.3, pp.790-810, 2010.

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

A. Dress, J. H. Koolen, and V. Moulton, On line arrangements in the hyperbolic plane, European Journal of Combinatorics, vol.23, issue.5, pp.549-557, 2002.

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

M. Grohe and D. Marx, Structure theorem and isomorphism test for graphs with excluded topological subgraphs, 2011.

R. Impagliazzo, R. Paturi, and F. Zane, Which Problems Have Strongly Exponential Complexity?, Journal of Computer and System Sciences, vol.63, issue.4, pp.512-530, 2001.

J. Jonsson, Generalized triangulations and diagonal-free subsets of stack polyominoes, Journal of Combinatorial Theory, Series A, vol.112, issue.1, pp.117-142, 2005.

K. Kawarabayashi and P. Wollan, A simpler algorithm and shorter proof for the graph minor decomposition, Proc. of the 43rd ACM Symposium on Theory of Computing (STOC), pp.451-458, 2011.

K. Kawarabayashi and P. Wollan, A simpler algorithm and shorter proof for the graph minor decomposition, Proc. of the 43rd ACM Symposium on Theory of Computing (STOC), pp.451-458, 2011.

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

D. Lokshtanov, D. Marx, and S. Saurabh, Slightly Superexponential Parameterized Problems, Proc. of the 22nd annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp.760-776, 2011.

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

K. Mulmuley, U. V. Vazirani, and V. V. Vazirani, Matching is as easy as matrix inversion, Combinatorica, vol.7, issue.1, pp.105-113, 1987.

T. Nakamigawa, A generalization of diagonal flips in a convex polygon, Theoretical Computer Science, vol.235, issue.2, pp.271-282, 2000.

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.

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.

N. Robertson and P. D. Seymour, Graph minors. XVI. Excluding a Non-planar Graph, Journal of Combinatorial Theory, Series B, vol.77, pp.1-27, 1999.

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.

J. Rué, I. Sau, and D. M. Thilikos, Asymptotic enumeration of non-crossing partitions on surfaces, the Proc. of ICALP, 2011.

J. Rué, I. Sau, and D. M. Thilikos, Dynamic programming for graphs on surfaces, ACM Transactions on Algorithms (TALG), 2011.

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

S. Tazari, Faster approximation schemes and parameterized algorithms on (odd-)H-minorfree graphs, Theoretical Computer Science, vol.417, pp.95-107, 2012.