Barton, N. H., &; Clark, A. (1990). Population structure and processes in evolution. In K. Wöhrmann &; S. Jain (Eds.), Population biology: Ecological and evolutionary viewpoints (pp. 115–174). Springer.https://doi.org/10.1007/978-3-642-74474-7_5 
LibreCat: https://research-explorer.ista.ac.at/record/4311
DOI: 10.1007/978-3-642-74474-7_5

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. Springer.https://doi.org/10.1007/BF02187742 
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

Yao, F., Dobkin, D., Edelsbrunner, H., &; Paterson, M. (1989). Partitioning space for range queries. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0218025 
LibreCat: https://research-explorer.ista.ac.at/record/4083
DOI: 10.1137/0218025

Edelsbrunner, H., Rote, G., &; Welzl, E. (1989). Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/0304-3975(89)90133-3 
LibreCat: https://research-explorer.ista.ac.at/record/4084
DOI: 10.1016/0304-3975(89)90133-3

Edelsbrunner, H., Preparata, F., &; West, D. (1989). Tetrahedrizing point sets in three dimensions. In https://doi.org/10.1007/3-540-51084-2_31__International Symposium on Symbolic and Algebraic Computation (Vol. 358, pp. 315–331). Rome, Italy: Springer.https://doi.org/10.1007/3-540-51084-2_31 
LibreCat: https://research-explorer.ista.ac.at/record/4087
DOI: 10.1007/3-540-51084-2_31

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 
LibreCat: https://research-explorer.ista.ac.at/record/4097
DOI: 10.1007/3-540-19488-6_118

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 
LibreCat: https://research-explorer.ista.ac.at/record/4096
DOI: 10.1007/3-540-19488-6_117

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 
LibreCat: https://research-explorer.ista.ac.at/record/4100
DOI: 10.1007/BF02187875

Edelsbrunner, H. (1987). Algorithms in Combinatorial Geometry (Vol. 10). Berlinf; Heidelberg: Springer.https://doi.org/10.1007/978-3-642-61568-9 
LibreCat: https://research-explorer.ista.ac.at/record/3900
DOI: 10.1007/978-3-642-61568-9

Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. Algorithmica. Springer.https://doi.org/10.1007/BF01840438 
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438

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 
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

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 
LibreCat: https://research-explorer.ista.ac.at/record/4107
DOI: 10.1016/0012-365X(86)90008-7

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 
LibreCat: https://research-explorer.ista.ac.at/record/4111
DOI: 10.1016/0020-0190(85)90107-3

Day, W., &; Edelsbrunner, H. (1984). Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. Springer.https://doi.org/10.1007/BF01890115 
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115

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 
LibreCat: https://research-explorer.ista.ac.at/record/4122
DOI: 10.1007/3-540-12920-0_1

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.
LibreCat: https://research-explorer.ista.ac.at/record/3513

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 
LibreCat: https://research-explorer.ista.ac.at/record/4119
DOI: 10.1007/BFb0030307

Edelsbrunner, H., &; Maurer, H. (1981). On the intersection of Orthogonal objects. Information Processing Letters. Elsevier.https://doi.org/10.1016/0020-0190(81)90053-3 
LibreCat: https://research-explorer.ista.ac.at/record/4132
DOI: 10.1016/0020-0190(81)90053-3

Barton, N. H., &; Hewitt, G. (1981). The genetic basis of hybrid inviability between two chromosomal races of the grasshopper Podisma pedestris. Heredity. Springer Nature.https://doi.org/10.1038/hdy.1981.98 
LibreCat: https://research-explorer.ista.ac.at/record/4333
DOI: 10.1038/hdy.1981.98