Please note that IST 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.

6073 Publications


1986 | Journal Article | IST-REx-ID: 3663
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
 

1986 | Journal Article | IST-REx-ID: 3664
Barton, Nicholas H., and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” Heredity, vol. 57, Nature Publishing Group, 1986, pp. 357–76.
View
 

1986 | Journal Article | IST-REx-ID: 3665
Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” Heredity, vol. 57, Nature Publishing Group, 1986, pp. 415–26.
View
 

1985 | 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 | 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, Academic Press, 1985, pp. 515–42, doi:10.1016/0196-6774(85)90030-6.
View | DOI
 

1985 | 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 | 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 | 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
 

1985 | Journal Article | IST-REx-ID: 4116
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.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4120
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.
View | DOI
 

Search

Filter Publications