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, Nicholas H, and A. Clark. “Population Structure and Processes in Evolution.” In Population Biology: Ecological and Evolutionary Viewpoints, edited by Klaus Wöhrmann and Subodh Jain, 115–74. Springer, 1990. https://doi.org/10.1007/978-3-642-74474-7_5.
View
| DOI
| Download None (ext.)
1989 |
Published |
Journal Article |
IST-REx-ID: 4083 |
Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.” SIAM Journal on Computing. SIAM, 1989. https://doi.org/10.1137/0218025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 |
Published |
Journal Article |
IST-REx-ID: 4084 |
Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science. Elsevier, 1989. https://doi.org/10.1016/0304-3975(89)90133-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 |
Published |
Conference Paper |
IST-REx-ID: 4087
Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” In International Symposium on Symbolic and Algebraic Computation, 358:315–31. Springer, 1989. https://doi.org/10.1007/3-540-51084-2_31.
View
| DOI
| Download None (ext.)
1989 |
Published |
Journal Article |
IST-REx-ID: 4088 |
Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187742.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1988 |
Published |
Conference Paper |
IST-REx-ID: 4096
Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry.” In 15th International Colloquium on Automata, Languages and Programming, 317:201–13. Springer, 1988. https://doi.org/10.1007/3-540-19488-6_117.
View
| DOI
| Download None (ext.)
1988 |
Published |
Conference Paper |
IST-REx-ID: 4097
Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” In 15th International Colloquium on Automata, Languages and Programming, 317:214–29. Springer, 1988. https://doi.org/10.1007/3-540-19488-6_118.
View
| DOI
| Download None (ext.)
1987 |
Published |
Book |
IST-REx-ID: 3900
Edelsbrunner, Herbert. Algorithms in Combinatorial Geometry. Vol. 10. Berlin ; Heidelberg: Springer, 1987. https://doi.org/10.1007/978-3-642-61568-9.
View
| Files available
| DOI
1987 |
Published |
Journal Article |
IST-REx-ID: 4100
Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” Discrete & Computational Geometry. Springer, 1987. https://doi.org/10.1007/BF02187875.
View
| DOI
1986 |
Published |
Journal Article |
IST-REx-ID: 3580
Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” Algorithmica. Springer, 1986. https://doi.org/10.1007/BF01840438.
View
| DOI
1986 |
Published |
Journal Article |
IST-REx-ID: 4098 |
Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series A. Elsevier, 1986. https://doi.org/10.1016/0097-3165(86)90075-0.
View
| DOI
| Download None (ext.)
1986 |
Published |
Journal Article |
IST-REx-ID: 4107
Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” Discrete Mathematics. Elsevier, 1986. https://doi.org/10.1016/0012-365X(86)90008-7.
View
| DOI
1985 |
Published |
Journal Article |
IST-REx-ID: 4111
Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” Information Processing Letters. Elsevier, 1985. https://doi.org/10.1016/0020-0190(85)90107-3.
View
| DOI
1984 |
Published |
Conference Paper |
IST-REx-ID: 3513
Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems.” In 9th International Workshop on Graph Theoretic Concepts in Computer Science, 88–99. WG. Teubner, 1984.
View
| Download None (ext.)
1984 |
Published |
Conference Paper |
IST-REx-ID: 4119
Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.” In 11th International Symposium on Mathematical Foundations of Computer Science, 176:265–72. MFCS. Springer, 1984. https://doi.org/10.1007/BFb0030307.
View
| DOI
1984 |
Published |
Journal Article |
IST-REx-ID: 4121
Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” Journal of Classification. Springer, 1984. https://doi.org/10.1007/BF01890115.
View
| DOI
| Download None (ext.)
1984 |
Published |
Conference Paper |
IST-REx-ID: 4122
Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.” In 1st Symposium of Theoretical Aspects of Computer Science, 166:1–13. STACS. Springer, 1984. https://doi.org/10.1007/3-540-12920-0_1.
View
| DOI
1981 |
Published |
Journal Article |
IST-REx-ID: 4132 |
Edelsbrunner, Herbert, and Hermann Maurer. “On the Intersection of Orthogonal Objects.” Information Processing Letters. Elsevier, 1981. https://doi.org/10.1016/0020-0190(81)90053-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1981 |
Published |
Journal Article |
IST-REx-ID: 4333 |
Barton, Nicholas H, and Godfrey Hewitt. “The Genetic Basis of Hybrid Inviability between Two Chromosomal Races of the Grasshopper Podisma Pedestris.” Heredity. Springer Nature, 1981. https://doi.org/10.1038/hdy.1981.98.
[Published Version]
View
| DOI
| Download Published Version (ext.)