Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.”https://doi.org/10.1137/0217054 __SIAM Journal on Computing. SIAM, 1988.https://doi.org/10.1137/0217054  .
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054 

Barton, Nicholas H. “Speciation.”https://doi.org/10.1007/978-94-009-0435-4__In Analytical Biogeography: An Integrated Approach to the Study of Animal and Plant Distributions, edited by Alan Myers and Paul Giller, 1st ed., 185–218. Springer, 1988.https://doi.org/10.1007/978-94-009-0435-4 .
LibreCat: https://research-explorer.ista.ac.at/record/4317
DOI: 10.1007/978-94-009-0435-4

Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.”https://doi.org/10.1007/BF02187875__Discrete &; Computational Geometry. Springer, 1987.https://doi.org/10.1007/BF02187875 .
LibreCat: https://research-explorer.ista.ac.at/record/4100
DOI: 10.1007/BF02187875

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

Edelsbrunner, Herbert, Leonidas Guibas, and Jorge Stolfi. “Optimal Point Location in a Monotone Subdivision.”https://doi.org/10.1137/0215023__SIAM Journal on Computing. SIAM, 1986.https://doi.org/10.1137/0215023 .
LibreCat: https://research-explorer.ista.ac.at/record/4104
DOI: 10.1137/0215023

Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.”https://doi.org/10.1016/0097-3165(86)90078-6__Journal of Combinatorial Theory Series A. Elsevier, 1986.https://doi.org/10.1016/0097-3165(86)90078-6 .
LibreCat: https://research-explorer.ista.ac.at/record/4103
DOI: 10.1016/0097-3165(86)90078-6

Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.”https://doi.org/10.1007/BF01840438__Algorithmica. Springer, 1986.https://doi.org/10.1007/BF01840438 .
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438

Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.”https://doi.org/10.1016/0097-3165(86)90075-0__Journal of Combinatorial Theory Series A. Elsevier, 1986.https://doi.org/10.1016/0097-3165(86)90075-0 .
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.”https://doi.org/10.1016/0012-365X(86)90008-7__Discrete Mathematics. Elsevier, 1986.https://doi.org/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.”https://doi.org/10.1016/0196-6774(85)90030-6__Journal of Algorithms. Elsevier, 1985.https://doi.org/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.”https://doi.org/10.1016/0020-0190(85)90107-3__Information Processing Letters. Elsevier, 1985.https://doi.org/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.”https://doi.org/10.1016/S0747-7171(85)80028-6__Journal of Symbolic Computation. Elsevier, 1985.https://doi.org/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.”https://doi.org/10.1007/BF01890115__Journal of Classification. Springer, 1984.https://doi.org/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.”https://doi.org/10.1007/3-540-12920-0_1__In 1st Symposium of Theoretical Aspects of Computer Science, 166:1–13. STACS. Springer, 1984.https://doi.org/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.” In 9th International Workshop on Graph Theoretic Concepts in Computer Science, 88–99. WG. Teubner, 1984.
LibreCat: https://research-explorer.ista.ac.at/record/3513

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

Edelsbrunner, Herbert, Mark Overmars, and Derick Wood. “Graphics in Flatland: A Case Study.” In Computational Geometry: Theory and Applications, edited by Franco Preparata, 1:35–59. Elsevier, 1983.
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).”https://doi.org/10.1016/S0003-3472(83)80100-6__Animal Behaviour. Elsevier, 1983.https://doi.org/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.”https://doi.org/10.1016/0020-0190(81)90053-3__Information Processing Letters. Elsevier, 1981.https://doi.org/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.” In Evolution and Speciation, edited by William Atchley and David Woodruff, 109–45. Cambridge University Press, 1981.
LibreCat: https://research-explorer.ista.ac.at/record/4332