Complexity of the Steiner Network Problem with Respect to the Number of Terminals - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Eduard Eiben' in GoogleThis author has not been identified. Look up 'Dusan Knop' in GoogleThis author has not been identified. Look up 'Fahad Panolan' in GoogleThis author has not been identified. Look up 'Ondrej Suchý' in Google

runs on WebDSL