Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen. Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. In Natacha Portier, Thomas Wilke, editors, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany. Volume 20 of LIPIcs, pages 353-364, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. [doi]
@inproceedings{PilipczukPSL13,
title = {Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs},
author = {Marcin Pilipczuk and Michal Pilipczuk and Piotr Sankowski and Erik Jan van Leeuwen},
year = {2013},
doi = {10.4230/LIPIcs.STACS.2013.353},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2013.353},
researchr = {https://researchr.org/publication/PilipczukPSL13},
cites = {0},
citedby = {0},
pages = {353-364},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany},
editor = {Natacha Portier and Thomas Wilke},
volume = {20},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-50-7},
}