Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” Heredity, vol. 57, Nature Publishing Group, 1986, pp. 415–26.
LibreCat: https://research-explorer.ista.ac.at/record/3665

Barton, Nicholas H., and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” Heredity, vol. 57, Nature Publishing Group, 1986, pp. 357–76.
LibreCat: https://research-explorer.ista.ac.at/record/3664

Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.”10.1016/0097-3165(86)90075-0__Journal of Combinatorial Theory Series A, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, 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, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.”10.1007/BF02187681__Discrete &; Computational Geometry, vol. 1, no. 1, Springer, 1986, pp. 25–44, doi:10.1007/BF02187681.
LibreCat: https://research-explorer.ista.ac.at/record/4108
DOI: 10.1007/BF02187681

Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.”10.1137/0215019__SIAM Journal on Computing, vol. 15, no. 1, SIAM, 1986, pp. 271–84, doi:10.1137/0215019.
LibreCat: https://research-explorer.ista.ac.at/record/4110
DOI: 10.1137/0215019

Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.”10.1016/S0747-7171(86)80020-7__Journal of Symbolic Computation, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, 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, Herbert, et al. “Rectangular Point Location in D-Dimensions with Applications.”10.1093/comjnl/29.1.76__Computer Journal, vol. 29, no. 1, Oxford University Press, 1986, pp. 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, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.”10.1016/0012-365X(86)90008-7__Discrete Mathematics, vol. 60, no. C, Elsevier, 1986, pp. 139–46, 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., et al. “Methodology for Testing the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.” Genetic Control of Host Resistance to Infection and Malignancy, edited by Emil Skamene, vol. 3, Liss, 1985.
LibreCat: https://research-explorer.ista.ac.at/record/4241

Jones, Steve, and Nicholas H. Barton. “Haldane’s Rule OK.”10.1038/314668a0__Nature, vol. 314, Nature Publishing Group, 1985, pp. 668–668, doi:10.1038/314668a0.
LibreCat: https://research-explorer.ista.ac.at/record/4325
DOI: 10.1038/314668a0
PMID: 3990801

Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.”10.1016/0196-6774(85)90030-6__Journal of Algorithms, vol. 6, no. 4, Elsevier, 1985, pp. 515–42, 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, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.”10.1016/0097-3165(85)90017-2__Journal of Combinatorial Theory Series A, vol. 38, no. 1, Elsevier, 1985, pp. 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, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.”10.1016/0020-0190(85)90107-3__Information Processing Letters, vol. 21, no. 1, Elsevier, 1985, pp. 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, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.”10.1016/S0747-7171(85)80028-6__Journal of Symbolic Computation, vol. 1, no. 1, Elsevier, 1985, pp. 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, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.”10.1016/0304-3975(85)90005-2__Theoretical Computer Science, vol. 35, no. 1, Elsevier, 1985, pp. 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, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.”10.1007/BF01908077__Journal of Classification, vol. 2, no. 2–3, Springer, 1985, pp. 239–54, doi:10.1007/BF01908077.
LibreCat: https://research-explorer.ista.ac.at/record/4114
DOI: 10.1007/BF01908077

Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.”10.1016/0196-6774(85)90039-2__Journal of Algorithms, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, 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, Nicholas H., and Godfrey Hewitt. “Analysis of Hybrid Zones.”10.1146/annurev.es.16.110185.000553__Annual Review of Ecology and Systematics, vol. 16, Annual Reviews, 1985, pp. 113–48, 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, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.”10.1007/BF01890115__Journal of Classification, vol. 1, Springer, 1984, pp. 7–24, doi:10.1007/BF01890115.
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115

Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.”10.1007/3-540-12920-0_1__1st Symposium of Theoretical Aspects of Computer Science, vol. 166, Springer, 1984, pp. 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