Parameterized Complexity of Directed Steiner Tree on Sparse Graphs

Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý. Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discrete Math., 31(2):1294-1327, 2017. [doi]

No reviews for this publication, yet.