Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260.
LibreCat: https://research-explorer.ista.ac.at/record/4069
DOI: 10.1007/BF02122779

Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous Robot Vehicles. , 328–341.
LibreCat: https://research-explorer.ista.ac.at/record/3565
DOI: 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. 85(409), 115–119.
LibreCat: https://research-explorer.ista.ac.at/record/4064
DOI: 10.1080/01621459.1990.10475313

Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.
LibreCat: https://research-explorer.ista.ac.at/record/4065
DOI: 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. 5(1), 99–160.
LibreCat: https://research-explorer.ista.ac.at/record/4074
DOI: 10.1007/BF02187783

Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. Proceedings of the 6th annual symposium on computational geometry. SCG: Symposium on Computational Geometry, 116–127.
LibreCat: https://research-explorer.ista.ac.at/record/4078
DOI: 10.1145/98524.98551

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990.  Euclidean minimum spanning trees and bichromatic closest pairs. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 203–210.
LibreCat: https://research-explorer.ista.ac.at/record/4076
DOI: 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. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 112–115.
LibreCat: https://research-explorer.ista.ac.at/record/4077
DOI: 10.1145/98524.98548

Henzinger TA, Manna Z, Pnueli A. 1990. An interleaving model for real time.  Proceedings of the 5th Jerusalem Conference on Information Technology. JCIT: Jerusalem Conference on Information Technology, 717–730.
LibreCat: https://research-explorer.ista.ac.at/record/4510
DOI: 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. 4(1), 433–466.
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.
LibreCat: https://research-explorer.ista.ac.at/record/4083
DOI: 10.1137/0218025

Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 145–151.
LibreCat: https://research-explorer.ista.ac.at/record/4085
DOI: 10.1145/73833.73850

Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &; Computational Geometry. 4(4), 337–343.
LibreCat: https://research-explorer.ista.ac.at/record/4086
DOI: 10.1007/BF02187734

Jonas PM. 1989. Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. 112(3), 277–289.
LibreCat: https://research-explorer.ista.ac.at/record/3465
DOI: 10.1007/BF01870958
PMID: 2559205 

Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points that always enclose many points. Geometriae Dedicata. 32(1), 1–12.
LibreCat: https://research-explorer.ista.ac.at/record/4080
DOI: 10.1007/BF00181432

Barton NH. 1989. The divergence of a polygenic system under stabilising selection, mutation and drift. Genetical Research. 54(1), 59–78.
LibreCat: https://research-explorer.ista.ac.at/record/4314
DOI: 10.1017/S0016672300028378
PMID: 2806907

Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.
LibreCat: https://research-explorer.ista.ac.at/record/4596
DOI: 10.1109/SFCS.1989.63473

Mizuno N, Ueyama T, Itoh K, Satoda T, Tashiro T, Shigemoto R. 1988. Direct projections from the subthalamic nucleus of Luys to the spinal cord in the Japanese monkey. Neuroscience Letters. 89(1), 13–18.
LibreCat: https://research-explorer.ista.ac.at/record/2523
DOI: 10.1016/0304-3940(88)90473-9
PMID: 2456494

Edelsbrunner H, Preparata F. 1988. Minimum polygonal separation. Information and Computation. 77(3), 218–232.
LibreCat: https://research-explorer.ista.ac.at/record/4090
DOI: 10.1016/0890-5401(88)90049-1

Edelsbrunner H, Skiena S. 1988. Probing convex polygons with X-Rays. SIAM Journal on Computing. 17(5), 870–882.
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054