H. Edelsbrunner, Algorithms in Combinatorial Geometry, vol. 10. Berlinf; Heidelberg: Springer, 1987.
LibreCat: https://research-explorer.ista.ac.at/record/3900
DOI: 10.1007/978-3-642-61568-9

H. Edelsbrunner, L. Guibas, and J. Stolfi, “Optimal point location in a monotone subdivision,” SIAM Journal on Computing, vol. 15, no. 2. SIAM, pp. 317–340, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4104
DOI: 10.1137/0215023

H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” Journal of Combinatorial Theory Series A, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4103
DOI: 10.1016/0097-3165(86)90078-6

H. Edelsbrunner, “Edge-skeletons in arrangements with applications,” Algorithmica, vol. 1, no. 1–4. Springer, pp. 93–109, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438

H. Edelsbrunner and G. 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, pp. 344–349, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

H. Edelsbrunner and D. Haussler, “The complexity of cells in 3-dimensional arrangements,” Discrete Mathematics, vol. 60, no. C. Elsevier, pp. 139–146, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4107
DOI: 10.1016/0012-365X(86)90008-7

H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable searching problems,” Journal of Algorithms, vol. 6, no. 4. Elsevier, pp. 515–542, 1985.
LibreCat: https://research-explorer.ista.ac.at/record/4112
DOI: 10.1016/0196-6774(85)90030-6

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.
LibreCat: https://research-explorer.ista.ac.at/record/4111
DOI: 10.1016/0020-0190(85)90107-3

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.
LibreCat: https://research-explorer.ista.ac.at/record/4120
DOI: 10.1016/S0747-7171(85)80028-6

W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” Journal of Classification, vol. 1. Springer, pp. 7–24, 1984.
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115

H. Edelsbrunner, “Key-problems and key-methods in computational geometry,” in 1st Symposium of Theoretical Aspects of Computer Science, Paris, France, 1984, vol. 166, pp. 1–13.
LibreCat: https://research-explorer.ista.ac.at/record/4122
DOI: 10.1007/3-540-12920-0_1

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

H. Edelsbrunner and E. Welzl, “Monotone edge sequences in line arrangements and applications,” in 11th International Symposium on Mathematical Foundations of Computer Science, Praha, Czechoslovakia, 1984, vol. 176, pp. 265–272.
LibreCat: https://research-explorer.ista.ac.at/record/4119
DOI: 10.1007/BFb0030307

H. Edelsbrunner, M. Overmars, and D. Wood, “Graphics in Flatland: a case study,” in Computational Geometry: Theory and Applications, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 35–59.
LibreCat: https://research-explorer.ista.ac.at/record/3563

N. H. Barton, “The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982),” Animal Behaviour, vol. 31, no. 2. Elsevier, pp. 626–627, 1983.
LibreCat: https://research-explorer.ista.ac.at/record/4329
DOI: 10.1016/S0003-3472(83)80100-6

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

N. H. Barton and G. Hewitt, “Hybrid zones and speciation,” in Evolution and Speciation, W. Atchley and D. Woodruff, Eds. Cambridge University Press, 1981, pp. 109–145.
LibreCat: https://research-explorer.ista.ac.at/record/4332

N. H. Barton and G. Hewitt, “The genetic basis of hybrid inviability between two chromosomal races of the grasshopper Podisma pedestris,” Heredity, vol. 47, no. 3. Springer Nature, pp. 367–383, 1981.
LibreCat: https://research-explorer.ista.ac.at/record/4333
DOI: 10.1038/hdy.1981.98