Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki. Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. In Alok Aggarwal, C. Pandu Rangan, editors, Algorithms and Computation, 10th International Symposium, ISAAC 99, Chennai, India, December 16-18, 1999, Proceedings. Volume 1741 of Lecture Notes in Computer Science, pages 337-346, Springer, 1999. [doi]
@inproceedings{KusakariMN99,
title = {Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs},
author = {Yoshiyuki Kusakari and Daisuke Masubuchi and Takao Nishizeki},
year = {1999},
url = {http://link.springer.de/link/service/series/0558/bibs/1741/17410337.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KusakariMN99},
cites = {0},
citedby = {0},
pages = {337-346},
booktitle = {Algorithms and Computation, 10th International Symposium, ISAAC 99, Chennai, India, December 16-18, 1999, Proceedings},
editor = {Alok Aggarwal and C. Pandu Rangan},
volume = {1741},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66916-7},
}