Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. 1990;5(1):197-216. doi:10.1007/BF02187785

Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete &; Computational Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784

Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 1990;34(3-4):129-144. doi:10.1080/00207169008803871

Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2. Discrete &; Computational Geometry. 1990;5(1):35-42. doi:10.1007/BF02187778

Dobkin D, Edelsbrunner H, Yap C. Probing convex polytopes. In: Cox I, Wilfong G, eds. Autonomous Robot Vehicles. Springer; 1990:328-341. doi:10.1007/978-1-4613-8997-2_25

Edelsbrunner H, Souvaine D. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 1990;85(409):115-119. doi:10.1080/01621459.1990.10475313

Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete &; Computational Geometry. 1990;5(1):99-160. doi:10.1007/BF02187783

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E.10.1145/98524.98567__Euclidean minimum spanning trees and bichromatic closest pairs. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:203-210. doi:10.1145/98524.98567

Ino T, Itoh K, Kamiya H, et al. Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. Brain Research. 1989;479(1):157-161. doi:10.1016/0006-8993(89)91346-2

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

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

Barton NH. The divergence of a polygenic system under stabilising selection, mutation and drift. Genetical Research. 1989;54(1):59-78. doi:10.1017/S0016672300028378

Edelsbrunner H, Skiena S. Probing convex polygons with X-Rays. SIAM Journal on Computing. 1988;17(5):870-882. doi:10.1137/0217054 

Edelsbrunner H, Pach J, Schwartz J, Sharir M. On the lower envelope of bivariate functions and its applications. In: 28th Annual Symposium on Foundations of Computer Science . IEEE; 1987:27-37. doi:10.1109/SFCS.1987.44

Barton NH, Rouhani S. The frequency of shifts between alternative equilibria. Journal of Theoretical Biology. 1987;125(4):397-418. doi:10.1016/S0022-5193(87)80210-2

Edelsbrunner H, O’Rourke J, Seidel R. Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. 1986;15(2):341-363. doi:10.1137/0215024

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

Szymura J, Barton NH. Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland. Evolution; International Journal of Organic Evolution. 1986;40:1141-1159. doi:10.1111/j.1558-5646.1986.tb05740.x

Edelsbrunner H. Edge-skeletons in arrangements with applications. Algorithmica. 1986;1(1-4):93-109. doi:10.1007/BF01840438

Edelsbrunner H, Welzl E. On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory Series A. 1985;38(1):15-29. doi:10.1016/0097-3165(85)90017-2