Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., &; Sharir, M. (1994). Selecting heavily covered points. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/S0097539790179919  

Edelsbrunner, H., Seidel, R., &; Sharir, M. (1993). On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0222031 

Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &; Snoeyink, J. (1993). Computing a face in an arrangement of line segments and related problems. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0222077  

Edelsbrunner, H., &; Tan, T. (1993). A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0222036  

Edelsbrunner, H., Tan, T., &; Waupotitsch, R. (1992). An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. Society for Industrial and Applied Mathematics .https://doi.org/10.1137/0913058 

Edelsbrunner, H., &; Shi, W. (1991). An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0220016  

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 

Edelsbrunner, H., &; Skiena, S. (1988). Probing convex polygons with X-Rays. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0217054  

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 

Edelsbrunner, H., Guibas, L., &; Stolfi, J. (1986). Optimal point location in a monotone subdivision. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215023 

Edelsbrunner, H., &; Welzl, E. (1986). Constructing belts in two-dimensional arrangements with applications. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215019