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
Jonas PM. 1989. Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. 112(3), 277–289.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1988. Arrangements of curves in the plane - topology, combinatorics, and algorithms. 15th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 317, 214–229.
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner H. 1988. Geometric structures in computational geometry. 15th International Colloquium on Automata, Languages and Programming. ALP: Automata, Languages and Programming, LNCS, vol. 317, 201–213.
View
| DOI
| Download None (ext.)
1988 | Journal Article | IST-REx-ID: 4091
Edelsbrunner H, Skiena S. 1988. Probing convex polygons with X-Rays. SIAM Journal on Computing. 17(5), 870–882.
View
| DOI
| Download None (ext.)
1988 | Book Chapter | IST-REx-ID: 4317
Barton NH. 1988.Speciation. In: Analytical biogeography: An integrated approach to the study of animal and plant distributions. , 185–218.
View
| DOI
| Download None (ext.)
1987 | Book | IST-REx-ID: 3900
Edelsbrunner H. 1987. Algorithms in Combinatorial Geometry, Berlin ; Heidelberg: Springer, XV, 423p.
View
| Files available
| DOI
1986 | Journal Article | IST-REx-ID: 4103 |
Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 4098 |
Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.
View
| DOI
| Download None (ext.)
1985 | Journal Article | IST-REx-ID: 4120 |
Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1(1), 47–56.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1984 | Journal Article | IST-REx-ID: 4121
Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.
View
| DOI
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 3513
Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection problems. 9th International Workshop on Graph Theoretic Concepts in Computer Science. WG: International Workshop on Graph Theoretic Concepts in Computer ScienceWG, 88–99.
View
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. 11th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS, vol. 176, 265–272.
View
| DOI
1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study. In: Computational Geometry: Theory and Applications. Advances in Computing Research, vol. 1, 35–59.
View