An O(n log^2 h) time algorithm for the three-dimensional convex hull problem
H. Edelsbrunner, W. Shi, SIAM Journal on Computing 20 (1991) 259–269.

Partitioning space for range queries
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.

Probing convex polygons with X-Rays
H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.

Constructing arrangements of lines and hyperplanes with applications
H. Edelsbrunner, J. O’Rourke, R. Seidel, SIAM Journal on Computing 15 (1986) 341–363.

Optimal point location in a monotone subdivision
H. Edelsbrunner, L. Guibas, J. Stolfi, SIAM Journal on Computing 15 (1986) 317–340.

Constructing belts in two-dimensional arrangements with applications
H. Edelsbrunner, E. Welzl, SIAM Journal on Computing 15 (1986) 271–284.