Barton, N. H. (1990). Pleiotropic models of quantitative variation. Genetics. Genetics Society of America.https://doi.org/10.1093/genetics/124.3.773  

Edelsbrunner, H., &; Sharir, M. (1990). A hyperplane Incidence problem with applications to counting distances. In Proceedings of the International Symposium on Algorithms (Vol. 450, pp. 419–428). Tokyo, Japan: Springer.https://doi.org/10.1007/3-540-52921-7_91 

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

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

Edelsbrunner, H., Robison, A., &; Shen, X. (1990). Covering convex sets with non-overlapping polygons. Discrete Mathematics. Elsevier.https://doi.org/10.1016/0012-365X(90)90147-A 

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

Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &; Welzl, E. (1990).https://doi.org/10.1145/98524.98567__Euclidean minimum spanning trees and bichromatic closest pairs. In Proceedings of the 6th annual symposium on Computational geometry (pp. 203–210). Berkeley, CA, United States: ACM.https://doi.org/10.1145/98524.98567 

Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &; Wenger, R. (1990). Points and triangles in the plane and halving planes in space. In Proceedings of the 6th annual symposium on Computational geometry (pp. 112–115). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98548 

Dobkin, D., Edelsbrunner, H., &; Overmars, M. (1990). Searching for empty convex polygons. Algorithmica. Springer.https://doi.org/10.1007/BF01840404 

Barton, N. H., &; Clark, A. (1990). Population structure and processes in evolution. In K. Wöhrmann &; S. Jain (Eds.), Population biology: Ecological and evolutionary viewpoints (pp. 115–174). Springer.https://doi.org/10.1007/978-3-642-74474-7_5 

Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., &; Welzl, E. (1989). Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187742 

Yao, F., Dobkin, D., Edelsbrunner, H., &; Paterson, M. (1989). Partitioning space for range queries. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0218025 

Edelsbrunner, H., Rote, G., &; Welzl, E. (1989). Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/0304-3975(89)90133-3 

Edelsbrunner, H., Preparata, F., &; West, D. (1989). Tetrahedrizing point sets in three dimensions. In https://doi.org/10.1007/3-540-51084-2_31__International Symposium on Symbolic and Algebraic Computation (Vol. 358, pp. 315–331). Rome, Italy: Springer.https://doi.org/10.1007/3-540-51084-2_31 

Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R., &; Sharir, M. (1988). Arrangements of curves in the plane - topology, combinatorics, and algorithms. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 214–229). Tampere, Finland: Springer.https://doi.org/10.1007/3-540-19488-6_118 

Edelsbrunner, H. (1988). Geometric structures in computational geometry. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 201–213). Tampere, Finland: Springer.https://doi.org/10.1007/3-540-19488-6_117 

Chazelle, B., &; Edelsbrunner, H. (1987). Linear space data structures for two types of range search. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187875 

Edelsbrunner, H. (1987). Algorithms in Combinatorial Geometry (Vol. 10). Berlinf; Heidelberg: Springer.https://doi.org/10.1007/978-3-642-61568-9 

Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. Algorithmica. Springer.https://doi.org/10.1007/BF01840438 

Edelsbrunner, H., &; Stöckl, G. (1986). The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(86)90075-0