F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for range queries,” SIAM Journal on Computing, vol. 18, no. 2. SIAM, pp. 371–384, 1989.

H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for shortest tours and optimal factors in the plane,” Theoretical Computer Science, vol. 66, no. 2. Elsevier, pp. 157–180, 1989.

H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” in  International Symposium on Symbolic and Algebraic Computation, Rome, Italy, 1989, vol. 358, pp. 315–331.

H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” in Proceedings of the 5th annual symposium on Computational geometry, Saarbruchen, Germany, 1989, pp. 145–151.

H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight bounds on the number of faces ,” Discrete &; Computational Geometry, vol. 4, no. 4. Springer, pp. 337–343, 1989.

M. Slatkin and N. H. Barton, “A comparison of three methods for estimating average levels of gene flow,” Evolution; International Journal of Organic Evolution, vol. 43, no. 7. Wiley-Blackwell, pp. 1349–1368, 1989.

P. M. Jonas, M. Bräu, M. Hermsteiner, and W. Vogel, “Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels,” PNAS, vol. 86, no. 18. National Academy of Sciences, pp. 7238–7242, 1989.

P. M. Jonas, “Temperature dependence of gating current in myelinated nerve fibers,” Journal of Membrane Biology, vol. 112, no. 3. Springer, pp. 277–289, 1989.

H. Edelsbrunner, “Spatial triangulations with dihedral angle conditions,” presented at the International Workshop on Discrete Algorithms and Complexity, 1989, pp. 83–89.

H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise linear functions: Algorithms and applications,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 311–336, 1989.

H. Edelsbrunner, N. Hasan, R. Seidel, and X. Shen, “Circles through two points that always enclose many points,” Geometriae Dedicata, vol. 32, no. 1. Springer, pp. 1–12, 1989.

H. Edelsbrunner and S. Skiena, “On the number of furthest neighbor pairs in a point set,” American Mathematical Monthly, vol. 96, no. 7. Mathematical Association of America, pp. 614–618, 1989.

B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential stratification scheme for real semi-algebraic varieties and its applications,” in 16th International Colloquium on Automata, Languages, and Programming, Stresa, Italy, 1989, vol. 372, pp. 179–193.

B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 139–181, 1989.

N. H. Barton, “The divergence of a polygenic system under stabilising selection, mutation and drift,” Genetical Research, vol. 54, no. 1. Cambridge University Press, pp. 59–78, 1989.

N. H. Barton and M. Turelli, “Evolutionary quantitative genetics: how little do we know?,” Annual Review of Genetics, vol. 23. Annual Reviews, pp. 337–370, 1989.

N. H. Barton, “Founder effect speciation,” in Speciation and its consequences, D. Otte and J. Endler, Eds. Sinauer Press, 1989.

R. Alur and T. A. Henzinger, “A really temporal logic,” in 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, USA, 1989, pp. 164–169.