| Approximation algorithms for maximum independent set of a unit disk graph GK Das, M De, S Kolay, SC Nandy, S Sur-Kolay Information Processing Letters 115 (3), 439-446, 2015 | 20 | 2015 |
| Approximation algorithms for a variant of discrete piercing set problem for unit disks M De, GK Das, P Carmi, SC Nandy International Journal of Computational Geometry & Applications 23 (06), 461-477, 2013 | 18 | 2013 |
| Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. M De, GK Das, SC Nandy CCCG, 2011 | 13 | 2011 |
| An in-place min–max priority search tree M De, A Maheshwari, SC Nandy, M Smid Computational Geometry 46 (3), 310-327, 2013 | 11 | 2013 |
| An In-Place Priority Search Tree M De, A Maheshwari, SC Nandy, MHM Smid CCCG, 2011 | 11* | 2011 |
| Variations of largest rectangle recognition amidst a bichromatic point set A Acharyya, M De, SC Nandy, S Pandit Discrete Applied Mathematics 286, 35-50, 2020 | 9 | 2020 |
| Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. M De, SC Nandy CCCG, 2011 | 9 | 2011 |
| Approximation schemes for geometric coverage problems S Chaplick, M De, A Ravsky, J Spoerhase 26th Annual European Symposium on Algorithms (ESA 2018), 2018 | 8 | 2018 |
| Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. BK Bhattacharya, M De, SC Nandy, S Roy CCCG, 2014 | 8 | 2014 |
| Convex hull and linear programming in read-only setup with limited work-space M De, SC Nandy, S Roy arXiv preprint arXiv:1212.5353, 2012 | 7 | 2012 |
| Space-efficient algorithms for visibility problems in simple polygon M De, A Maheshwari, SC Nandy arXiv preprint arXiv:1204.2634, 2012 | 6 | 2012 |
| Geometric dominating-set and set-cover via local-search M De, A Lahiri Computational Geometry 113, 102007, 2023 | 5 | 2023 |
| Demand hitting and covering of intervals D Krupa R, A Basu Roy, M De, S Govindarajan Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017 | 5 | 2017 |
| Inplace algorithm for priority search tree and its use in computing largest empty axis-parallel rectangle M De, SC Nandy arXiv preprint arXiv:1104.3076, 2011 | 5 | 2011 |
| Voronoi diagram for convex polygonal sites with convex polygon-offset distance function G Barequet, M De Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017 | 4 | 2017 |
| Minimum enclosing circle with few extra variables M De, SC Nandy, S Roy IARCS Annual Conference on Foundations of Software Technology and …, 2012 | 4 | 2012 |
| Constant work-space algorithms for facility location problems BK Bhattacharya, M De, SC Nandy, S Roy Discrete Applied Mathematics 283, 456-472, 2020 | 3 | 2020 |
| Circular separation dimension of a subclass of planar graphs AP Bharathi, M De, A Lahiri arXiv preprint arXiv:1612.09436, 2016 | 3 | 2016 |
| Prune-and-search with limited workspace M De, SC Nandy, S Roy Journal of Computer and System Sciences 81 (2), 398-414, 2015 | 3 | 2015 |
| Back-up 2-center on a path/tree/cycle/unicycle B Bhattacharya, M De, T Kameda, S Roy, V Sokol, Z Song Computing and Combinatorics: 20th International Conference, COCOON 2014 …, 2014 | 3 | 2014 |
Sasanka RoyAssociate Professor at Indian Statistical InstituteVerified email at isical.ac.in
