Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
2006 Publications
1991 | Journal Article | IST-REx-ID: 4061 | 
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
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 | Journal Article | IST-REx-ID: 2480 |
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
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1990 | Journal Article | IST-REx-ID: 4066
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
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4070
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
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4071
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
View
| DOI
| Download None (ext.)