Evanthia Papadopoulou. ::::k::::-Pairs Non-Crossing Shortest Paths in a Simple Polygon. In Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri, editors, Algorithms and Computation, 7th International Symposium, ISAAC 96, Osaka, Japan, December 16-18, 1996, Proceedings. Volume 1178 of Lecture Notes in Computer Science, pages 305-314, Springer, 1996.
@inproceedings{Papadopoulou96,
title = {::::k::::-Pairs Non-Crossing Shortest Paths in a Simple Polygon},
author = {Evanthia Papadopoulou},
year = {1996},
researchr = {https://researchr.org/publication/Papadopoulou96},
cites = {0},
citedby = {0},
pages = {305-314},
booktitle = {Algorithms and Computation, 7th International Symposium, ISAAC 96, Osaka, Japan, December 16-18, 1996, Proceedings},
editor = {Tetsuo Asano and Yoshihide Igarashi and Hiroshi Nagamochi and Satoru Miyano and Subhash Suri},
volume = {1178},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-62048-6},
}