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.

1935 Publications


1986 | Journal Article | IST-REx-ID: 3580
H. Edelsbrunner, “Edge-skeletons in arrangements with applications,” Algorithmica, vol. 1, no. 1–4. Springer, pp. 93–109, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4098 | OA
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.)
 

1986 | Journal Article | IST-REx-ID: 4107
H. Edelsbrunner and D. Haussler, “The complexity of cells in 3-dimensional arrangements,” Discrete Mathematics, vol. 60, no. C. Elsevier, pp. 139–146, 1986.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4112
H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable searching problems,” Journal of Algorithms, vol. 6, no. 4. Elsevier, pp. 515–542, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4111
H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” Information Processing Letters, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4120 | OA
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: 4122
H. Edelsbrunner, “Key-problems and key-methods in computational geometry,” in 1st Symposium of Theoretical Aspects of Computer Science, Paris, France, 1984, vol. 166, pp. 1–13.
View | DOI
 

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.)
 

1984 | Conference Paper | IST-REx-ID: 4119
H. Edelsbrunner and E. Welzl, “Monotone edge sequences in line arrangements and applications,” in 11th International Symposium on Mathematical Foundations of Computer Science, Praha, Czechoslovakia, 1984, vol. 176, pp. 265–272.
View | DOI
 

Filters and Search Terms

isbn%3D978-3-99078-004-6

Search

Filter Publications