Sequence and expression of a metabotropic glutamate receptor
M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, S. Nakanishi, Nature 349 (1991) 760–765.

Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel
S. Nakanishi, H. Ohkubo, A. Kakizuka, Y. Yokota, R. Shigemoto, Y. Sasai, T. Takumi, in:, Recent Progress in Hormone Research, The Endocrine Society, 1991, pp. 59–83.

A hyperplane incidence problem with applications to counting distances
H. Edelsbrunner, M. Sharir, in:, Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, American Mathematical Society, 1991, pp. 253–263.

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.

On the zone theorem for hyperplane arrangements
H. Edelsbrunner, R. Seidel, M. Sharir, in:, Springer, 1991, pp. 108–123.

Ray shooting in polygons using geodesic triangulations
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, in:, 18th International Colloquium on Automata, Languages and Programming, Springer, 1991, pp. 661–673.

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

Pleiotropic models of quantitative variation
N.H. Barton, Genetics 124 (1990) 773–782.

A hyperplane Incidence problem with applications to counting distances
H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.

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.

The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 161–196.

Covering convex sets with non-overlapping polygons
H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.

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.

 Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.

Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.

Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.

Population structure and processes in evolution
N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.

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.

Partitioning space for range queries
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.

Testing the necklace condition for shortest tours and optimal factors in the plane
H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.