Full Citation:
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý. Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discrete Math., volume 31, number 2, pages 1294–1327, 2017.