H. Edelsbrunner, J. Pach, J. Schwartz, and M. Sharir, “On the lower envelope of bivariate functions and its applications,” in 28th Annual Symposium on Foundations of Computer Science , Los Angeles, CA, USA, 1987, pp. 27–37.
LibreCat: https://research-explorer.ista.ac.at/record/3514
DOI: 10.1109/SFCS.1987.44

N. H. Barton, “The effects of linkage and density-dependent regulation on gene flow,” Heredity, vol. 57. Nature Publishing Group, pp. 415–426, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/3665

H. Edelsbrunner and G. Stöckl, “The number of extreme pairs of finite point-sets in Euclidean spaces,” Journal of Combinatorial Theory Series A, vol. 43, no. 2. Elsevier, pp. 344–349, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

H. Edelsbrunner and R. Waupotitsch, “Computing a ham-sandwich cut in two dimensions,” Journal of Symbolic Computation, vol. 2, no. 2. Elsevier, pp. 171–178, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4106
DOI: 10.1016/S0747-7171(86)80020-7

H. Edelsbrunner, G. Haring, and D. Hilbert, “Rectangular point location in d-dimensions with applications,” Computer Journal, vol. 29, no. 1. Oxford University Press, pp. 76–82, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4109
DOI: 10.1093/comjnl/29.1.76

W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” Journal of Classification, vol. 1. Springer, pp. 7–24, 1984.
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115

H. Edelsbrunner, “Key-problems and key-methods in computational geometry,” in 1st Symposium of Theoretical Aspects of Computer Science, Paris, France, 1984, vol. 166, pp. 1–13.
LibreCat: https://research-explorer.ista.ac.at/record/4122
DOI: 10.1007/3-540-12920-0_1

H. Edelsbrunner and E. Welzl, “Monotone edge sequences in line arrangements and applications,” in 11th International Symposium on Mathematical Foundations of Computer Science, Praha, Czechoslovakia, 1984, vol. 176, pp. 265–272.
LibreCat: https://research-explorer.ista.ac.at/record/4119
DOI: 10.1007/BFb0030307

H. Edelsbrunner, M. Overmars, and D. Wood, “Graphics in Flatland: a case study,” in Computational Geometry: Theory and Applications, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 35–59.
LibreCat: https://research-explorer.ista.ac.at/record/3563

W. Bucher and H. Edelsbrunner, “On expected- and worst-case segment trees,” in Computational Geometry: Theory and Applications, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 109–125.
LibreCat: https://research-explorer.ista.ac.at/record/3562

N. H. Barton and G. Hewitt, “Hybrid zones as barriers to gene flow,” in Protein polymorphism: Adaptive and taxonomic significance, vol. 24, G. Oxford and D. Rollinson, Eds. Academic Press, 1983, pp. 341–359.
LibreCat: https://research-explorer.ista.ac.at/record/4328

H. Edelsbrunner and M. Overmars, “On the equivalence of some rectangle problems,” Information Processing Letters, vol. 14, no. 3. Elsevier, pp. 124–127, 1982.
LibreCat: https://research-explorer.ista.ac.at/record/4131
DOI: 10.1016/0020-0190(82)90068-0