J. Baste and I. Sau, The role of planarity in connectivity problems parameterized by treewidth. CoRR, abs, 1312.
URL : https://hal.archives-ouvertes.fr/dumas-00854884

H. L. Bodlaender, M. Cygan, S. Kratsch, and J. Nederlof, Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth, Proc. of the 40th International Colloquium on Automata, Languages, and Programming (ICALP), p.196207, 2013.

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of nite graphs, Information and Computation, vol.85, issue.1, p.1275, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00353765

. Wojtaszczyk, Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, Proc. of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), p.150159, 2011.

V. G. Deineko, G. Steiner, and Z. Xue, Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices, Journal of Combinatorial Optimization, vol.8, issue.4, 2005.
DOI : 10.1007/s10878-005-1778-8

F. Dorn, F. V. Fomin, and D. M. Thilikos, Fast Subexponential Algorithm for Nonlocal Problems on Graphs of Bounded Genus, Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT), p.172183, 2006.

F. Dorn, F. V. Fomin, and D. M. Thilikos, Catalan structures and dynamic programming in H-minor-free graphs, Journal of Computer and System Sciences, vol.78, issue.5, p.16061622, 2012.
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, Ecient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions, Algorithmica, vol.58, issue.3, p.790810, 2010.

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

F. V. Fomin, D. Lokshtanov, and S. Saurabh, Ecient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. CoRR, abs/1304, 2013.

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), p.512530, 2001.
DOI : 10.1109/SFCS.1998.743516
URL : http://doi.org/10.1006/jcss.2001.1774

T. Kloks, C. Lee, and J. Liu, New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs, Proc. of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2573 of LNCS, p.282295, 2002.
DOI : 10.1007/3-540-36379-3_25

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), p.777789, 2011.
DOI : 10.1137/1.9781611973082.61

D. Lokshtanov, D. Marx, and S. Saurabh, Lower bounds based on the exponential time hypothesis, Bulletin of the EATCS, vol.105, p.4172, 2011.

D. Lokshtanov, D. Marx, and S. Saurabh, Slightly Superexponential Parameterized Problems, Proc. of the 22nd annual ACM-SIAM Symposium on Discrete algorithms (SODA), p.760776, 2011.
DOI : 10.1137/1.9781611973082.60
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.724

M. Pilipczuk, Problems Parameterized by Treewidth Tractable in Single Exponential Time: A??Logical Approach, Proc. of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS), p.520531, 2011.
DOI : 10.1007/978-3-642-22993-0_47

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

J. Rué, I. Sau, and D. M. Thilikos, Dynamic programming for graphs on surfaces, ACM Transactions on Algorithms (TALG). Short version in the Proc. of ICALP'10, 2011.

J. Rué, I. Sau, and D. M. Thilikos, Dynamic Programming for H-minor-free Graphs, Proc. of the 18th Annual International Conference on Computing and Combinatorics (COCOON), p.8697, 2012.

P. Scheer, A practical linear time algorithm for disjoint paths in graphs with bounded tree-width, Fachbereich 3 Mathematik, 1994.