Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete &; Computational Geometry 5 (1990) 99–160.
LibreCat: https://research-explorer.ista.ac.at/record/4074
DOI: 10.1007/BF02187783

 Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.
LibreCat: https://research-explorer.ista.ac.at/record/4076
DOI: 10.1145/98524.98567

Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.
LibreCat: https://research-explorer.ista.ac.at/record/4077
DOI: 10.1145/98524.98548

Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
LibreCat: https://research-explorer.ista.ac.at/record/4075
DOI: 10.1007/BF01840404

Population structure and processes in evolution
N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.
LibreCat: https://research-explorer.ista.ac.at/record/4311
DOI: 10.1007/978-3-642-74474-7_5

Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete &; Computational Geometry 4 (1989) 433–466.
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

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

Testing the necklace condition for shortest tours and optimal factors in the plane
H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.
LibreCat: https://research-explorer.ista.ac.at/record/4084
DOI: 10.1016/0304-3975(89)90133-3

Tetrahedrizing point sets in three dimensions
H. Edelsbrunner, F. Preparata, D. West, in:,  International Symposium on Symbolic and Algebraic Computation, Springer, 1989, pp. 315–331.
LibreCat: https://research-explorer.ista.ac.at/record/4087
DOI: 10.1007/3-540-51084-2_31

Direct projections from the subthalamic nucleus of Luys to the spinal cord in the Japanese monkey
N. Mizuno, T. Ueyama, K. Itoh, T. Satoda, T. Tashiro, R. Shigemoto, Neuroscience Letters 89 (1988) 13–18.
LibreCat: https://research-explorer.ista.ac.at/record/2523
DOI: 10.1016/0304-3940(88)90473-9
PMID: 2456494

Arrangements of curves in the plane - topology, combinatorics, and algorithms
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 214–229.
LibreCat: https://research-explorer.ista.ac.at/record/4097
DOI: 10.1007/3-540-19488-6_118

Geometric structures in computational geometry
H. Edelsbrunner, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 201–213.
LibreCat: https://research-explorer.ista.ac.at/record/4096
DOI: 10.1007/3-540-19488-6_117

Linear space data structures for two types of range search
B. Chazelle, H. Edelsbrunner, Discrete &; Computational Geometry 2 (1987) 113–126.
LibreCat: https://research-explorer.ista.ac.at/record/4100
DOI: 10.1007/BF02187875

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

Sibling competition and the advantage of mixed families
N.H. Barton, R.J. Post, Journal of Theoretical Biology 120 (1986) 381–387.
LibreCat: https://research-explorer.ista.ac.at/record/4323
DOI: 10.1016/S0022-5193(86)80033-9

Edge-skeletons in arrangements with applications
H. Edelsbrunner, Algorithmica 1 (1986) 93–109.
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438

The number of extreme pairs of finite point-sets in Euclidean spaces
H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

The complexity of cells in 3-dimensional arrangements
H. Edelsbrunner, D. Haussler, Discrete Mathematics 60 (1986) 139–146.
LibreCat: https://research-explorer.ista.ac.at/record/4107
DOI: 10.1016/0012-365X(86)90008-7

Finding extreme-points in 3-dimensions and solving the post-office problem in the plane
H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.
LibreCat: https://research-explorer.ista.ac.at/record/4111
DOI: 10.1016/0020-0190(85)90107-3

Efficient algorithms for agglomerative hierarchical clustering methods
W. Day, H. Edelsbrunner, Journal of Classification 1 (1984) 7–24.
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115