Sanderson, N., Szymura, J., &; Barton, N. H. (1992). Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata. Evolution. Wiley-Blackwell.https://doi.org/10.1111/j.1558-5646.1992.tb02068.x 

Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., &; Tan, T. (1992). Edge insertion for optimal triangulations. In I. Simon (Ed.), 1st Latin American Symposium on Theoretical Informatics (Vol. 583, pp. 46–60). São Paulo, Brazil: Springer.https://doi.org/10.1007/BFb0023816 

Henzinger, T. A., Manna, Z., &; Pnueli, A. (1992). What good are digital clocks? In 19th International Colloquium on Automata, Languages and Programming (Vol. 623, pp. 545–558). Vienna, Austria: Springer.https://doi.org/10.1007/3-540-55719-9_103 

Masu, M., Tanabe, Y., Tsuchida, K., Shigemoto, R., &; Nakanishi, S. (1991). Sequence and expression of a metabotropic glutamate receptor. Nature. Nature Publishing Group.https://doi.org/10.1038/349760a0 

Edelsbrunner, H., &; Sharir, M. (1991). A hyperplane incidence problem with applications to counting distances. In Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift (Vol. 4, pp. 253–263). American Mathematical Society.

Edelsbrunner, H., &; Hajnal, P. (1991). A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(91)90042-F 

Edelsbrunner, H., Seidel, R., &; Sharir, M. (1991). On the zone theorem for hyperplane arrangements (Vol. 555, pp. 108–123). Presented at the New Results and New Trends in Computer Science , Springer.https://doi.org/10.1007/BFb0038185 

Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., &; Snoeyink, J. (1991). Ray shooting in polygons using geodesic triangulations. In 18th International Colloquium on Automata, Languages and Programming (Vol. 510, pp. 661–673). Madrid, Spain: Springer.https://doi.org/10.1007/3-540-54233-7_172 

Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &; Welzl, E. (1991). Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574698 

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