| A Note on Guarding Staircase Polygons. | 0 | 0.34 | 2019 |
| The VC-Dimension of Visibility on the Boundary of Monotone Polygons | 0 | 0.34 | 2019 |
| Guarding Monotone Polygons with Half-Guards. | 0 | 0.34 | 2017 |
| Constructing Consistent Digital Line Segments. | 0 | 0.34 | 2016 |
| On Isolating Points Using Unit Disks | 0 | 0.34 | 2016 |
| Fast And Accurate Workload Characterization Using Locality Sensitive Hashing | 0 | 0.34 | 2015 |
| A Characterization of Consistent Digital Line Segments in ℤ2. | 0 | 0.34 | 2015 |
| Choosing thresholds for density-based map construction algorithms. | 1 | 0.35 | 2015 |
| The VC-Dimension of Visibility on the Boundary of a Simple Polygon. | 0 | 0.34 | 2015 |
| Fast and QoS-Aware Heterogeneous Data Center Scheduling Using Locality Sensitive Hashing. | 0 | 0.34 | 2015 |
| On the VC-Dimension of Visibility in Monotone Polygons. | 2 | 0.47 | 2014 |
| Computing Regions Decomposable into m Stars. | 1 | 0.34 | 2014 |
| Guarding Terrains via Local Search. | 1 | 0.36 | 2014 |
| On maximum weight objects decomposable into based rectilinear convex objects | 2 | 0.40 | 2013 |
| On Clustering to Minimize the Sum of Radii | 15 | 1.01 | 2012 |
| On isolating points using disks | 7 | 0.54 | 2011 |
| Maximum weight digital regions decomposable into digital star-shaped regions | 5 | 0.47 | 2011 |
| Optimally Decomposing Coverings with Translates of a Convex Polygon | 8 | 0.56 | 2011 |
| Approximation Algorithms for Dominating Set in Disk Graphs | 9 | 0.57 | 2010 |
| Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier - (Extended Abstract) | 0 | 0.34 | 2010 |
| On Metric Clustering to Minimize the Sum of Radii | 7 | 0.53 | 2010 |
| Quasi-Polynomial Time Approximation Schemes for Target Tracking | 0 | 0.34 | 2009 |
| An Approximation Scheme for Terrain Guarding | 17 | 0.88 | 2009 |
| Decomposing Coverings and the Planar Sensor Cover Problem | 24 | 1.50 | 2009 |
