| Local search strikes again: PTAS for variants of geometric covering and packing | 2 | 0.39 | 2020 |
| Packing and Covering with Non-Piercing Regions | 0 | 0.34 | 2018 |
| Demand Hitting and Covering of Intervals. | 0 | 0.34 | 2017 |
| The Runaway Rectangle Escape Problem. | 0 | 0.34 | 2016 |
| Packing and Covering with Non-Piercing Regions. | 0 | 0.34 | 2016 |
| On the d-Runaway Rectangle Escape Problem. | 0 | 0.34 | 2014 |
| Selection Lemmas for various geometric objects. | 0 | 0.34 | 2014 |
| Geometric graphs on convex point sets. | 0 | 0.34 | 2013 |
| On strong centerpoints. | 0 | 0.34 | 2013 |
| Efficient external memory structures for range-aggregate queries | 6 | 0.46 | 2013 |
| Hitting and Piercing Rectangles Induced by a Point Set. | 1 | 0.36 | 2013 |
| Two player game variant of the Erdos-Szekeres problem | 0 | 0.34 | 2012 |
| On Piercing (Pseudo)Lines and Boxes. | 1 | 0.43 | 2012 |
| Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors | 19 | 1.23 | 2012 |
| Hardness Results for Computing Optimal Locally Gabriel graphs. | 0 | 0.34 | 2012 |
| On Locally Gabriel Geometric Graphs. | 0 | 0.34 | 2012 |
| On Computing Optimal Locally Gabriel Graphs | 2 | 0.40 | 2011 |
| On the Erdős-Szekeres n-interior-point problem | 0 | 0.34 | 2011 |
| New epsilon-net constructions | 0 | 0.34 | 2010 |
| Small strong epsilon nets | 5 | 0.46 | 2010 |
| A scalable algorithm for dispersing population | 6 | 0.82 | 2007 |
| I/O-Efficient Well-Separated Pair Decomposition and Applications | 9 | 0.49 | 2006 |
| A scalable simulator for forest dynamics | 6 | 1.01 | 2004 |
| CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries | 28 | 1.35 | 2003 |
| Range Searching in Categorical Data: Colored Range Searching on Grid | 25 | 1.04 | 2002 |
