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.
1481 Publications
1991 |Published| Journal Article | IST-REx-ID: 4061 | 
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
[Published Version]
View
| DOI
| Download Published Version (ext.)
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
1991 |Published| Conference Paper | IST-REx-ID: 4508
Temporal proof methodologies for real-time systems
T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–366.
View
| DOI
| Download None (ext.)
T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–366.
1990 |Published| Conference Paper | IST-REx-ID: 4067
A hyperplane Incidence problem with applications to counting distances
H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.
1990 |Published| Journal Article | IST-REx-ID: 4066
The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
1990 |Published| Journal Article | IST-REx-ID: 4072
The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
1990 |Published| Journal Article | IST-REx-ID: 4070
Ranking intervals under visibility constraints
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.
1990 |Published| Journal Article | IST-REx-ID: 4068
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
1990 |Published| Book Chapter | IST-REx-ID: 3565
Probing convex polytopes
D. Dobkin, H. Edelsbrunner, C. Yap, in:, I. Cox, G. Wilfong (Eds.), Autonomous Robot Vehicles, Springer, 1990, pp. 328–341.
View
| DOI
| Download None (ext.)
D. Dobkin, H. Edelsbrunner, C. Yap, in:, I. Cox, G. Wilfong (Eds.), Autonomous Robot Vehicles, Springer, 1990, pp. 328–341.
1990 |Published| Journal Article | IST-REx-ID: 4064
Computing least median of squares regression lines and guided topological sweep
H. Edelsbrunner, D. Souvaine, Journal of the American Statistical Association 85 (1990) 115–119.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, D. Souvaine, Journal of the American Statistical Association 85 (1990) 115–119.
1990 |Published| Journal Article | IST-REx-ID: 4074
Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.
View
| DOI
| Download None (ext.)
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.
1990 |Published| Conference Paper | IST-REx-ID: 4076
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.
View
| DOI
| Download None (ext.)
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.
1989 |Published| Journal Article | IST-REx-ID: 2526
Direct projections from Ammon's horn to the rostral raphe regions in the brainstem of the cat
T. Ino, K. Itoh, H. Kamiya, T. Kaneko, R. Shigemoto, I. Akiguchi, N. Mizuno, Brain Research 479 (1989) 157–161.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
T. Ino, K. Itoh, H. Kamiya, T. Kaneko, R. Shigemoto, I. Akiguchi, N. Mizuno, Brain Research 479 (1989) 157–161.
1989 |Published| Journal Article | IST-REx-ID: 4088 |
Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
1989 |Published| Journal Article | IST-REx-ID: 4083 |
Partitioning space for range queries
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.
[Published Version]
View
| DOI
| Download Published Version (ext.)
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.
1989 |Published| Journal Article | IST-REx-ID: 4314
The divergence of a polygenic system under stabilising selection, mutation and drift
N.H. Barton, Genetical Research 54 (1989) 59–78.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
N.H. Barton, Genetical Research 54 (1989) 59–78.
1988 |Published| Journal Article | IST-REx-ID: 4091
Probing convex polygons with X-Rays
H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.
1987 |Published| Conference Paper | IST-REx-ID: 3514
On the lower envelope of bivariate functions and its applications
H. Edelsbrunner, J. Pach, J. Schwartz, M. Sharir, in:, 28th Annual Symposium on Foundations of Computer Science , IEEE, 1987, pp. 27–37.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, J. Pach, J. Schwartz, M. Sharir, in:, 28th Annual Symposium on Foundations of Computer Science , IEEE, 1987, pp. 27–37.
1987 |Published| Journal Article | IST-REx-ID: 3661
The frequency of shifts between alternative equilibria
N.H. Barton, S. Rouhani, Journal of Theoretical Biology 125 (1987) 397–418.
View
| DOI
| Download None (ext.)
N.H. Barton, S. Rouhani, Journal of Theoretical Biology 125 (1987) 397–418.
1986 |Published| Journal Article | IST-REx-ID: 4105
Constructing arrangements of lines and hyperplanes with applications
H. Edelsbrunner, J. O’Rourke, R. Seidel, SIAM Journal on Computing 15 (1986) 341–363.
View
| DOI
H. Edelsbrunner, J. O’Rourke, R. Seidel, SIAM Journal on Computing 15 (1986) 341–363.
1986 |Published| Journal Article | IST-REx-ID: 4103 |
On the maximal number of edges of many faces in an arrangement
H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.