Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý. Complexity of the Steiner Network Problem with Respect to the Number of Terminals. In Rolf Niedermeier, Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany. Volume 126 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]
@inproceedings{EibenKPS19,
title = {Complexity of the Steiner Network Problem with Respect to the Number of Terminals},
author = {Eduard Eiben and Dusan Knop and Fahad Panolan and Ondrej Suchý},
year = {2019},
doi = {10.4230/LIPIcs.STACS.2019.25},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.25},
researchr = {https://researchr.org/publication/EibenKPS19},
cites = {0},
citedby = {0},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany},
editor = {Rolf Niedermeier and Christophe Paul},
volume = {126},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-100-9},
}