Barton, N. H., &; Bengtsson, B. (1986). The barrier to genetic exchange between hybridising populations. Heredity. Nature Publishing Group.
LibreCat: https://research-explorer.ista.ac.at/record/3664

Edelsbrunner, H., &; Stöckl, G. (1986). The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(86)90075-0 
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

Edelsbrunner, H., &; Seidel, R. (1986). Voronoi diagrams and arrangements. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187681 
LibreCat: https://research-explorer.ista.ac.at/record/4108
DOI: 10.1007/BF02187681

Edelsbrunner, H., &; Welzl, E. (1986). Constructing belts in two-dimensional arrangements with applications. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215019 
LibreCat: https://research-explorer.ista.ac.at/record/4110
DOI: 10.1137/0215019

Edelsbrunner, H., &; Waupotitsch, R. (1986). Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/S0747-7171(86)80020-7 
LibreCat: https://research-explorer.ista.ac.at/record/4106
DOI: 10.1016/S0747-7171(86)80020-7

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