Computing Convolutions by Reciprocal Search. Raimund Seidel; L.J. Guibas — 1987 Discrete & computational geometry
The Complexity of Many Cells in Arrangements of Planes and Related Problems. H. Edelsbrunner; L.J. Guibas; M. Sharir — 1990 Discrete & computational geometry
The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments. H. Edelsbrunner; L.J. Guibas; M. Sharir — 1990 Discrete & computational geometry
On the General Motion-Planning Problem with Two Degrees of Freedom. L.J. Guibas; Sharir Micha; Shmuel Sifrony — 1989 Discrete & computational geometry
Combinatorial Complexity Bounds for Arrangements of Curves and Spheres. H. Edelsbrunner; E. Welzl; L.J. Guibas; K.L. Clarkson; M. Sharir — 1990 Discrete & computational geometry
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. L.J. Guibas; M. Sharir; J. Matousek; D. Halperin — 1995 Discrete & computational geometry
Points and Triangles in the Plane and Halving Planes in Space. H. Edelsbrunner; B. Chazelle; L.J. Guibas; M. Sharir; R. Wenger; B. Aronov — 1991 Discrete & computational geometry