A. , I. Dorn, F. Fomin, F. V. Sau, I. And-thilikos et al., Faster Parameterized Algorithms for Minor Containment, 12th Scandinavian Workshop on Algorithm Theory (SWAT). LNCS Series, pp.322-333, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00736522

A. , V. And, and P. Mukhopadhyay, Derandomizing the isolation lemma and lower bounds for circuit size, Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques. APPROX '08 / RANDOM '08, pp.276-289, 2008.

C. , S. And-mohar, and B. , Finding shortest non-separating and non-contractible cycles for topologically embedded graphs, Discrete and Computational Geometry, vol.37, pp.213-235, 2007.

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

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

D. , E. D. Fomin, F. V. Hajiaghayi, M. T. And-thilikos, and D. M. , 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.

D. , E. D. Hajiaghayi, M. And-thilikos, and D. M. , The Bidimensional Theory of Bounded-Genus Graphs, SIAM Journal on Discrete Mathematics, vol.20, issue.2, pp.357-371, 2006.

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

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

D. , F. Fomin, F. V. And-thilikos, and D. M. , Catalan structures and dynamic programming in H-minorfree graphs, 19th annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp.631-640, 2008.

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

D. , R. G. And, and M. R. Fellows, Parameterized Complexity, 1999.

F. , P. And, and R. Sedgewick, Analytic Combinatorics, 2008.

F. , J. And, and M. Grohe, Parameterized Complexity Theory, 2006.

F. , F. V. And-thilikos, and D. M. , Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up, 31st International Colloquium on Automata, Languages and Programming (ICALP), pp.581-592, 2004.

F. , F. V. And-thilikos, and D. M. , Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed- Up, SIAM Journal on Computing, vol.36, issue.2, pp.281-309, 2006.

F. , F. V. And-thilikos, and D. M. , On Self Duality of Pathwidth in Polyhedral Graph Embeddings, Journal of Graph Theory, vol.55, pp.42-54, 2007.

H. , M. R. Rao, S. And-gabow, and H. N. , Computing Vertex Connectivity: New Bounds from Old Techniques, Journal of Algorithms, vol.34, issue.2, pp.222-250, 2000.

I. , R. Paturi, R. And-zane, and F. , Which Problems Have Strongly Exponential Complexity, Journal of Computer and System Sciences, vol.63, issue.4, pp.512-530, 1998.

K. , K. Mohar, B. And-reed, and B. , A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width, Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.771-780, 2008.

L. , D. Marx, D. And-saurabh, and S. , Known algorithms on graphs of bounded treewidth are probably optimal, 22st ACM?SIAM Symposium on Discrete Algorithms, pp.777-789, 2011.

L. , D. Marx, D. And-saurabh, and S. , Slightly superexponential parameterized problems, 22st ACM?SIAM Symposium on Discrete Algorithms, pp.760-776, 2011.

M. , B. And, and C. Thomassen, Graphs on surfaces, 2001.

M. , K. Vazirani, U. V. And-vazirani, and V. V. , Matching is as easy as matrix inversion, Proceedings of the nineteenth annual ACM symposium on Theory of computing. STOC '87, pp.345-354, 1987.

R. , N. Seymour, and P. D. , Graph minors. X. Obstructions to Tree-decomposition, J. Combin. Theory Series B, vol.52, issue.2, pp.153-190, 1991.

R. , N. Seymour, and P. D. , Graph minors. XII. Distance on a surface, J. Combin. Theory Series B, vol.64, pp.240-272, 1995.

R. , N. Seymour, and P. D. , Graph minors. XVI. Excluding a non-planar graph, J. Combin. Theory Series B, vol.77, pp.1-27, 1999.

R. , J. Sau, I. And-thilikos, and D. M. , Asymptotic enumeration of non-crossing partitions on surfaces. Manuscript submitted for publication, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00804780

R. , J. Sau, I. And-thilikos, and D. M. , Dynamic programming for minor-free graphs, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00736708

S. , I. And-thilikos, and D. M. , Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs, Journal of Discrete Algorithms, vol.8, issue.3, pp.330-338, 2010.

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

T. , J. A. And, and A. Proskurowski, Algorithms for vertex partitioning problems on partial k-trees, SIAM Journal on Discrete Mathematics, vol.10, issue.4, pp.529-550, 1997.