H. Edelsbrunner, G. Haring, and D. Hilbert, “Rectangular point location in d-dimensions with applications,” Computer Journal, vol. 29, no. 1. Oxford University Press, pp. 76–82, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4109
DOI: 10.1093/comjnl/29.1.76

H. Edelsbrunner and D. Haussler, “The complexity of cells in 3-dimensional arrangements,” Discrete Mathematics, vol. 60, no. C. Elsevier, pp. 139–146, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4107
DOI: 10.1016/0012-365X(86)90008-7

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

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

H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable searching problems,” Journal of Algorithms, vol. 6, no. 4. Elsevier, pp. 515–542, 1985.
LibreCat: https://research-explorer.ista.ac.at/record/4112
DOI: 10.1016/0196-6774(85)90030-6

H. Edelsbrunner and E. Welzl, “On the number of line separations of a finite set in the plane,” Journal of Combinatorial Theory Series A, vol. 38, no. 1. Elsevier, pp. 15–29, 1985.
LibreCat: https://research-explorer.ista.ac.at/record/4113
DOI: 10.1016/0097-3165(85)90017-2

H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” Information Processing Letters, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.
LibreCat: https://research-explorer.ista.ac.at/record/4111
DOI: 10.1016/0020-0190(85)90107-3

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

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

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

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

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

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

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

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

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

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

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

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

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