| Convex-Straight-Skeleton Voronoi Diagrams For Segments And Convex Polygons | 0 | 0.34 | 2021 |
| Constant work-space algorithms for facility location problems | 0 | 0.34 | 2020 |
| Range assignment of base-stations maximizing coverage area without interference | 1 | 0.38 | 2020 |
| Variations of largest rectangle recognition amidst a bichromatic point set. | 0 | 0.34 | 2019 |
| A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice. | 0 | 0.34 | 2019 |
| Brief Announcement: Approximation Schemes for Geometric Coverage Problems. | 0 | 0.34 | 2018 |
| Approximation Schemes for Geometric Coverage Problems. | 0 | 0.34 | 2018 |
| Guarding Polyhedral Terrain by k-Watchtowers. | 0 | 0.34 | 2018 |
| Circular Separation Dimension of a Subclass of Planar Graphs. | 0 | 0.34 | 2017 |
| Demand Hitting and Covering of Intervals. | 0 | 0.34 | 2017 |
| Geometric Dominating Set and Set Cover via Local Search. | 1 | 0.36 | 2016 |
| Rectilinear Path Problems in Restricted Memory Setup. | 1 | 0.38 | 2015 |
| Prune-and-search with limited workspace. | 0 | 0.34 | 2015 |
| Approximation algorithms for maximum independent set of a unit disk graph. | 6 | 0.46 | 2015 |
| Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. | 2 | 0.37 | 2014 |
| Facility location problems in the constant work-space read-only memory model. | 0 | 0.34 | 2014 |
| Approximation Algorithms For A Variant Of Discrete Piercing Set Problem For Unit Disks | 6 | 0.49 | 2013 |
| An in-place min-max priority search tree | 4 | 0.40 | 2013 |
| Space-efficient Algorithms for Visibility Problems in Simple Polygon | 4 | 0.53 | 2012 |
| Minimum Enclosing Circle with Few Extra Variables. | 2 | 0.49 | 2012 |
| Convex Hull and Linear Programming in Read-only Setup with Limited Work-space | 4 | 0.43 | 2012 |
| In-place algorithms for computing a largest clique in geometric intersection graphs. | 1 | 0.38 | 2012 |
| Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle | 2 | 0.38 | 2011 |
| Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. | 2 | 0.39 | 2011 |
| Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. | 8 | 0.58 | 2011 |
| An In-Place Priority Search Tree. | 1 | 0.38 | 2011 |
