Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
7036 Publications
1986 |Published| Journal Article | IST-REx-ID: 3579
Edelsbrunner, Herbert, and Jerzy Jaromczyk. “How Often Can You See Yourself in a Convex Configuration of Mirrors?” Congressus Numerantium, vol. 53, Utilitas Mathemtica Publ. Inc., 1986, pp. 193–200.
View
1986 |Published| Journal Article | IST-REx-ID: 3663 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Barton, Nicholas H., and Montgomery Slatkin. “A Quasi-Equilibrium Theory of the Distribution of Rare Alleles in a Subdivided Population.” Heredity, vol. 56, no. 3, Nature Publishing Group, 1986, pp. 409–16, doi:10.1038/hdy.1986.63.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1986 |Published| Journal Article | IST-REx-ID: 3662
Nagylaki, Thomas, and Nicholas H. Barton. “Intrachromosomal Gene Conversion, Linkage, and the Evolution of Multigene Families.” Theoretical Population Biology, vol. 29, no. 3, Academic Press, 1986, pp. 407–37, doi:10.1016/0040-5809(86)90017-1.
View
| DOI
1986 |Published| Journal Article | IST-REx-ID: 3665 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” Heredity, vol. 57, Nature Publishing Group, 1986, pp. 415–26.
[Published Version]
View
| Download Published Version (ext.)
1986 |Published| Journal Article | IST-REx-ID: 3664 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Barton, Nicholas H., and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” Heredity, vol. 57, Nature Publishing Group, 1986, pp. 357–76.
[Published Version]
View
| Download Published Version (ext.)
1986 |Published| Journal Article | IST-REx-ID: 4098 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series A, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi:10.1016/0097-3165(86)90075-0.
View
| DOI
| Download None (ext.)
1986 |Published| Journal Article | IST-REx-ID: 4108
Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.” Discrete & Computational Geometry, vol. 1, no. 1, Springer, 1986, pp. 25–44, doi:10.1007/BF02187681.
View
| DOI
1986 |Published| Journal Article | IST-REx-ID: 4110
Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.” SIAM Journal on Computing, vol. 15, no. 1, SIAM, 1986, pp. 271–84, doi:10.1137/0215019.
View
| DOI
1986 |Published| Journal Article | IST-REx-ID: 4106
Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” Journal of Symbolic Computation, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi:10.1016/S0747-7171(86)80020-7.
View
| DOI
1986 |Published| Journal Article | IST-REx-ID: 4109
Edelsbrunner, Herbert, et al. “Rectangular Point Location in D-Dimensions with Applications.” Computer Journal, vol. 29, no. 1, Oxford University Press, 1986, pp. 76–82, doi:10.1093/comjnl/29.1.76.
View
| DOI
1986 |Published| Journal Article | IST-REx-ID: 4107
Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” Discrete Mathematics, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi:10.1016/0012-365X(86)90008-7.
View
| DOI
1985 |Published| Book Chapter | IST-REx-ID: 4241
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.
View
1985 |Published| Journal Article | IST-REx-ID: 4325
Jones, Steve, and Nicholas H. Barton. “Haldane’s Rule OK.” Nature, vol. 314, Nature Publishing Group, 1985, pp. 668–668, doi:10.1038/314668a0.
View
| DOI
| PubMed | Europe PMC
1985 |Published| Journal Article | IST-REx-ID: 4112
Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” Journal of Algorithms, vol. 6, no. 4, Elsevier, 1985, pp. 515–42, doi:10.1016/0196-6774(85)90030-6.
View
| DOI
1985 |Published| Journal Article | IST-REx-ID: 4113
Edelsbrunner, Herbert, and Emo 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, 1985, pp. 15–29, doi:10.1016/0097-3165(85)90017-2.
View
| DOI
1985 |Published| Journal Article | IST-REx-ID: 4111
Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” Information Processing Letters, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:10.1016/0020-0190(85)90107-3.
View
| DOI
1985 |Published| Journal Article | IST-REx-ID: 4120 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” Journal of Symbolic Computation, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi:10.1016/S0747-7171(85)80028-6.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1985 |Published| Journal Article | IST-REx-ID: 4116 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” Theoretical Computer Science, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi:10.1016/0304-3975(85)90005-2.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1985 |Published| Journal Article | IST-REx-ID: 4114
Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.” Journal of Classification, vol. 2, no. 2–3, Springer, 1985, pp. 239–54, doi:10.1007/BF01908077.
View
| DOI
1985 |Published| Journal Article | IST-REx-ID: 4115
Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” Journal of Algorithms, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, doi:10.1016/0196-6774(85)90039-2.
View
| DOI