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, P. M. (1989). Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. Springer. https://doi.org/10.1007/BF01870958
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. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 214–229). Tampere, Finland: Springer. https://doi.org/10.1007/3-540-19488-6_118
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner, H. (1988). Geometric structures in computational geometry. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 201–213). Tampere, Finland: Springer. https://doi.org/10.1007/3-540-19488-6_117
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. SIAM. https://doi.org/10.1137/0217054
View
| DOI
| Download None (ext.)
1988 | Book Chapter | IST-REx-ID: 4317
Barton, N. H. (1988). Speciation. In A. Myers & P. Giller (Eds.), Analytical biogeography: An integrated approach to the study of animal and plant distributions (1st ed., pp. 185–218). Springer. https://doi.org/10.1007/978-94-009-0435-4
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4100
Chazelle, B., & Edelsbrunner, H. (1987). Linear space data structures for two types of range search. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187875
View
| DOI
1987 | Book | IST-REx-ID: 3900
Edelsbrunner, H. (1987). Algorithms in Combinatorial Geometry (Vol. 10). Berlin ; Heidelberg: Springer. https://doi.org/10.1007/978-3-642-61568-9
View
| Files available
| DOI
1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner, H., Guibas, L., & Stolfi, J. (1986). Optimal point location in a monotone subdivision. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0215023
View
| 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. Elsevier. https://doi.org/10.1016/0097-3165(86)90078-6
[Published Version]
View
| DOI
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. Algorithmica. Springer. https://doi.org/10.1007/BF01840438
View
| DOI
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. Elsevier. https://doi.org/10.1016/0097-3165(86)90075-0
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner, H., & Haussler, D. (1986). The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. Elsevier. https://doi.org/10.1016/0012-365X(86)90008-7
View
| DOI
1985 | Journal Article | IST-REx-ID: 4112
Edelsbrunner, H., & Overmars, M. (1985). Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. Elsevier. https://doi.org/10.1016/0196-6774(85)90030-6
View
| DOI
1985 | Journal Article | IST-REx-ID: 4111
Edelsbrunner, H., & Maurer, H. (1985). Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(85)90107-3
View
| DOI
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. Elsevier. https://doi.org/10.1016/S0747-7171(85)80028-6
[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. Springer. https://doi.org/10.1007/BF01890115
View
| DOI
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner, H. (1984). Key-problems and key-methods in computational geometry. In 1st Symposium of Theoretical Aspects of Computer Science (Vol. 166, pp. 1–13). Paris, France: Springer. https://doi.org/10.1007/3-540-12920-0_1
View
| DOI
1984 | Conference Paper | IST-REx-ID: 3513
Dobkin, D., & Edelsbrunner, H. (1984). Ham-sandwich theorems applied to intersection problems. In 9th International Workshop on Graph Theoretic Concepts in Computer Science (pp. 88–99). Haus Ohrbeck, Germany: Teubner.
View
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner, H., & Welzl, E. (1984). Monotone edge sequences in line arrangements and applications. In 11th International Symposium on Mathematical Foundations of Computer Science (Vol. 176, pp. 265–272). Praha, Czechoslovakia: Springer. https://doi.org/10.1007/BFb0030307
View
| DOI
1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner, H., Overmars, M., & Wood, D. (1983). Graphics in Flatland: a case study. In F. Preparata (Ed.), Computational Geometry: Theory and Applications (Vol. 1, pp. 35–59). Elsevier.
View