Go to the corresponding LIPIcs Volume Portal 
Eiben, Eduard ; Knop, Dusan ; Panolan, Fahad ; Suchý, Ondrej
pdfformat: 

@InProceedings{eiben_et_al:LIPIcs:2019:10264, author = {Eduard Eiben and Dusan Knop and Fahad Panolan and Ondrej Such{\'y}}, title = {{Complexity of the Steiner Network Problem with Respect to the Number of Terminals}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {25:125:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771009}, ISSN = {18688969}, year = {2019}, volume = {126}, editor = {Rolf Niedermeier and Christophe Paul}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10264}, doi = {10.4230/LIPIcs.STACS.2019.25}, annote = {Keywords: Directed Steiner Network, Planar Graphs, Parameterized Algorithms, Bounded Genus, Exponential Time Hypothesis} }
Keywords:  Directed Steiner Network, Planar Graphs, Parameterized Algorithms, Bounded Genus, Exponential Time Hypothesis  
Seminar:  36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)  
Issue Date:  2019  
Date of publication:  12.03.2019 