| Farthest-polygon Voronoi diagrams | 23 | 1.18 | 2010 |
| Universal Sets of Points for One-bend Drawings of Planar Graphs with Vertices | 17 | 0.75 | 2010 |
| The Voronoi Diagram of Three Lines | 3 | 0.40 | 2009 |
| On the complexity of umbra and penumbra | 2 | 0.37 | 2009 |
| On the degree of standard geometric predicates for line transversals in 3D | 3 | 0.39 | 2009 |
| On the Size of the 3D Visibility Skeleton: Experimental Results | 3 | 0.41 | 2008 |
| Between umbra and penumbra | 0 | 0.34 | 2007 |
| The voronoi diagram of three lines | 16 | 0.80 | 2007 |
| Maintaining Visibility Information Of Planar Point Sets With A Moving Viewpoint | 2 | 0.41 | 2007 |
| Universal sets of n points for 1-bend drawings of planar graphs with n vertices | 3 | 0.42 | 2007 |
| Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra | 12 | 0.63 | 2007 |
| On The Expected Size Of The 2d Visibility Complex | 2 | 0.37 | 2007 |
| Parabola Separation Queries And Their Applicationto Stone Throwing | 0 | 0.34 | 2007 |
| Towards an implementation of the 3D visibility skeleton | 1 | 0.36 | 2007 |
| Predicates for Line Transversals in 3D | 4 | 0.47 | 2006 |
| Throwing Stones Inside Simple Polygons | 0 | 0.34 | 2006 |
| Drawing Kn in three dimensions with one bend per edge | 3 | 0.49 | 2005 |
| Optimal spanners for axis-aligned rectangles | 5 | 0.51 | 2005 |
| The perfection and recognition of bull-reducible Berge graphs | 1 | 0.35 | 2005 |
| An Experimental Assessment of the 2D Visibility Complex | 0 | 0.34 | 2005 |
| Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons | 7 | 0.60 | 2004 |
| The number of transversals to line segments in R^3 | 2 | 0.40 | 2003 |
| The Expected Number of 3D Visibility Events Is Linear | 11 | 0.69 | 2003 |
| Transversals to line segments in R3 | 1 | 0.35 | 2003 |
| Properties Of Arrangement Graphs | 1 | 0.40 | 2003 |
| On the number of lines tangent to four convex polyhedra | 7 | 0.74 | 2002 |
| Bull-Reducible Berge Graphs are Perfect | 0 | 0.34 | 2001 |
| Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons | 5 | 0.64 | 1999 |
| The union of moving polygonal pseudodiscs - combinatorial bounds and applications | 9 | 0.56 | 1998 |
| Convexifying star-shaped polygons | 13 | 1.86 | 1998 |
| A Visibility Representation for Graphs in Three Dimensions | 29 | 1.70 | 1998 |
| The homogeneous set sandwich problem | 25 | 1.38 | 1998 |
| The largest k-ball in a d-dimensional box | 1 | 0.45 | 1998 |
| Path parity and perfection | 11 | 0.91 | 1997 |
| Edge guarding polyhedral terrains | 10 | 1.15 | 1997 |
| An algorithm for finding homogeneous pairs | 8 | 0.54 | 1997 |
| Stabbing information of a simple polygon | 4 | 0.77 | 1996 |
| Translation Queries For Sets Of Polygons | 0 | 0.34 | 1995 |
| Visibility graphs of polygonal rings. | 0 | 0.34 | 1995 |
| Separating Translates in the Plane: Combinatorial Bounds and an Algorithm | 0 | 0.34 | 1994 |
| Edge Guarding a Triangulated Polyhedral Terrain | 6 | 1.93 | 1994 |
| Slicing an ear using prune-and-search | 13 | 0.89 | 1993 |
| An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems | 18 | 0.72 | 1993 |
| Recovery of Convex Hulls From External Visibility Graphs | 5 | 0.73 | 1993 |
| The Aquarium Keeper's Problem | 10 | 0.92 | 1991 |
| A counterexamples to a dynamic algorithm for convex hulls of line arrangements | 0 | 0.34 | 1991 |
