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.
1949 Publications
1989 | Journal Article | IST-REx-ID: 3465
P. M. Jonas, “Temperature dependence of gating current in myelinated nerve fibers,” Journal of Membrane Biology, vol. 112, no. 3. Springer, pp. 277–289, 1989.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1988 | Conference Paper | IST-REx-ID: 4097
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” in 15th International Colloquium on Automata, Languages and Programming, Tampere, Finland, 1988, vol. 317, pp. 214–229.
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4096
H. Edelsbrunner, “Geometric structures in computational geometry,” in 15th International Colloquium on Automata, Languages and Programming, Tampere, Finland, 1988, vol. 317, pp. 201–213.
View
| DOI
| Download None (ext.)
1988 | Journal Article | IST-REx-ID: 4091
H. Edelsbrunner and S. Skiena, “Probing convex polygons with X-Rays,” SIAM Journal on Computing, vol. 17, no. 5. SIAM, pp. 870–882, 1988.
View
| DOI
| Download None (ext.)
1988 | Book Chapter | IST-REx-ID: 4317
N. H. Barton, “Speciation,” in Analytical biogeography: An integrated approach to the study of animal and plant distributions, 1st ed., A. Myers and P. Giller, Eds. Springer, 1988, pp. 185–218.
View
| DOI
| Download None (ext.)
1987 | Book | IST-REx-ID: 3900
H. Edelsbrunner, Algorithms in Combinatorial Geometry, vol. 10. Berlin ; Heidelberg: Springer, 1987.
View
| Files available
| DOI
1986 | Journal Article | IST-REx-ID: 4103 | 
H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” Journal of Combinatorial Theory Series A, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 4098 |
H. Edelsbrunner and G. 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, pp. 344–349, 1986.
View
| DOI
| Download None (ext.)
1985 | Journal Article | IST-REx-ID: 4120 |
B. Chazelle and H. Edelsbrunner, “Optimal solutions for a class of point retrieval problems,” Journal of Symbolic Computation, vol. 1, no. 1. Elsevier, pp. 47–56, 1985.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1984 | Journal Article | IST-REx-ID: 4121
W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” Journal of Classification, vol. 1. Springer, pp. 7–24, 1984.
View
| DOI
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 3513
D. Dobkin and H. Edelsbrunner, “Ham-sandwich theorems applied to intersection problems,” in 9th International Workshop on Graph Theoretic Concepts in Computer Science, Haus Ohrbeck, Germany, 1984, pp. 88–99.
View
| Download None (ext.)
1983 | Book Chapter | IST-REx-ID: 3563
H. Edelsbrunner, M. Overmars, and D. Wood, “Graphics in Flatland: a case study,” in Computational Geometry: Theory and Applications, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 35–59.
View