Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. Selecting heavily covered points. SIAM Journal on Computing. 1994;23(6):1138-1151. doi:10.1137/S0097539790179919 
LibreCat: https://research-explorer.ista.ac.at/record/4033
DOI: 10.1137/S0097539790179919 

Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. 1993;22(2):418-429. doi:10.1137/0222031
LibreCat: https://research-explorer.ista.ac.at/record/4041
DOI: 10.1137/0222031

Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a face in an arrangement of line segments and related problems. SIAM Journal on Computing. 1993;22(6):1286-1302. doi:10.1137/0222077 
LibreCat: https://research-explorer.ista.ac.at/record/4036
DOI: 10.1137/0222077 

Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. 1993;22(3):527-551. doi:10.1137/0222036 
LibreCat: https://research-explorer.ista.ac.at/record/4042
DOI: 10.1137/0222036 

Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. 1992;13(4):994-1008. doi:10.1137/0913058
LibreCat: https://research-explorer.ista.ac.at/record/4043
DOI: 10.1137/0913058

Edelsbrunner H, Shi W. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. 1991;20(2):259-269. doi:10.1137/0220016 
LibreCat: https://research-explorer.ista.ac.at/record/4051
DOI: 10.1137/0220016 

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

Edelsbrunner H, Skiena S. Probing convex polygons with X-Rays. SIAM Journal on Computing. 1988;17(5):870-882. doi:10.1137/0217054 
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054 

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

Edelsbrunner H, Guibas L, Stolfi J. Optimal point location in a monotone subdivision. SIAM Journal on Computing. 1986;15(2):317-340. doi:10.1137/0215023
LibreCat: https://research-explorer.ista.ac.at/record/4104
DOI: 10.1137/0215023

Edelsbrunner H, Welzl E. Constructing belts in two-dimensional arrangements with applications. SIAM Journal on Computing. 1986;15(1):271-284. doi:10.1137/0215019
LibreCat: https://research-explorer.ista.ac.at/record/4110
DOI: 10.1137/0215019