Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1(1), 47–56.
LibreCat: https://research-explorer.ista.ac.at/record/4120
DOI: 10.1016/S0747-7171(85)80028-6

Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.
LibreCat: https://research-explorer.ista.ac.at/record/4116
DOI: 10.1016/0304-3975(85)90005-2

Day W, Edelsbrunner H. 1985. Investigation of Proportional Link Linkage Clustering Methods. Journal of Classification. 2(2–3), 239–254.
LibreCat: https://research-explorer.ista.ac.at/record/4114
DOI: 10.1007/BF01908077

Edelsbrunner H. 1985. Computing the extreme distances between two convex polygons. Journal of Algorithms. 6(2), 213–224.
LibreCat: https://research-explorer.ista.ac.at/record/4115
DOI: 10.1016/0196-6774(85)90039-2

Barton NH, Hewitt G. 1985. Analysis of hybrid zones. Annual Review of Ecology and Systematics. 16, 113–148.
LibreCat: https://research-explorer.ista.ac.at/record/4326
DOI: 10.1146/annurev.es.16.110185.000553

Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115

Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. 1st Symposium of Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer ScienceSTACS, LNCS, vol. 166, 1–13.
LibreCat: https://research-explorer.ista.ac.at/record/4122
DOI: 10.1007/3-540-12920-0_1

Edelsbrunner H, Overmars M, Seidel R. 1984. Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing. 28(1), 92–108.
LibreCat: https://research-explorer.ista.ac.at/record/4123
DOI: 10.1016/0734-189X(84)90142-7

Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection problems. 9th International Workshop on Graph Theoretic Concepts in Computer Science. WG: International Workshop on Graph Theoretic Concepts in Computer ScienceWG, 88–99.
LibreCat: https://research-explorer.ista.ac.at/record/3513

Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. 1984. Computing the connected components of simple rectilinear geometrical objects in D-Space. Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications. 18(2), 171–183.
LibreCat: https://research-explorer.ista.ac.at/record/4117
DOI: 10.1051/ita/1984180201711

Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. 11th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS, vol. 176, 265–272.
LibreCat: https://research-explorer.ista.ac.at/record/4119
DOI: 10.1007/BFb0030307

Edelsbrunner H, O’Rourke J, Welzl E. 1984. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing. 27(2), 167–176.
LibreCat: https://research-explorer.ista.ac.at/record/4118
DOI: 10.1016/S0734-189X(84)80041-9

Barton NH, Charlesworth B. 1984. Genetic revolutions, founder effects, and speciation. Annual Review of Ecology and Systematics. 15, 133–164.
LibreCat: https://research-explorer.ista.ac.at/record/4327
DOI: 10.1146/annurev.es.15.110184.001025

Halliday B, Barton NH, Hewitt G. 1983. Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris. Biological Journal of the Linnean Society. 19(1), 51–62.
LibreCat: https://research-explorer.ista.ac.at/record/3666
DOI: 10.1111/j.1095-8312.1983.tb00776.x

Barton NH. 1983. Multilocus clines. Evolution; International Journal of Organic Evolution. 37(3), 454–471.
LibreCat: https://research-explorer.ista.ac.at/record/3668
DOI: 10.2307/2408260
PMID: 28563316 

Barton NH, Halliday B, Hewitt G. 1983. Rare electrophoretic variants in a hybrid zone. Heredity. 50(2), 139–146.
LibreCat: https://research-explorer.ista.ac.at/record/3667
DOI: 10.1038/hdy.1983.15

Edelsbrunner H, Welzl E. 1983. On the number of equal-sized semispaces of a set of points in the plane. International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and ProgrammingLNCS, LNCS, vol. 154, 182–187.
LibreCat: https://research-explorer.ista.ac.at/record/4124
DOI: 10.1007/BFb0036908

Aurenhammer F, Edelsbrunner H. 1983. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition. 17(2), 251–257.
LibreCat: https://research-explorer.ista.ac.at/record/4125
DOI: 10.1016/0031-3203(84)90064-5

Edelsbrunner H, Kirkpatrick D, Seidel R. 1983. On the shape of a set of points in the plane. IEEE Transactions on Information Theory. 29(4), 551–559.
LibreCat: https://research-explorer.ista.ac.at/record/4128
DOI: 10.1109/TIT.1983.1056714 

Edelsbrunner H. 1983. A new approach to rectangle intersections part 1. International Journal of Computer Mathematics. 13(3–4), 209–219.
LibreCat: https://research-explorer.ista.ac.at/record/4126
DOI: 10.1080/00207168308803364