Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. 1989;4(1):433-466. doi:10.1007/BF02187742
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries. SIAM Journal on Computing. 1989;18(2):371-384. doi:10.1137/0218025
LibreCat: https://research-explorer.ista.ac.at/record/4083
DOI: 10.1137/0218025

Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 1989;66(2):157-180. doi: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 H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. In: 10.1007/3-540-51084-2_31__International Symposium on Symbolic and Algebraic Computation. Vol 358. Springer; 1989:315-331. doi: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 PM. Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. 1989;112(3):277-289. doi:10.1007/BF01870958
LibreCat: https://research-explorer.ista.ac.at/record/3465
DOI: 10.1007/BF01870958
PMID: 2559205 

Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements of curves in the plane - topology, combinatorics, and algorithms. In: 15th International Colloquium on Automata, Languages and Programming. Vol 317. Springer; 1988:214-229. doi: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 H. Geometric structures in computational geometry. In: 15th International Colloquium on Automata, Languages and Programming. Vol 317. Springer; 1988:201-213. doi: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 H, Skiena S. Probing convex polygons with X-Rays. SIAM Journal on Computing. 1988;17(5):870-882. doi:10.1137/0217054 
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054 

Barton NH. Speciation. In: Myers A, Giller P, eds. Analytical Biogeography: An Integrated Approach to the Study of Animal and Plant Distributions. 1st ed. Springer; 1988:185-218. doi: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 B, Edelsbrunner H. Linear space data structures for two types of range search. Discrete &; Computational Geometry. 1987;2(1):113-126. doi:10.1007/BF02187875
LibreCat: https://research-explorer.ista.ac.at/record/4100
DOI: 10.1007/BF02187875

Edelsbrunner H. Algorithms in Combinatorial Geometry. Vol 10. Berlinf; Heidelberg: Springer; 1987. doi: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 H, Guibas L, Stolfi J. Optimal point location in a monotone subdivision. SIAM Journal on Computing. 1986;15(2):317-340. doi:10.1137/0215023
LibreCat: https://research-explorer.ista.ac.at/record/4104
DOI: 10.1137/0215023

Edelsbrunner H, Welzl E. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 1986;41(2):159-166. doi: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 H. Edge-skeletons in arrangements with applications. Algorithmica. 1986;1(1-4):93-109. doi:10.1007/BF01840438
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438

Edelsbrunner H, Stöckl G. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 1986;43(2):344-349. doi: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 H, Haussler D. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 1986;60(C):139-146. doi: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 H, Overmars M. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. 1985;6(4):515-542. doi: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 H, Maurer H. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 1985;21(1):39-47. doi: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 B, Edelsbrunner H. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1985;1(1):47-56. doi: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 W, Edelsbrunner H. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1984;1:7-24. doi:10.1007/BF01890115
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115