Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements of curves in the plane - topology, combinatorics, and algorithms. In: 15th International Colloquium on Automata, Languages and Programming. Vol 317. Springer; 1988:214-229. doi:10.1007/3-540-19488-6_118

Edelsbrunner H. Geometric structures in computational geometry. In: 15th International Colloquium on Automata, Languages and Programming. Vol 317. Springer; 1988:201-213. doi:10.1007/3-540-19488-6_117

Chazelle B, Edelsbrunner H. Linear space data structures for two types of range search. Discrete &; Computational Geometry. 1987;2(1):113-126. doi:10.1007/BF02187875

Edelsbrunner H. Algorithms in Combinatorial Geometry. Vol 10. Berlinf; Heidelberg: Springer; 1987. doi:10.1007/978-3-642-61568-9

Barton NH, Post RJ. Sibling competition and the advantage of mixed families. Journal of Theoretical Biology. 1986;120(4):381-387. doi:10.1016/S0022-5193(86)80033-9

Edelsbrunner H. Edge-skeletons in arrangements with applications. Algorithmica. 1986;1(1-4):93-109. doi:10.1007/BF01840438

Edelsbrunner H, Stöckl G. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 1986;43(2):344-349. doi:10.1016/0097-3165(86)90075-0

Edelsbrunner H, Haussler D. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 1986;60(C):139-146. doi:10.1016/0012-365X(86)90008-7

Edelsbrunner H, Maurer H. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 1985;21(1):39-47. doi:10.1016/0020-0190(85)90107-3

Day W, Edelsbrunner H. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1984;1:7-24. doi:10.1007/BF01890115

Edelsbrunner H. Key-problems and key-methods in computational geometry. In: 1st Symposium of Theoretical Aspects of Computer Science. Vol 166. STACS. Springer; 1984:1-13. doi:10.1007/3-540-12920-0_1

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

Edelsbrunner H, Welzl E. Monotone edge sequences in line arrangements and applications. In: 11th International Symposium on Mathematical Foundations of Computer Science. Vol 176. MFCS. Springer; 1984:265-272. doi:10.1007/BFb0030307

Edelsbrunner H, O’Rourke J, Welzl E. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing. 1984;27(2):167-176. doi:10.1016/S0734-189X(84)80041-9

Edelsbrunner H, Maurer H. On the intersection of Orthogonal objects. Information Processing Letters. 1981;13(4-5):177-181. doi:10.1016/0020-0190(81)90053-3

Barton NH, Hewitt G. Hybrid zones and speciation. In: Atchley W, Woodruff D, eds. Evolution and Speciation. Cambridge University Press; 1981:109-145.

Barton NH, Hewitt G. The genetic basis of hybrid inviability between two chromosomal races of the grasshopper Podisma pedestris. Heredity. 1981;47(3):367-383. doi:10.1038/hdy.1981.98

Hewitt G, Barton NH. The structure and maintenance of hybrid zones as exemplified by Podisma pedestris. In: Blackman R, Ashburner M, eds. Insect Cytogenetics. Vol 10. Wiley-Blackwell; 1980:149-170.