Edelsbrunner H, Pach J, Schwartz J, Sharir M. 1987. On the lower envelope of bivariate functions and its applications. 28th Annual Symposium on Foundations of Computer Science . FOCS: Foundations of Computer Science, 27–37.

Barton NH. 1986. The effects of linkage and density-dependent regulation on gene flow. Heredity. 57, 415–426.

Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.

Edelsbrunner H, Waupotitsch R. 1986. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. 2(2), 171–178.

Edelsbrunner H, Haring G, Hilbert D. 1986. Rectangular point location in d-dimensions with applications. Computer Journal. 29(1), 76–82.

Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.

Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. 1st Symposium of Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer ScienceSTACS, LNCS, vol. 166, 1–13.

Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. 11th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS, vol. 176, 265–272.

Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study. In: Computational Geometry: Theory and Applications.  Advances in Computing Research, vol. 1, 35–59.

Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees. In: Computational Geometry: Theory and Applications. Advances in Computing Research , vol. 1, 109–125.

Barton NH, Hewitt G. 1983.Hybrid zones as barriers to gene flow. In: Protein polymorphism: Adaptive and taxonomic significance. Systematics Association Special Volume, vol. 24, 341–359.

Edelsbrunner H, Overmars M. 1982. On the equivalence of some rectangle problems. Information Processing Letters. 14(3), 124–127.