%0 Conference Paper %1 conf/stacs/EibenKPS19 %A Eiben, Eduard %A Knop, Dusan %A Panolan, Fahad %A Suchý, Ondrej %B STACS %D 2019 %E Niedermeier, Rolf %E Paul, Christophe %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 25:1-25:17 %T Complexity of the Steiner Network Problem with Respect to the Number of Terminals. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2019.html#EibenKPS19 %V 126 %@ 978-3-95977-100-9

@inproceedings{conf/stacs/EibenKPS19, added-at = {2019-12-27T00:00:00.000+0100}, author = {Eiben, Eduard and Knop, Dusan and Panolan, Fahad and Suchý, Ondrej}, biburl = {https://www.bibsonomy.org/bibtex/2e60c2cb6802dbc20f8128a1b4f19cd68/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2019}, editor = {Niedermeier, Rolf and Paul, Christophe}, ee = {https://doi.org/10.4230/LIPIcs.STACS.2019.25}, interhash = {978bc0e95c44fd964655461eb3a409b6}, intrahash = {e60c2cb6802dbc20f8128a1b4f19cd68}, isbn = {978-3-95977-100-9}, keywords = {dblp}, pages = {25:1-25:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:48:08.000+0100}, title = {Complexity of the Steiner Network Problem with Respect to the Number of Terminals.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2019.html#EibenKPS19}, volume = 126, year = 2019 }