G. Das

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.
Béla Bollobás, Gautam Das, Dimitrios Gunopulos, and Heikki Mannila. Time-Series Similarity Problems and Well-Separated Geometric Sets. Nordic Journal of Computing, 8(4):409-423, Winter 2001. Abstract, References, etc.