S. Saeed-akhoondian-amiri, D. Kreutzer, R. Marx, and . Rabinovich, Routing with congestion in acyclic digraphs, Information Processing Letters, vol.151, 2019.

J. Araújo, A. Victor, C. Campos, G. C. Vinícius, V. Lima et al., Dual Parameterization of Weighted Coloring, Proc. of the 13th International Symposium on Parameterized and Exact Computation, vol.115, pp.1-12, 2018.

M. Basavaraju, M. C. Francis, M. S. Ramanujan, and S. Saurabh, Partially polynomial kernels for set cover and test cover, SIAM Journal on Discrete Mathematics, vol.30, issue.3, pp.1401-1423, 2016.

N. Khristo and . Boyadzhiev, Close Encounters with the Stirling Numbers of the Second Kind, Mathematics Magazine, vol.85, issue.4, pp.252-266, 2012.

M. Rajesh-hemant-chitnis, D. Hajiaghayi, and . Marx, Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset, SIAM Journal on Computing, vol.42, issue.4, pp.1674-1696, 2013.

B. Chor, M. Fellows, and D. W. Juedes, Linear Kernels in Linear Time, or How to Save k Colors in O(n 2 ) Steps, Proc. of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.3353, pp.257-269, 2004.

M. Cygan, V. Fedor, L. Fomin, D. Kowalik, D. Lokshtanov et al., Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms, 2015.

M. Cygan, D. Marx, M. Pilipczuk, and M. Pilipczuk, The Planar Directed k-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable, Proc. of the IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), vol.1, pp.197-206, 2013.

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

M. Rong-chii-duh and . Fürer, Approximation of k-Set Cover by Semi-Local Optimization, Proc. of the 29th Annual ACM Symposium on the Theory of Computing (STOC), pp.256-264, 1997.

K. Edwards, I. Muzi, and P. Wollan, Half-integral linkages in highly connected directed graphs, Proc. of the 25th Annual European Symposium on Algorithms (ESA, vol.36, pp.1-36, 2017.

A. E. Feldmann and D. Marx, The complexity landscape of fixed-parameter directed Steiner network problems, Proc. of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), vol.55, pp.1-27, 2016.

S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.90009-90011, 1980.

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

M. Jones, D. Lokshtanov, and M. S. Ramanujan, Saket Saurabh, and Ond?ej Suchý. Parameterized Complexity of Directed Steiner Tree on Sparse Graphs, SIAM Journal on Discrete Mathematics, vol.31, issue.2, pp.1294-1327, 2017.

K. Kawarabayashi, Y. Kobayashi, and S. Kreutzer, An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem, Proc. of the 46th ACM Symposium on Theory of Computing (STOC), pp.70-78, 2014.

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.

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

J. F. Lynch, The equivalence of theorem proving and the interconnection problem, ACM SIGDA Newsletter, vol.5, issue.3, pp.31-36, 1975.

K. Menger, Zur allgemeinen kurventheorie, Fundamenta Mathematicae, vol.10, issue.1, pp.96-115, 1927.

D. Mölle, S. Richter, and P. Rossmanith, Enumerate and expand: improved algorithms for connected vertex cover and tree cover. Theory of Computing Systems, vol.43, pp.234-253, 2008.

M. Pilipczuk, M. Pilipczuk, P. Sankowski, and E. J. Van-leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, ACM Transactions on Algorithms, vol.14, issue.4, 2018.

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

A. Schrijver, Finding k disjoint paths in a directed planar graph, SIAM Journal on Computing, vol.23, issue.4, pp.780-788, 1994.

A. Slivkins, Parameterized tractability of edge-disjoint paths on directed acyclic graphs, SIAM Journal on Discrete Mathematics, vol.24, issue.1, pp.146-157, 2010.

C. Thomassen, Highly connected non-2-linked digraphs, Combinatorica, vol.11, issue.4, pp.393-395, 1991.