Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.

Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.

Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.

Population structure and processes in evolution
N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.

Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete &; Computational Geometry 4 (1989) 433–466.

Partitioning space for range queries
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.

Testing the necklace condition for shortest tours and optimal factors in the plane
H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.

Tetrahedrizing point sets in three dimensions
H. Edelsbrunner, F. Preparata, D. West, in:,  International Symposium on Symbolic and Algebraic Computation, Springer, 1989, pp. 315–331.

Temperature dependence of gating current in myelinated nerve fibers
P.M. Jonas, Journal of Membrane Biology 112 (1989) 277–289.

Arrangements of curves in the plane - topology, combinatorics, and algorithms
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 214–229.

Geometric structures in computational geometry
H. Edelsbrunner, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 201–213.

Probing convex polygons with X-Rays
H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.

Speciation
N.H. Barton, in:, A. Myers, P. Giller (Eds.), Analytical Biogeography: An Integrated Approach to the Study of Animal and Plant Distributions, 1st ed., Springer, 1988, pp. 185–218.

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.

Optimal point location in a monotone subdivision
H. Edelsbrunner, L. Guibas, J. Stolfi, SIAM Journal on Computing 15 (1986) 317–340.

On the maximal number of edges of many faces in an arrangement
H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.

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.

Batched dynamic solutions to decomposable searching problems
H. Edelsbrunner, M. Overmars, Journal of Algorithms 6 (1985) 515–542.

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.

Optimal solutions for a class of point retrieval problems
B. Chazelle, H. Edelsbrunner, Journal of Symbolic Computation 1 (1985) 47–56.

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.

Graphics in Flatland: a case study
H. Edelsbrunner, M. Overmars, D. Wood, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 35–59.

The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982)
N.H. Barton, Animal Behaviour 31 (1983) 626–627.

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

Hybrid zones and speciation
N.H. Barton, G. Hewitt, in:, W. Atchley, D. Woodruff (Eds.), Evolution and Speciation, Cambridge University Press, 1981, pp. 109–145.

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.