Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular triangulations. Algorithmica. 15(3), 223–241.

Henzinger MH. 1995. Fully dynamic biconnectivity in graphs. Algorithmica. 13(6), 503–538.

Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1994. Ray shooting in polygons using geodesic triangulations. Algorithmica. 12(1), 54–68.

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1994. Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica. 11(2), 116–132.

Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.

Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.