Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells.
N. Burnashev, A. Khodorova, P.M. Jonas, P. Helm, W. Wisden, H. Monyer, P. Seeburg, B. Sakmann, Science 256 (1992) 1566–1570.

A lower bound on the number of unit distances between the vertices of a convex polygon
H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991) 312–316.

Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete &; Computational Geometry 6 (1991) 407–422.

The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 197–216.

Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete &; Computational Geometry 5 (1990) 99–160.

Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete &; Computational Geometry 4 (1989) 433–466.

Temperature dependence of gating current in myelinated nerve fibers
P.M. Jonas, Journal of Membrane Biology 112 (1989) 277–289.

Speciation
N.H. Barton, in:, A. Myers, P. Giller (Eds.), Analytical Biogeography: An Integrated Approach to the Study of Animal and Plant Distributions, 1st ed., Springer, 1988, pp. 185–218.

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

The number of extreme pairs of finite point-sets in Euclidean spaces
H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.

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