Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.”10.1016/0012-365X(86)90008-7__Discrete Mathematics, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi:10.1016/0012-365X(86)90008-7.
LibreCat: https://research-explorer.ista.ac.at/record/4107
DOI: 10.1016/0012-365X(86)90008-7

Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.”10.1016/0196-6774(85)90030-6__Journal of Algorithms, vol. 6, no. 4, Elsevier, 1985, pp. 515–42, doi:10.1016/0196-6774(85)90030-6.
LibreCat: https://research-explorer.ista.ac.at/record/4112
DOI: 10.1016/0196-6774(85)90030-6

Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.”10.1016/0020-0190(85)90107-3__Information Processing Letters, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:10.1016/0020-0190(85)90107-3.
LibreCat: https://research-explorer.ista.ac.at/record/4111
DOI: 10.1016/0020-0190(85)90107-3

Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.”10.1016/S0747-7171(85)80028-6__Journal of Symbolic Computation, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi:10.1016/S0747-7171(85)80028-6.
LibreCat: https://research-explorer.ista.ac.at/record/4120
DOI: 10.1016/S0747-7171(85)80028-6

Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.”10.1007/BF01890115__Journal of Classification, vol. 1, Springer, 1984, pp. 7–24, doi:10.1007/BF01890115.
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115

Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.”10.1007/3-540-12920-0_1__1st Symposium of Theoretical Aspects of Computer Science, vol. 166, Springer, 1984, pp. 1–13, doi:10.1007/3-540-12920-0_1.
LibreCat: https://research-explorer.ista.ac.at/record/4122
DOI: 10.1007/3-540-12920-0_1

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.
LibreCat: https://research-explorer.ista.ac.at/record/3513

Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.”10.1007/BFb0030307__11th International Symposium on Mathematical Foundations of Computer Science, vol. 176, Springer, 1984, pp. 265–72, doi:10.1007/BFb0030307.
LibreCat: https://research-explorer.ista.ac.at/record/4119
DOI: 10.1007/BFb0030307

Edelsbrunner, Herbert, et al. “Graphics in Flatland: A Case Study.” Computational Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 35–59.
LibreCat: https://research-explorer.ista.ac.at/record/3563

Barton, Nicholas H. “The Extended Phenotype: The Gene as the Unit of Selection (Review of Dawkins R 1982).”10.1016/S0003-3472(83)80100-6__Animal Behaviour, vol. 31, no. 2, Elsevier, 1983, pp. 626–27, doi:10.1016/S0003-3472(83)80100-6.
LibreCat: https://research-explorer.ista.ac.at/record/4329
DOI: 10.1016/S0003-3472(83)80100-6

Edelsbrunner, Herbert, and Hermann Maurer. “On the Intersection of Orthogonal Objects.”10.1016/0020-0190(81)90053-3__Information Processing Letters, vol. 13, no. 4–5, Elsevier, 1981, pp. 177–81, doi:10.1016/0020-0190(81)90053-3.
LibreCat: https://research-explorer.ista.ac.at/record/4132
DOI: 10.1016/0020-0190(81)90053-3

Barton, Nicholas H., and Godfrey Hewitt. “Hybrid Zones and Speciation.” Evolution and Speciation, edited by William Atchley and David Woodruff, Cambridge University Press, 1981, pp. 109–45.
LibreCat: https://research-explorer.ista.ac.at/record/4332

Barton, Nicholas H., and Godfrey Hewitt. “The Genetic Basis of Hybrid Inviability between Two Chromosomal Races of the Grasshopper Podisma Pedestris.”10.1038/hdy.1981.98__Heredity, vol. 47, no. 3, Springer Nature, 1981, pp. 367–83, doi:10.1038/hdy.1981.98.
LibreCat: https://research-explorer.ista.ac.at/record/4333
DOI: 10.1038/hdy.1981.98