Edelsbrunner, H., O’Rourke, J., &; Seidel, R. (1986). Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215024 
LibreCat: https://research-explorer.ista.ac.at/record/4105
DOI: 10.1137/0215024

Edelsbrunner, H., &; Welzl, E. (1986). On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(86)90078-6 
LibreCat: https://research-explorer.ista.ac.at/record/4103
DOI: 10.1016/0097-3165(86)90078-6

Szymura, J., &; Barton, N. H. (1986). Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland. Evolution; International Journal of Organic Evolution. Society for the Study of Evolution.https://doi.org/10.1111/j.1558-5646.1986.tb05740.x 
LibreCat: https://research-explorer.ista.ac.at/record/4321
DOI: 10.1111/j.1558-5646.1986.tb05740.x

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., &; Welzl, E. (1985). On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(85)90017-2 
LibreCat: https://research-explorer.ista.ac.at/record/4113
DOI: 10.1016/0097-3165(85)90017-2

Edelsbrunner, H. (1985). Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/0304-3975(85)90005-2 
LibreCat: https://research-explorer.ista.ac.at/record/4116
DOI: 10.1016/0304-3975(85)90005-2

Day, W., &; Edelsbrunner, H. (1985). Investigation of Proportional Link Linkage Clustering Methods. Journal of Classification. Springer.https://doi.org/10.1007/BF01908077 
LibreCat: https://research-explorer.ista.ac.at/record/4114
DOI: 10.1007/BF01908077

Edelsbrunner, H. (1985). Computing the extreme distances between two convex polygons. Journal of Algorithms. Academic Press.https://doi.org/10.1016/0196-6774(85)90039-2 
LibreCat: https://research-explorer.ista.ac.at/record/4115
DOI: 10.1016/0196-6774(85)90039-2

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., Overmars, M., &; Seidel, R. (1984). Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing. Elsevier.https://doi.org/10.1016/0734-189X(84)90142-7 
LibreCat: https://research-explorer.ista.ac.at/record/4123
DOI: 10.1016/0734-189X(84)90142-7

Barton, N. H., Halliday, B., &; Hewitt, G. (1983). Rare electrophoretic variants in a hybrid zone. Heredity. Nature Publishing Group.https://doi.org/10.1038/hdy.1983.15 
LibreCat: https://research-explorer.ista.ac.at/record/3667
DOI: 10.1038/hdy.1983.15

Edelsbrunner, H. (1983). A new approach to rectangle intersections part 2. International Journal of Computer Mathematics. Taylor &; Francis.https://doi.org/10.1080/00207168308803365 
LibreCat: https://research-explorer.ista.ac.at/record/4127
DOI: 10.1080/00207168308803365

Barton, N. H., &; Hewitt, G. (1982). A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae). Heredity. Springer Nature.https://doi.org/10.1038/hdy.1982.29 
LibreCat: https://research-explorer.ista.ac.at/record/3669
DOI: 10.1038/hdy.1982.29