- G. Das, P. J. Heffernan, and G. Narasimhan. Finding all
weakly-visible chords of a polygon in linear time. Nordic
Journal of Computing, 1(4):433-457, Winter 1994.
Abstract,
References,
etc.
- Joachim Gudmundsson, Christos Levcopoulos, and Giri Narasimhan. Approximating
a Minimum Manhattan Network. Nordic Journal of Computing,
8(2):219-232, Summer 2001.
Abstract,
References,
etc.
Shortcuts: