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, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” in 15th International Colloquium on Automata, Languages and Programming, Tampere, Finland, 1988, vol. 317, pp. 214–229.

H. Edelsbrunner, “Geometric structures in computational geometry,” in 15th International Colloquium on Automata, Languages and Programming, Tampere, Finland, 1988, vol. 317, pp. 201–213.

B. Chazelle and H. Edelsbrunner, “Linear space data structures for two types of range search,” Discrete &; Computational Geometry, vol. 2, no. 1. Springer, pp. 113–126, 1987.

H. Edelsbrunner, Algorithms in Combinatorial Geometry, vol. 10. Berlinf; Heidelberg: Springer, 1987.

H. Edelsbrunner, “Edge-skeletons in arrangements with applications,” Algorithmica, vol. 1, no. 1–4. Springer, pp. 93–109, 1986.

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.

H. Edelsbrunner and D. Haussler, “The complexity of cells in 3-dimensional arrangements,” Discrete Mathematics, vol. 60, no. C. Elsevier, pp. 139–146, 1986.

H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” Information Processing Letters, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.

W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” Journal of Classification, vol. 1. Springer, pp. 7–24, 1984.

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.

D. Dobkin and H. Edelsbrunner, “Ham-sandwich theorems applied to intersection problems,” in 9th International Workshop on Graph Theoretic Concepts in Computer Science, Haus Ohrbeck, Germany, 1984, pp. 88–99.

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.

H. Edelsbrunner and H. Maurer, “On the intersection of Orthogonal objects,” Information Processing Letters, vol. 13, no. 4–5. Elsevier, pp. 177–181, 1981.

N. H. Barton and G. Hewitt, “The genetic basis of hybrid inviability between two chromosomal races of the grasshopper Podisma pedestris,” Heredity, vol. 47, no. 3. Springer Nature, pp. 367–383, 1981.