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.
1612 Publications
1987 | Journal Article | IST-REx-ID: 4100
Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” Discrete & Computational Geometry, vol. 2, no. 1, Springer, 1987, pp. 113–26, doi:10.1007/BF02187875.
View
| DOI
1987 | Book | IST-REx-ID: 3900
Edelsbrunner, Herbert. Algorithms in Combinatorial Geometry. Vol. 10, Springer, 1987, doi:10.1007/978-3-642-61568-9.
View
| Files available
| DOI
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” Algorithmica, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi:10.1007/BF01840438.
View
| DOI
1986 | Journal Article | IST-REx-ID: 4098 | 
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 | 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 | 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
1984 | Journal Article | IST-REx-ID: 4121
Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” Journal of Classification, vol. 1, Springer, 1984, pp. 7–24, doi:10.1007/BF01890115.
View
| DOI
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.” 1st Symposium of Theoretical Aspects of Computer Science, vol. 166, Springer, 1984, pp. 1–13, doi:10.1007/3-540-12920-0_1.
View
| DOI
1984 | Conference Paper | IST-REx-ID: 3513
Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems.” 9th International Workshop on Graph Theoretic Concepts in Computer Science, Teubner, 1984, pp. 88–99.
View
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.” 11th International Symposium on Mathematical Foundations of Computer Science, vol. 176, Springer, 1984, pp. 265–72, doi:10.1007/BFb0030307.
View
| DOI
1981 | Journal Article | IST-REx-ID: 4132 |
Edelsbrunner, Herbert, and Hermann Maurer. “On the Intersection of Orthogonal Objects.” Information Processing Letters, vol. 13, no. 4–5, Elsevier, 1981, pp. 177–81, doi:10.1016/0020-0190(81)90053-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1981 | Journal Article | IST-REx-ID: 4333 |
Barton, Nicholas H., and Godfrey Hewitt. “The Genetic Basis of Hybrid Inviability between Two Chromosomal Races of the Grasshopper Podisma Pedestris.” Heredity, vol. 47, no. 3, Springer Nature, 1981, pp. 367–83, doi:10.1038/hdy.1981.98.
[Published Version]
View
| DOI
| Download Published Version (ext.)