Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract). - Paul J. Heffernan; Joseph S. B. Mitchell (SCG, 1990)

The Translation Square Map and Approximate Congruence. - Paul J. Heffernan (Inf. Process. Lett., 1991)

Optimally Sparse Spanners in 3-Dimensional Euclidean Space. - Gautam Das 001; Paul J. Heffernan; Giri Narasimhan (SCG, 1993)

Generalized Approzimate Algorithms for Point Set Congruence. - Paul J. Heffernan (WADS, 1993)

Linear-time Algorithms for Weakly-monotone Polygons. - Paul J. Heffernan (Comput. Geom., 1993)

Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). - Gautam Das 001; Paul J. Heffernan; Giri Narasimhan (SWAT, 1994)

Approximate Decision Algorithms for Point Set Congruence. - Paul J. Heffernan; Stefan Schirra (Comput. Geom., 1994)

Finding all Weakly-Visible Chords of a Polygon in Linear Time. - Gautam Das 001; Paul J. Heffernan; Giri Narasimhan (Nord. J. Comput., 1994)

An Optimal Algorithm for Computing Visibility in the Plane. - Paul J. Heffernan; Joseph S. B. Mitchell (SIAM J. Comput., 1995)

An optimal algorithm for the two-guard problem. - Paul J. Heffernan (Int. J. Comput. Geom. Appl., 1996)

Constructing Degree-3 Spanners with Other Sparseness Properties. - Gautam Das 001; Paul J. Heffernan (Int. J. Found. Comput. Sci., 1996)

LR-visibility in Polygons. - Gautam Das 001; Paul J. Heffernan; Giri Narasimhan (Comput. Geom., 1997)

Two-Guard Walkability of Simple Polygons. - L. H. Tseng; Paul J. Heffernan; D. T. Lee (Int. J. Comput. Geom. Appl., 1998)