Alur R, Henzinger TA. 1990. Real-time logics: Complexity and expressiveness.  5th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 390–401.
LibreCat: https://research-explorer.ista.ac.at/record/4597
DOI: 10.1109/LICS.1990.113764

Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 145–151.
LibreCat: https://research-explorer.ista.ac.at/record/4085
DOI: 10.1145/73833.73850

Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.
LibreCat: https://research-explorer.ista.ac.at/record/4596
DOI: 10.1109/SFCS.1989.63473

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.
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. 15th International Colloquium on Automata, Languages and Programming. ALP: Automata, Languages and Programming, LNCS, vol. 317, 201–213.
LibreCat: https://research-explorer.ista.ac.at/record/4096
DOI: 10.1007/3-540-19488-6_117

Barton NH. 1988.Speciation. In: Analytical biogeography: An integrated approach to the study of animal and plant distributions. , 185–218.
LibreCat: https://research-explorer.ista.ac.at/record/4317
DOI: 10.1007/978-94-009-0435-4

Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.
LibreCat: https://research-explorer.ista.ac.at/record/4102
DOI: 10.1016/0196-6774(87)90015-0

Edelsbrunner H, Pach J, Schwartz J, Sharir M. 1987. On the lower envelope of bivariate functions and its applications. 28th Annual Symposium on Foundations of Computer Science . FOCS: Foundations of Computer Science, 27–37.
LibreCat: https://research-explorer.ista.ac.at/record/3514
DOI: 10.1109/SFCS.1987.44

Barton NH. 1986. The effects of linkage and density-dependent regulation on gene flow. Heredity. 57, 415–426.
LibreCat: https://research-explorer.ista.ac.at/record/3665

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

Edelsbrunner H, Waupotitsch R. 1986. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. 2(2), 171–178.
LibreCat: https://research-explorer.ista.ac.at/record/4106
DOI: 10.1016/S0747-7171(86)80020-7

Edelsbrunner H, Haring G, Hilbert D. 1986. Rectangular point location in d-dimensions with applications. Computer Journal. 29(1), 76–82.
LibreCat: https://research-explorer.ista.ac.at/record/4109
DOI: 10.1093/comjnl/29.1.76

Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115

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

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

Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study. In: Computational Geometry: Theory and Applications.  Advances in Computing Research, vol. 1, 35–59.
LibreCat: https://research-explorer.ista.ac.at/record/3563

Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees. In: Computational Geometry: Theory and Applications. Advances in Computing Research , vol. 1, 109–125.
LibreCat: https://research-explorer.ista.ac.at/record/3562

Barton NH, Hewitt G. 1983.Hybrid zones as barriers to gene flow. In: Protein polymorphism: Adaptive and taxonomic significance. Systematics Association Special Volume, vol. 24, 341–359.
LibreCat: https://research-explorer.ista.ac.at/record/4328

Edelsbrunner H, Overmars M. 1982. On the equivalence of some rectangle problems. Information Processing Letters. 14(3), 124–127.
LibreCat: https://research-explorer.ista.ac.at/record/4131
DOI: 10.1016/0020-0190(82)90068-0