@article{MarkJonesLRamanujanSS17,
 author = {Mark Jones and
Daniel Lokshtanov and
M. S. Ramanujan and
Saket Saurabh and
Ondrej Suchý},
 bibsource = {dblp computer science bibliography, http://dblp.org},
 biburl = {http://dblp.uni-trier.de/rec/bib/journals/siamdm/JonesLRSS17},
 doi = {10.1137/15M103618X},
 journal = {{SIAM} J. Discrete Math.},
 number = {2},
 pages = {1294–1327},
 timestamp = {Wed, 05 Jul 2017 14:44:19 +0200},
 title = {Parameterized Complexity of Directed Steiner Tree on Sparse Graphs},
 url = {https://doi.org/10.1137/15M103618X},
 volume = {31},
 year = {2017}
}