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.

2059 Publications


1990 | Published | Book Chapter | IST-REx-ID: 4311
Barton NH, Clark A. 1990.Population structure and processes in evolution. In: Population biology: Ecological and evolutionary viewpoints. , 115–174.
View | DOI | Download None (ext.)
 

1989 | Published | Journal Article | IST-REx-ID: 4083 | OA
Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Published | Journal Article | IST-REx-ID: 4084 | OA
Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Published | Conference Paper | IST-REx-ID: 4087
Edelsbrunner H, Preparata F, West D. 1989. Tetrahedrizing point sets in three dimensions. International Symposium on Symbolic and Algebraic Computation. ISSAC: International Symposium on Symbolic and Algebraic Computation, LNCS, vol. 358, 315–331.
View | DOI | Download None (ext.)
 

1989 | Published | Journal Article | IST-REx-ID: 4088 | OA
Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. 1989. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. 4(1), 433–466.
[Published Version] View | DOI | Download Published Version (ext.)
 

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

1987 | Published | Book | IST-REx-ID: 3900
Edelsbrunner H. 1987. Algorithms in Combinatorial Geometry, Berlin ; Heidelberg: Springer, XV, 423p.
View | Files available | DOI
 

1987 | Published | Journal Article | IST-REx-ID: 4100
Chazelle B, Edelsbrunner H. 1987. Linear space data structures for two types of range search. Discrete & Computational Geometry. 2(1), 113–126.
View | DOI
 

1986 | Published | Journal Article | IST-REx-ID: 3580
Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.
View | DOI
 

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

1986 | Published | Journal Article | IST-REx-ID: 4107
Edelsbrunner H, Haussler D. 1986. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 60(C), 139–146.
View | DOI
 

1985 | Published | 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. 21(1), 39–47.
View | DOI
 

1984 | Published | 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 | Published | 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
 

1984 | Published | 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 | Published | Conference Paper | IST-REx-ID: 4122
Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. 1st Symposium of Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer ScienceSTACS, LNCS, vol. 166, 1–13.
View | DOI
 

1981 | Published | Journal Article | IST-REx-ID: 4132 | OA
Edelsbrunner H, Maurer H. 1981. On the intersection of Orthogonal objects. Information Processing Letters. 13(4–5), 177–181.
[Published Version] View | DOI | Download Published Version (ext.)
 

1981 | Published | Journal Article | IST-REx-ID: 4333 | OA
Barton NH, Hewitt G. 1981. The genetic basis of hybrid inviability between two chromosomal races of the grasshopper Podisma pedestris. Heredity. 47(3), 367–383.
[Published Version] View | DOI | Download Published Version (ext.)
 

Filters and Search Terms

isbn%3D978-364254630-3

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed