]. I. Adler, S. G. Kolliopoulos, P. K. Krause, D. Lokshtanov, S. Saurabh et al., Tight Bounds for Linkages in Planar Graphs, Proceedings of the 38th International Colloquium on Automata, Languages and Programming, 2011.
DOI : 10.1016/0166-218X(93)E0177-Z

E. Amir, Efficient approximation for triangulation of minimum treewidth, Uncertainty in Artificial Intelligence: Proc. of the Seventeenth Conference (UAI-2001), pp.7-15, 2001.

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, pp.12-75, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00353765

B. Courcelle and M. Mosbah, Monadic second-order evaluations on tree-decomposable graphs, Theoretical Computer Science, vol.109, issue.1-2, pp.49-82, 1993.
DOI : 10.1016/0304-3975(93)90064-Z

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

F. V. Fomin, P. Golovach, and D. M. Thilikos, Contraction Bidimensionality: The Accurate Picture, 17th Annual European Symposium on Algorithms (ESA '09), pp.706-717, 2009.
DOI : 10.1007/978-3-642-04128-0_63

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

M. C. Golumbic, H. Kaplan, and R. Shamir, On the Complexity of DNA Physical Mapping, Advances in Applied Mathematics, vol.15, issue.3, pp.251-261, 1994.
DOI : 10.1006/aama.1994.1009

M. Grohe, K. Kawarabayashi, D. Marx, and P. Wollan, Finding topological subgraphs is fixed-parameter tractable, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, 2011.
DOI : 10.1145/1993636.1993700

P. Heggernes, C. Paul, J. A. Telle, and Y. Villanger, Interval completion with few edges, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.374-381, 2007.
DOI : 10.1145/1250790.1250847

H. Kaplan, R. Shamir, and R. E. Tarjan, Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs, SIAM Journal on Computing, vol.28, issue.5, pp.1906-1922, 1999.
DOI : 10.1137/S0097539796303044

K. Kawarabayashi and P. Wollan, A shorter proof of the graph minor algorithm -the unique linkage theorem, Proc. of the 42nd annual ACM Symposium on Theory of Computing, 2010.

M. R. Kramer and J. Van-leeuven, The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits, Advances in Comp, Research, vol.2, pp.129-146, 1984.

B. A. Reed, N. Robertson, A. Schrijver, and P. D. Seymour, Finding disjoint trees in planar graphs in linear time, Graph structure theory, pp.295-301, 1991.
DOI : 10.1090/conm/147/01180

N. Robertson and P. Seymour, Graph minors. XXII. Irrelevant vertices in linkage problems, preprint, 1992.

N. Robertson and P. Seymour, Graph minors. XXI. Graphs with unique linkages, Journal of Combinatorial Theory, Series B, vol.99, issue.3, pp.583-616, 2009.
DOI : 10.1016/j.jctb.2008.08.003

N. Robertson and P. D. Seymour, Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995.
DOI : 10.1006/jctb.1995.1006

M. Yannakakis, Computing the Minimum Fill-In is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.1, pp.77-79, 1981.
DOI : 10.1137/0602010