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 

Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., &; Snoeyink, J. (1990). Counting and cutting cycles of lines and rods in space. In 31st Annual Symposium on Foundations of Computer Science (pp. 242–251). St. Louis, MO, United States of America: IEEE.https://doi.org/10.1109/FSCS.1990.89543 

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 

Bräu, M., Dreyer, F., Jonas, P. M., Repp, H., &; Vogel, W. (1990). A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. Journal of Physiology. Wiley-Blackwell.https://doi.org/10.1113/jphysiol.1990.sp017918 

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., &; Mücke, E. (1990). Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. ACM.https://doi.org/10.1145/77635.77639 

Edelsbrunner, H., Preparata, F., &; West, D. (1990). Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/S0747-7171(08)80068-5 

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 

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