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.
Abstract is missing.