Edelsbrunner, H., Haring, G., &; Hilbert, D. (1986). Rectangular point location in d-dimensions with applications. Computer Journal. Oxford University Press.https://doi.org/10.1093/comjnl/29.1.76 
LibreCat: https://research-explorer.ista.ac.at/record/4109
DOI: 10.1093/comjnl/29.1.76

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 
LibreCat: https://research-explorer.ista.ac.at/record/4107
DOI: 10.1016/0012-365X(86)90008-7

Curtis, C., Curtis, J., &; Barton, N. H. (1985). Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In E. Skamene (Ed.), Genetic Control of Host Resistance to Infection and Malignancy (Vol. 3). Liss.
LibreCat: https://research-explorer.ista.ac.at/record/4241

Jones, S., &; Barton, N. H. (1985). Haldane’s Rule OK. Nature. Nature Publishing Group.https://doi.org/10.1038/314668a0 
LibreCat: https://research-explorer.ista.ac.at/record/4325
DOI: 10.1038/314668a0
PMID: 3990801

Edelsbrunner, H., &; Overmars, M. (1985). Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. Elsevier.https://doi.org/10.1016/0196-6774(85)90030-6 
LibreCat: https://research-explorer.ista.ac.at/record/4112
DOI: 10.1016/0196-6774(85)90030-6

Edelsbrunner, H., &; Welzl, E. (1985). On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(85)90017-2 
LibreCat: https://research-explorer.ista.ac.at/record/4113
DOI: 10.1016/0097-3165(85)90017-2

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 
LibreCat: https://research-explorer.ista.ac.at/record/4111
DOI: 10.1016/0020-0190(85)90107-3

Chazelle, B., &; Edelsbrunner, H. (1985). Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/S0747-7171(85)80028-6 
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. Elsevier.https://doi.org/10.1016/0304-3975(85)90005-2 
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. Springer.https://doi.org/10.1007/BF01908077 
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. Academic Press.https://doi.org/10.1016/0196-6774(85)90039-2 
LibreCat: https://research-explorer.ista.ac.at/record/4115
DOI: 10.1016/0196-6774(85)90039-2

Barton, N. H., &; Hewitt, G. (1985). Analysis of hybrid zones. Annual Review of Ecology and Systematics. Annual Reviews.https://doi.org/10.1146/annurev.es.16.110185.000553 
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. Springer.https://doi.org/10.1007/BF01890115 
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 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 
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. Elsevier.https://doi.org/10.1016/0734-189X(84)90142-7 
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. In 9th International Workshop on Graph Theoretic Concepts in Computer Science (pp. 88–99). Haus Ohrbeck, Germany: Teubner.
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. EDP Sciences.https://doi.org/10.1051/ita/1984180201711 
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. In 11th International Symposium on Mathematical Foundations of Computer Science (Vol. 176, pp. 265–272). Praha, Czechoslovakia: Springer.https://doi.org/10.1007/BFb0030307 
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. Elsevier.https://doi.org/10.1016/S0734-189X(84)80041-9 
LibreCat: https://research-explorer.ista.ac.at/record/4118
DOI: 10.1016/S0734-189X(84)80041-9

Barton, N. H., &; Charlesworth, B. (1984). Genetic revolutions, founder effects, and speciation. Annual Review of Ecology and Systematics. Annual Reviews.https://doi.org/10.1146/annurev.es.15.110184.001025 
LibreCat: https://research-explorer.ista.ac.at/record/4327
DOI: 10.1146/annurev.es.15.110184.001025