Dániel Marx. The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk). In Rasmus Pagh, editor, 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland. Volume 53 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{Marx16,
title = {The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk)},
author = {Dániel Marx},
year = {2016},
doi = {10.4230/LIPIcs.SWAT.2016.32},
url = {http://dx.doi.org/10.4230/LIPIcs.SWAT.2016.32},
researchr = {https://researchr.org/publication/Marx16},
cites = {0},
citedby = {0},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland},
editor = {Rasmus Pagh},
volume = {53},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-011-8},
}