Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.”https://doi.org/10.1007/BF02187742__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187742 .
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.”https://doi.org/10.1137/0218025__SIAM Journal on Computing. SIAM, 1989.https://doi.org/10.1137/0218025 .
LibreCat: https://research-explorer.ista.ac.at/record/4083
DOI: 10.1137/0218025

Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.”https://doi.org/10.1016/0304-3975(89)90133-3__Theoretical Computer Science. Elsevier, 1989.https://doi.org/10.1016/0304-3975(89)90133-3 .
LibreCat: https://research-explorer.ista.ac.at/record/4084
DOI: 10.1016/0304-3975(89)90133-3

Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.”https://doi.org/10.1007/3-540-51084-2_31__In https://doi.org/10.1007/3-540-51084-2_31__International Symposium on Symbolic and Algebraic Computation, 358:315–31. Springer, 1989.https://doi.org/10.1007/3-540-51084-2_31 .
LibreCat: https://research-explorer.ista.ac.at/record/4087
DOI: 10.1007/3-540-51084-2_31

Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve Fibers.”https://doi.org/10.1007/BF01870958__Journal of Membrane Biology. Springer, 1989.https://doi.org/10.1007/BF01870958 .
LibreCat: https://research-explorer.ista.ac.at/record/3465
DOI: 10.1007/BF01870958
PMID: 2559205 

Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.”https://doi.org/10.1007/3-540-19488-6_118__In 15th International Colloquium on Automata, Languages and Programming, 317:214–29. Springer, 1988.https://doi.org/10.1007/3-540-19488-6_118 .
LibreCat: https://research-explorer.ista.ac.at/record/4097
DOI: 10.1007/3-540-19488-6_118

Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry.”https://doi.org/10.1007/3-540-19488-6_117__In 15th International Colloquium on Automata, Languages and Programming, 317:201–13. Springer, 1988.https://doi.org/10.1007/3-540-19488-6_117 .
LibreCat: https://research-explorer.ista.ac.at/record/4096
DOI: 10.1007/3-540-19488-6_117

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