H. Edelsbrunner, A. Robison, and X. Shen, “Covering convex sets with non-overlapping polygons,” Discrete Mathematics, vol. 81, no. 2. Elsevier, pp. 153–164, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4065
DOI: 10.1016/0012-365X(90)90147-A

P. M. Jonas, “Temperature dependence of gating current in myelinated nerve fibers,” Journal of Membrane Biology, vol. 112, no. 3. Springer, pp. 277–289, 1989.
LibreCat: https://research-explorer.ista.ac.at/record/3465
DOI: 10.1007/BF01870958
PMID: 2559205 

H. Edelsbrunner and S. Skiena, “Probing convex polygons with X-Rays,” SIAM Journal on Computing, vol. 17, no. 5. SIAM, pp. 870–882, 1988.
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054 

N. H. Barton, “Speciation,” in Analytical biogeography: An integrated approach to the study of animal and plant distributions, 1st ed., A. Myers and P. Giller, Eds. Springer, 1988, pp. 185–218.
LibreCat: https://research-explorer.ista.ac.at/record/4317
DOI: 10.1007/978-94-009-0435-4

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 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 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

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

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, 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

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