Linear space data structures for two types of range search
B. Chazelle, H. Edelsbrunner, Discrete &; Computational Geometry 2 (1987) 113–126.

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

Edge-skeletons in arrangements with applications
H. Edelsbrunner, Algorithmica 1 (1986) 93–109.

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

The complexity of cells in 3-dimensional arrangements
H. Edelsbrunner, D. Haussler, Discrete Mathematics 60 (1986) 139–146.

Finding extreme-points in 3-dimensions and solving the post-office problem in the plane
H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.

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

Key-problems and key-methods in computational geometry
H. Edelsbrunner, in:, 1st Symposium of Theoretical Aspects of Computer Science, Springer, 1984, pp. 1–13.

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

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

On the intersection of Orthogonal objects
H. Edelsbrunner, H. Maurer, Information Processing Letters 13 (1981) 177–181.

The genetic basis of hybrid inviability between two chromosomal races of the grasshopper Podisma pedestris
N.H. Barton, G. Hewitt, Heredity 47 (1981) 367–383.