| Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains | 0 | 0.34 | 2022 |
| Bottleneck detour tree of points on a path. | 0 | 0.34 | 2019 |
| Selecting and covering colored points. | 0 | 0.34 | 2018 |
| Spiderman graph: Visibility in urban regions. | 1 | 0.35 | 2015 |
| Stable Roommates Spanner | 0 | 0.34 | 2013 |
| Polychromatic 4-coloring of cubic bipartite plane graphs | 6 | 0.51 | 2012 |
| A Scheme for Computing Minimum Covers within Simple Regions | 2 | 0.37 | 2012 |
| The MST of symmetric disk graphs is light | 1 | 0.35 | 2012 |
| Bottleneck non-crossing matching in the plane | 3 | 0.56 | 2012 |
| Bottleneck Steiner tree with bounded number of Steiner vertices. | 0 | 0.34 | 2011 |
| Symmetric connectivity with directional antennas | 5 | 0.47 | 2011 |
| Connectivity guarantees for wireless networks with directional antennas | 20 | 0.99 | 2011 |
| Settling the bound on the rectilinear link radius of a simple rectilinear polygon | 3 | 0.50 | 2011 |
| Minimum-Cost Load-Balancing Partitions | 16 | 1.29 | 2009 |
| Polychromatic 4-coloring of guillotine subdivisions | 3 | 0.43 | 2009 |
| Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object | 2 | 0.44 | 2009 |
| On guarding the vertices of rectilinear domains | 23 | 1.22 | 2008 |
| Polynomial-time approximation schemes for piercing and covering with applications in wireless networks | 7 | 0.49 | 2008 |
| Conflict-Free Coloring of points on a line with respect to a set of intervals | 3 | 0.43 | 2007 |
| Power Assignment in Radio Networks with Two Power Levels | 19 | 1.08 | 2007 |
| The minimum-area spanning tree problem | 4 | 0.46 | 2006 |
| On guarding rectilinear domains | 1 | 0.38 | 2006 |
| TSP with neighborhoods of varying size. | 5 | 0.42 | 2005 |
| On the Fermat--Weber center of a convex object | 12 | 1.15 | 2005 |
| Geographic Quorum System Approximations | 2 | 0.47 | 2005 |
| Orthogonal segment stabbing | 11 | 0.60 | 2005 |
| Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem | 3 | 0.44 | 2004 |
| Models and motion planning | 7 | 0.61 | 2002 |
| Walking around fat obstacles | 3 | 0.47 | 2002 |
| A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in | 13 | 0.87 | 2001 |
| On the union of k-curved objects | 12 | 0.69 | 1999 |
| Guarding scenes against invasive hypercubes | 11 | 0.59 | 1998 |
| Dynamic data structures for fat objects and their applications | 27 | 1.61 | 1997 |
