@inproceedings{JonesLRamanujanSS13,
 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/conf/esa/JonesLRSS13},
 booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
 doi = {10.1007/978-3-642-40450-4_57},
 pages = {671–682},
 timestamp = {Wed, 21 Aug 2013 12:35:01 +0200},
 title = {Parameterized Complexity of Directed Steiner Tree on Sparse Graphs},
 url = {http://dx.doi.org/10.1007/978-3-642-40450-4_57},
 year = {2013}
}