Nakanishi, S., Ohkubo, H., Kakizuka, A., Yokota, Y., Shigemoto, R., Sasai, Y., &; Takumi, T. (1991). Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In Recent Progress in Hormone Research (Vol. 46, pp. 59–83). The Endocrine Society.https://doi.org/10.1016/b978-0-12-571146-3.50007-9 

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 

Szymura, J., &; Barton, N. H. (1991). The genetic structure of the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata: comparisons between transects and between loci. Evolution. Wiley-Blackwell.https://doi.org/10.1111/j.1558-5646.1991.tb04400.x 

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 

Shigemoto, R., Yokota, Y., Tsuchida, K., &; Nakanishi, S. (1990). Cloning and expression of a rat neuromedin K receptor cDNA. Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology.https://doi.org/10.1016/s0021-9258(19)40095-1  

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., Overmars, M., Welzl, E., Hartman, I., &; Feldman, J. (1990). Ranking intervals under visibility constraints. International Journal of Computer Mathematics. Taylor &; Francis.https://doi.org/10.1080/00207169008803871 

Edelsbrunner, H., Tan, T., &; Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In Proceedings of the 6th annual symposium on Computational geometry (pp. 44–52). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98535 

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

Edelsbrunner, H. (1990). An acyclicity theorem for cell complexes in d dimension. Combinatorica. Springer.https://doi.org/10.1007/BF02122779 

Dobkin, D., Edelsbrunner, H., &; Yap, C. (1990). Probing convex polytopes. In I. Cox &; G. Wilfong (Eds.), Autonomous Robot Vehicles (pp. 328–341). Springer.https://doi.org/10.1007/978-1-4613-8997-2_25 

Edelsbrunner, H., &; Souvaine, D. (1990). Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. American Statistical Association.https://doi.org/10.1080/01621459.1990.10475313 

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 

Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., &; Sharir, M. (1990). Slimming down by adding; selecting heavily covered points. In Proceedings of the 6th annual symposium on computational geometry (pp. 116–127). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98551 

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 

Henzinger, T. A., Manna, Z., &; Pnueli, A. (1990). An interleaving model for real time. In https://doi.org/10.1109/JCIT.1990.128356__Proceedings of the 5th Jerusalem Conference on Information Technology (pp. 717–730). Jerusalem, Israel: IEEE.https://doi.org/10.1109/JCIT.1990.128356 

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