Barton, N. H., &; Clark, A. (1990). Population structure and processes in evolution. In K. Wöhrmann &; S. Jain (Eds.), Population biology: Ecological and evolutionary viewpoints (pp. 115–174). Springer.https://doi.org/10.1007/978-3-642-74474-7_5 

Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., &; Welzl, E. (1989). Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187742 

Yao, F., Dobkin, D., Edelsbrunner, H., &; Paterson, M. (1989). Partitioning space for range queries. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0218025 

Edelsbrunner, H., Rote, G., &; Welzl, E. (1989). Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/0304-3975(89)90133-3 

Edelsbrunner, H., Preparata, F., &; West, D. (1989). Tetrahedrizing point sets in three dimensions. In https://doi.org/10.1007/3-540-51084-2_31__International Symposium on Symbolic and Algebraic Computation (Vol. 358, pp. 315–331). Rome, Italy: Springer.https://doi.org/10.1007/3-540-51084-2_31 

Jonas, P. M. (1989). Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. Springer.https://doi.org/10.1007/BF01870958 

Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R., &; Sharir, M. (1988). Arrangements of curves in the plane - topology, combinatorics, and algorithms. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 214–229). Tampere, Finland: Springer.https://doi.org/10.1007/3-540-19488-6_118 

Edelsbrunner, H. (1988). Geometric structures in computational geometry. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 201–213). Tampere, Finland: Springer.https://doi.org/10.1007/3-540-19488-6_117 

Edelsbrunner, H., &; Skiena, S. (1988). Probing convex polygons with X-Rays. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0217054  

Barton, N. H. (1988). Speciation. In A. Myers &; P. Giller (Eds.), Analytical biogeography: An integrated approach to the study of animal and plant distributions (1st ed., pp. 185–218). Springer.https://doi.org/10.1007/978-94-009-0435-4 

Chazelle, B., &; Edelsbrunner, H. (1987). Linear space data structures for two types of range search. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187875 

Edelsbrunner, H. (1987). Algorithms in Combinatorial Geometry (Vol. 10). Berlinf; Heidelberg: Springer.https://doi.org/10.1007/978-3-642-61568-9 

Edelsbrunner, H., Guibas, L., &; Stolfi, J. (1986). Optimal point location in a monotone subdivision. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215023 

Edelsbrunner, H., &; Welzl, E. (1986). On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(86)90078-6 

Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. Algorithmica. Springer.https://doi.org/10.1007/BF01840438 

Edelsbrunner, H., &; Stöckl, G. (1986). The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(86)90075-0 

Edelsbrunner, H., &; Haussler, D. (1986). The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. Elsevier.https://doi.org/10.1016/0012-365X(86)90008-7 

Edelsbrunner, H., &; Overmars, M. (1985). Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. Elsevier.https://doi.org/10.1016/0196-6774(85)90030-6 

Edelsbrunner, H., &; Maurer, H. (1985). Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. Elsevier.https://doi.org/10.1016/0020-0190(85)90107-3 

Chazelle, B., &; Edelsbrunner, H. (1985). Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/S0747-7171(85)80028-6