Nakanishi, Shigetada, et al. “Molecular Characterization of Mammalian Tachykinin Receptors and a Possible Epithelial Potassium Channel.”10.1016/b978-0-12-571146-3.50007-9__Recent Progress in Hormone Research, vol. 46, The Endocrine Society, 1991, pp. 59–83, doi:10.1016/b978-0-12-571146-3.50007-9.

Edelsbrunner, Herbert, et al. On the Zone Theorem for Hyperplane Arrangements. Vol. 555, Springer, 1991, pp. 108–23, doi:10.1007/BFb0038185.

Szymura, Jacek, and Nicholas H. Barton. “The Genetic Structure of the Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata: Comparisons between Transects and between Loci.”10.1111/j.1558-5646.1991.tb04400.x__Evolution, vol. 45, no. 2, Wiley-Blackwell, 1991, pp. 237–61, doi:10.1111/j.1558-5646.1991.tb04400.x.

Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”10.1007/BF02574698__Discrete &; Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi:10.1007/BF02574698.

Shigemoto, Ryuichi, et al. “Cloning and Expression of a Rat Neuromedin K Receptor CDNA.”10.1016/s0021-9258(19)40095-1 __Journal of Biological Chemistry, vol. 265, no. 2, American Society for Biochemistry and Molecular Biology, 1990, pp. 623–28, doi:10.1016/s0021-9258(19)40095-1 .

Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.”10.1007/BF02187785__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.

Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.”10.1080/00207169008803871__International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor &; Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.

Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.”10.1145/98524.98535__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.

Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n2.”10.1007/BF02187778__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:10.1007/BF02187778.

Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”10.1007/BF02122779__Combinatorica, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:10.1007/BF02122779.

Dobkin, David, et al. “Probing Convex Polytopes.”10.1007/978-1-4613-8997-2_25__Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi:10.1007/978-1-4613-8997-2_25.

Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.”10.1080/01621459.1990.10475313__Journal of the American Statistical Association, vol. 85, no. 409, American Statistical Association, 1990, pp. 115–19, doi:10.1080/01621459.1990.10475313.

Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.”10.1016/0012-365X(90)90147-A__Discrete Mathematics, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:10.1016/0012-365X(90)90147-A.

Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”10.1007/BF02187783__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.

Chazelle, Bernard, et al. “Slimming down by Adding; Selecting Heavily Covered Points.”10.1145/98524.98551__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–27, doi:10.1145/98524.98551.

Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”10.1145/98524.98567__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.

Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.”10.1145/98524.98548__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.

Henzinger, Thomas A., et al. “An Interleaving Model for Real Time.”10.1109/JCIT.1990.128356__10.1109/JCIT.1990.128356__Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–30, doi:10.1109/JCIT.1990.128356.

Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.”10.1007/BF02187742__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.

Yao, F., et al. “Partitioning Space for Range Queries.”10.1137/0218025__SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.