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.
9789 Publications
1985 | Published | 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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1985 | Published | 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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1985 | Published | Book Chapter | 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,” in Genetic Control of Host Resistance to Infection and Malignancy, vol. 3, E. Skamene, Ed. Liss, 1985.
View
1985 | Published | Journal Article | 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
| PubMed | Europe PMC
1984 | Published | 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. EDP Sciences, pp. 171–183, 1984.
View
| DOI
1984 | Published | Journal Article | IST-REx-ID: 4121
W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” Journal of Classification, vol. 1. Springer, pp. 7–24, 1984.
View
| DOI
| Download None (ext.)
1984 | Published | Journal Article | IST-REx-ID: 4327
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.
View
| DOI
| Download None (ext.)
1984 | Published | Conference Paper | IST-REx-ID: 3513
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.
View
| Download None (ext.)
1983 | Published | Conference Paper | IST-REx-ID: 4124
H. Edelsbrunner and E. Welzl, “On the number of equal-sized semispaces of a set of points in the plane,” in International Colloquium on Automata, Languages, and Programming, Barcelona, Spain, 1983, vol. 154, pp. 182–187.
View
| DOI
| Download None (ext.)
1983 | Published | 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. Elsevier, pp. 251–257, 1983.
View
| DOI
| Download None (ext.)