How often can you see yourself in a convex configuration of mirrors?
H. Edelsbrunner, J. Jaromczyk, Congressus Numerantium 53 (1986) 193–200.
LibreCat: https://research-explorer.ista.ac.at/record/3579

A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population
N.H. Barton, M. Slatkin, Heredity 56 (1986) 409–416.
LibreCat: https://research-explorer.ista.ac.at/record/3663
DOI: 10.1038/hdy.1986.63
PMID: 3733460 

Intrachromosomal gene conversion, linkage, and the evolution of multigene families
T. Nagylaki, N.H. Barton, Theoretical Population Biology 29 (1986) 407–437.
LibreCat: https://research-explorer.ista.ac.at/record/3662
DOI: 10.1016/0040-5809(86)90017-1

The effects of linkage and density-dependent regulation on gene flow
N.H. Barton, Heredity 57 (1986) 415–426.
LibreCat: https://research-explorer.ista.ac.at/record/3665

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

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

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

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

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

Rectangular point location in d-dimensions with applications
H. Edelsbrunner, G. Haring, D. Hilbert, Computer Journal 29 (1986) 76–82.
LibreCat: https://research-explorer.ista.ac.at/record/4109
DOI: 10.1093/comjnl/29.1.76

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

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

Haldane's Rule OK
S. Jones, N.H. Barton, Nature 314 (1985) 668–668.
LibreCat: https://research-explorer.ista.ac.at/record/4325
DOI: 10.1038/314668a0
PMID: 3990801

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

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

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

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

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

Investigation of Proportional Link Linkage Clustering Methods
W. Day, H. Edelsbrunner, Journal of Classification 2 (1985) 239–254.
LibreCat: https://research-explorer.ista.ac.at/record/4114
DOI: 10.1007/BF01908077

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