J. Bang-jensen and G. Gregory, Classes of Directe Graphs, Springer Monographs in Mathematics, 2008.

U. Bertele and F. Brioschi, Nonserial Dynamic Programming, 1972.

H. L. Bodlaender, Treewidth: characterizations, applications, and computations, Proc. of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.4271, pp.1-14, 2006.

A. Bondy and M. R. Murty, Graph Theory, 2008.

N. Bousquet, J. Daligault, and S. Thomass, Multicut is fpt, SIAM Journal on Computing, vol.47, pp.166-207, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-00741933

A. Cayley, On the analytical forms called trees. Second part, Cambridge Library Collection -Mathematics, vol.4, p.112115, 2009.

C. Chekuri and J. Chuzhoy, Polynomial bounds for the grid-minor theorem, Journal of the ACM, vol.63, 2016.

R. Chitnis, M. Hajiaghayi, and D. Marx, Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset, Proc. of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1713-1725, 2012.

W. Cook and P. D. Seymour, Tour merging via branch-decompositions, INFORMS Journal on Computing, vol.15, pp.233-248, 2003.

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

M. Cygan, F. V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx et al., Parameterized Algorithms, 2015.

D. Demaine, M. V.-fomin, D. M. Hajiaghayi, and . Thilikos, Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, Journal of the ACM, vol.52, pp.866-893, 2005.

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity, Texts in Computer Science, 2013.

R. F. Erbacher, T. Jaeger, N. Talele, and J. Teutsch, Directed multicut with linearly ordered terminals, 2014.

M. Grohe, D. K.-i.-kawarabayashi, P. Marx, and . Wollan, Finding topological subgraphs is fixedparameter tractable, Proc. of the 43rd Annual ACM Symposium on Theory of Computing (STOC), pp.479-488, 2011.

R. Halin, S-functions for graphs, Journal of Geometry, vol.8, pp.171-186, 1976.

T. Johnson, N. Robertson, P. D. Seymour, and R. Thomas, Directed tree-width, Journal of Combinatorial Theory, Series B, vol.82, pp.138-154, 2001.

K. Kawarabayashi and S. Kreutzer, The Directed Grid Theorem, Proc. of the 47th Annual ACM Symposium on Theory of Computing (STOC), pp.655-664, 2015.

J. M. Kleinberg, Decision algorithms for unsplittable flow and the half-disjoint paths problem, Proc. of the 30th Annual ACM Symposium on Theory of Computing (STOC), pp.530-539, 1998.

A. Koster, S. Van-hoesel, and A. Kolen, Solving frequency assignment problems via tree-decomposition, Electronic Notes in Discrete Mathematics, vol.3, pp.102-105, 1999.

S. Kratsch, M. Pilipczuk, M. Pilipczuk, and M. Wahlstrm, Fixed-parameter tractability of multicut in directed acyclic graphs, SIAM Journal on Discrete Mathematics, vol.29, pp.122-144, 2015.

D. Marx and I. Razgon, Fixed-parameter tractability of multicut parameterized by the size of the cutset, SIAM Journal on Computing, vol.43, pp.355-388, 2014.

D. Matthias and F. Emmert-streib, Quantitative Graph Theory, Discrete Mathematics and its Applications, 2014.

M. Pilipczuk and M. Wahlström, Directed multicut is w[1]-hard, even for four terminal pairs, ACM Transactions on Computation Theory, vol.10, 2018.

B. Reed, Introducing directed tree-width, Electronic Notes in Discrete Mathematics, vol.3, pp.222-229, 1999.

N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, pp.92-114, 1986.

N. Robertson and P. D. Seymour, Graph minors. XIII. The disjoint paths problem, Journal of Combinatorial Theory, Series B, vol.63, pp.65-110, 1995.

P. D. Seymour and R. Thomas, Graph searching and a min-max theorem for tree-width, Journal of Combinatorial Theory, Series B, vol.58, pp.22-33, 1993.