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

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

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

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, 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. “The Genetic Basis of Hybrid Inviability between Two Chromosomal Races of the Grasshopper Podisma Pedestris.”https://doi.org/10.1038/hdy.1981.98__Heredity. Springer Nature, 1981.https://doi.org/10.1038/hdy.1981.98 .
LibreCat: https://research-explorer.ista.ac.at/record/4333
DOI: 10.1038/hdy.1981.98