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 

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. (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., &; 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 

Day, W., &; Edelsbrunner, H. (1984). Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. Springer.https://doi.org/10.1007/BF01890115 

Edelsbrunner, H. (1984). Key-problems and key-methods in computational geometry. In 1st Symposium of Theoretical Aspects of Computer Science (Vol. 166, pp. 1–13). Paris, France: Springer.https://doi.org/10.1007/3-540-12920-0_1 

Dobkin, D., &; Edelsbrunner, H. (1984). Ham-sandwich theorems applied to intersection problems. In 9th International Workshop on Graph Theoretic Concepts in Computer Science (pp. 88–99). Haus Ohrbeck, Germany: Teubner.

Edelsbrunner, H., &; Welzl, E. (1984). Monotone edge sequences in line arrangements and applications. In 11th International Symposium on Mathematical Foundations of Computer Science (Vol. 176, pp. 265–272). Praha, Czechoslovakia: Springer.https://doi.org/10.1007/BFb0030307 

Edelsbrunner, H., &; Maurer, H. (1981). On the intersection of Orthogonal objects. Information Processing Letters. Elsevier.https://doi.org/10.1016/0020-0190(81)90053-3 

Barton, N. H., &; Hewitt, G. (1981). The genetic basis of hybrid inviability between two chromosomal races of the grasshopper Podisma pedestris. Heredity. Springer Nature.https://doi.org/10.1038/hdy.1981.98