Barton NH, Bengtsson B. The barrier to genetic exchange between hybridising populations. Heredity. 1986;57:357-376.
LibreCat: https://research-explorer.ista.ac.at/record/3664

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
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

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

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

Edelsbrunner H, Waupotitsch R. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. 1986;2(2):171-178. doi: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. Rectangular point location in d-dimensions with applications. Computer Journal. 1986;29(1):76-82. doi: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. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 1986;60(C):139-146. doi: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 NH. Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In: Skamene E, ed. Genetic Control of Host Resistance to Infection and Malignancy. Vol 3. Progress in leukocyte biology. Liss; 1985.
LibreCat: https://research-explorer.ista.ac.at/record/4241

Jones S, Barton NH. Haldane’s Rule OK. Nature. 1985;314:668-668. doi:10.1038/314668a0
LibreCat: https://research-explorer.ista.ac.at/record/4325
DOI: 10.1038/314668a0
PMID: 3990801

Edelsbrunner H, Overmars M. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. 1985;6(4):515-542. doi: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. On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory Series A. 1985;38(1):15-29. doi: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. 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
LibreCat: https://research-explorer.ista.ac.at/record/4111
DOI: 10.1016/0020-0190(85)90107-3

Chazelle B, Edelsbrunner H. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1985;1(1):47-56. doi: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. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 1985;35(1):55-69. doi: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. Investigation of Proportional Link Linkage Clustering Methods. Journal of Classification. 1985;2(2-3):239-254. doi:10.1007/BF01908077
LibreCat: https://research-explorer.ista.ac.at/record/4114
DOI: 10.1007/BF01908077

Edelsbrunner H. Computing the extreme distances between two convex polygons. Journal of Algorithms. 1985;6(2):213-224. doi: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 NH, Hewitt G. Analysis of hybrid zones. Annual Review of Ecology and Systematics. 1985;16:113-148. doi: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. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1984;1:7-24. doi:10.1007/BF01890115
LibreCat: https://research-explorer.ista.ac.at/record/4121
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
LibreCat: https://research-explorer.ista.ac.at/record/4122
DOI: 10.1007/3-540-12920-0_1

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