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.

6113 Publications


1986 | Journal Article | IST-REx-ID: 4321
J. Szymura and N. H. Barton, “Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland,” Evolution; International Journal of Organic Evolution, vol. 40. Wiley-Blackwell, pp. 1141–1159, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4323
N. H. Barton and R. Post, “Sibling competition and the advantage of mixed families,” Journal of Theoretical Biology, vol. 120, no. 4. Elsevier, pp. 381–387, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4324
N. H. Barton, “The maintenance of polygenic variation through a balance between mutation and stabilising selection,” Genetical Research, vol. 47, no. 3. Cambridge University Press, pp. 209–216, 1986.
View | DOI
 

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

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

1985 | Journal Article | IST-REx-ID: 4112
H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable searching problems,” Journal of Algorithms, vol. 6, no. 4. Academic Press, pp. 515–542, 1985.
View | DOI
 

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

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

1985 | Journal Article | IST-REx-ID: 4115
H. Edelsbrunner, “Computing the extreme distances between two convex polygons,” Journal of Algorithms, vol. 6, no. 2. Academic Press, pp. 213–224, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4116
H. Edelsbrunner, “Finding Transversals for Sets of Simple Geometric-Figures,” Theoretical Computer Science, vol. 35, no. 1. Elsevier, pp. 55–69, 1985.
View | DOI
 

1985 | Book Review | IST-REx-ID: 4325
S. Jones and N. H. Barton, “Haldane’s Rule OK,” Nature, vol. 314. Nature Publishing Group, pp. 668–668, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4326
N. H. Barton and G. Hewitt, “Analysis of hybrid zones,” Annual Review of Ecology and Systematics, vol. 16. Annual Reviews, pp. 113–148, 1985.
View | DOI
 

1985 | Conference Paper | IST-REx-ID: 4241
C. Curtis, J. Curtis, and N. H. Barton, “Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy,” presented at the Symp. on Genetic Control of Host Resistance, 1985, vol. 3.
View
 

1984 | Conference Paper | IST-REx-ID: 3513
D. Dobkin and H. Edelsbrunner, “Ham-sandwich theorems applied to intersection problems,” presented at the WG: International Workshop on Graph Theoretic Concepts in Computer Science, 1984, pp. 88–99.
View | Download (ext.)
 

1984 | Journal Article | IST-REx-ID: 4121
W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” Journal of Classification, vol. 1, no. 1. Springer, pp. 7–24, 1984.
View | DOI | Download (ext.)
 

1984 | Conference Paper | IST-REx-ID: 4122
H. Edelsbrunner, “Key-problems and key-methods in computational geometry,” presented at the STACS: Theoretical Aspects of Computer Science, 1984, vol. 166, pp. 1–13.
View | DOI
 

1984 | Journal Article | IST-REx-ID: 4123
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. Academic Press, pp. 92–108, 1984.
View | DOI
 

1984 | Journal Article | IST-REx-ID: 4125
F. Aurenhammer and H. Edelsbrunner, “An optimal algorithm for constructing the weighted Voronoi diagram in the plane,” Pattern Recognition, vol. 17, no. 2. Springer, pp. 251–257, 1984.
View | DOI
 

1984 | Journal Article | IST-REx-ID: 4117
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. Cambridge University Press, pp. 171–183, 1984.
View
 

1984 | Journal Article | IST-REx-ID: 4118
H. Edelsbrunner, J. O’Rourke, and E. Welzl, “Stationing guards in rectilinear art galleries,” Computer Vision, Graphics, and Image Processing, vol. 27, no. 2. Academic Press, pp. 167–176, 1984.
View | DOI
 

Search

Filter Publications