Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. Pilipczuk, M., Pilipczuk, M., Sankowski, P., & Jan van Leeuwen, E. In Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS), pages 353-364, 2013.
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs [link]Paper  bibtex   
@inproceedings{ dblp2498055,
  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},
  author_short = {Pilipczuk, M. and Pilipczuk, M. and Sankowski, P. and Jan van Leeuwen, E.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2013},
  key = {dblp2498055},
  id = {dblp2498055},
  biburl = {http://www.dblp.org/rec/bibtex/conf/stacs/PilipczukPSL13},
  url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2013.353},
  conference = {STACS},
  pages = {353-364},
  text = {STACS 2013:353-364},
  booktitle = {Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS)}
}

Downloads: 0