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.
624 Publications
1991 |Published| Journal Article | IST-REx-ID: 4061 | 
Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi:10.1007/BF02574698.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4066
Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.
View
| DOI
| Download None (ext.)
1990 |Published| Journal Article | IST-REx-ID: 4074
Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.
View
| DOI
| Download None (ext.)
1989 |Published| Journal Article | IST-REx-ID: 4088 |
Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 |Published| Journal Article | IST-REx-ID: 3465
Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve Fibers.” Journal of Membrane Biology, vol. 112, no. 3, Springer, 1989, pp. 277–89, doi:10.1007/BF01870958.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1988 |Published| Book Chapter | IST-REx-ID: 4317
Barton, Nicholas H. “Speciation.” Analytical Biogeography: An Integrated Approach to the Study of Animal and Plant Distributions, edited by Alan Myers and Paul Giller, 1st ed., Springer, 1988, pp. 185–218, doi:10.1007/978-94-009-0435-4.
View
| DOI
| Download None (ext.)
1987 |Published| Journal Article | IST-REx-ID: 4094
Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.” Information Processing Letters, vol. 26, no. 2, Elsevier, 1987, pp. 61–64, doi:10.1016/0020-0190(87)90038-X.
View
| DOI
| Download None (ext.)
1986 |Published| Journal Article | IST-REx-ID: 4098 |
Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series A, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi:10.1016/0097-3165(86)90075-0.
View
| DOI
| Download None (ext.)
1982 |Published| Journal Article | IST-REx-ID: 4130
Edelsbrunner, Herbert, et al. “Polygonal Intersection Searching.” Information Processing Letters, vol. 14, no. 2, Elsevier, 1982, pp. 74–79, doi:10.1016/0020-0190(82)90090-4.
View
| DOI