Optimal time bounds for some proximity problems in the plane
A. Aggarwal, H. Edelsbrunner, P. Raghavan, P. Tiwari, Information Processing Letters 42 (1992) 55–60.

A tight lower bound on the size of visibility graphs
H. Edelsbrunner, X. Shen, Information Processing Letters 26 (1987) 61–64.

Zooming by repeated range detection
H. Edelsbrunner, M. Overmars, Information Processing Letters 24 (1987) 413–417.

Halfplanar range search in linear space and O(n0.695) query time
H. Edelsbrunner, E. Welzl, Information Processing Letters 23 (1986) 289–293.

Finding extreme-points in 3-dimensions and solving the post-office problem in the plane
H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.

Polygonal intersection searching
H. Edelsbrunner, H. Maurer, D. Kirkpatrick, Information Processing Letters 14 (1982) 74–79.

On the equivalence of some rectangle problems
H. Edelsbrunner, M. Overmars, Information Processing Letters 14 (1982) 124–127.