Aronov B, Edelsbrunner H, Guibas L, Sharir M. The number of edges of many faces in a line segment arrangement. Combinatorica. 1992;12(3):261-274. doi:10.1007/BF01285815

Burnashev N, Khodorova A, Jonas PM, et al. Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells. Science. 1992;256(5063):1566-1570. doi:10.1126/science.1317970

Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for optimal triangulations. In: Simon I, ed. 1st Latin American Symposium on Theoretical Informatics. Vol 583. Springer; 1992:46-60. doi:10.1007/BFb0023816

Henzinger TA, Manna Z, Pnueli A. What good are digital clocks? In: 19th International Colloquium on Automata, Languages and Programming. Vol 623. Springer; 1992:545-558. doi:10.1007/3-540-55719-9_103

Masu M, Tanabe Y, Tsuchida K, Shigemoto R, Nakanishi S. Sequence and expression of a metabotropic glutamate receptor. Nature. 1991;349(6312):760-765. doi:10.1038/349760a0

Edelsbrunner H, Sharir M. A hyperplane incidence problem with applications to counting distances. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. Vol 4. American Mathematical Society; 1991:253-263.

Edelsbrunner H, Hajnal P. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 1991;56(2):312-316. doi:10.1016/0097-3165(91)90042-F

Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements. In: Vol 555. Springer; 1991:108-123. doi:10.1007/BFb0038185

Chazelle B, Edelsbrunner H, Grigni M, et al. Ray shooting in polygons using geodesic triangulations. In: 18th International Colloquium on Automata, Languages and Programming. Vol 510. Springer; 1991:661-673. doi:10.1007/3-540-54233-7_172

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. 1991;6(1):407-422. doi:10.1007/BF02574698

Barton NH. Pleiotropic models of quantitative variation. Genetics. 1990;124(3):773-782. doi:10.1093/genetics/124.3.773 

Edelsbrunner H, Sharir M. A hyperplane Incidence problem with applications to counting distances. In: Proceedings of the International Symposium on Algorithms. Vol 450. Springer; 1990:419-428. doi:10.1007/3-540-52921-7_91

Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. 1990;5(1):197-216. doi:10.1007/BF02187785

Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete &; Computational Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784

Edelsbrunner H, Robison A, Shen X. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 1990;81(2):153-164. doi:10.1016/0012-365X(90)90147-A

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

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E.10.1145/98524.98567__Euclidean minimum spanning trees and bichromatic closest pairs. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:203-210. doi:10.1145/98524.98567

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

Dobkin D, Edelsbrunner H, Overmars M. Searching for empty convex polygons. Algorithmica. 1990;5(4):561-571. doi:10.1007/BF01840404

Barton NH, Clark A. Population structure and processes in evolution. In: Wöhrmann K, Jain S, eds. Population Biology: Ecological and Evolutionary Viewpoints. Springer; 1990:115-174. doi:10.1007/978-3-642-74474-7_5