| Fast gaussian process regression for big data S Das, S Roy, R Sambasivan Big data research 14, 12-26, 2018 | 58 | 2018 |
| Variations of base-station placement problem on the boundary of a convex region GK Das, S Roy, S Das, SC Nandy International Journal of Foundations of Computer Science 19 (02), 405-427, 2008 | 20 | 2008 |
| Base station placement on boundary of a convex polygon S Roy, D Bardhan, S Das Journal of Parallel and Distributed Computing 68 (2), 265-273, 2008 | 20 | 2008 |
| Shortest monotone descent path problem in polyhedral terrain S Roy, S Das, SC Nandy Computational Geometry 37 (2), 115-133, 2007 | 20 | 2007 |
| Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs N Banerjee, S Chakraborty, V Raman, S Roy, S Saurabh Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015 | 18 | 2015 |
| Smallest enclosing circle centered on a query line segment. P Bose, S Langerman, S Roy CCCG 8, 167-170, 2008 | 18 | 2008 |
| Approximation algorithms for shortest descending paths in terrains M Ahmed, S Das, S Lodha, A Lubiw, A Maheshwari, S Roy Journal of Discrete Algorithms 8 (2), 214-230, 2010 | 16 | 2010 |
| Constrained minimum enclosing circle with center on a query line segment S Roy, A Karmakar, S Das, SC Nandy Computational Geometry 42 (6-7), 632-638, 2009 | 16 | 2009 |
| On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation S Banerjee, BB Bhattacharya, S Das, A Karmakar, A Maheshwari, S Roy 2012 Ninth International Symposium on Voronoi Diagrams in Science and …, 2012 | 15 | 2012 |
| Faster approximation for maximum independent set on unit disk graph SC Nandy, S Pandit, S Roy Information Processing Letters 127, 58-61, 2017 | 14 | 2017 |
| Recognizing the largest empty circle and axis-parallel rectangle in a desired location J Augustine, S Das, A Maheshwari, SC Nandy, S Roy, ... arXiv preprint arXiv:1004.0558, 2010 | 13 | 2010 |
| Fast computation of smallest enclosing circle with center on a query line segment A Karmakar, S Roy, S Das Information Processing Letters 108 (6), 343-346, 2008 | 13 | 2008 |
| The balanced connected subgraph problem for geometric intersection graphs S Bhore, S Jana, S Pandit, S Roy Theoretical Computer Science 929, 69-80, 2022 | 12 | 2022 |
| Querying for the largest empty geometric object in a desired location J Augustine, S Das, A Maheshwari, S Nandy, S Roy, S Sarvattomananda arXiv preprint arXiv:1004.0558, 2010 | 12 | 2010 |
| Largest empty circle centered on a query line J Augustine, B Putnam, S Roy arXiv preprint arXiv:0809.2651, 2008 | 11 | 2008 |
| Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points H Kaplan, S Roy, M Sharir Computational Geometry 81, 1-11, 2019 | 10 | 2019 |
| Covering points: Minimizing the maximum depth SC Nandy, S Pandit, S Roy | 10 | 2017 |
| Efficient algorithm for placing base stations by avoiding forbidden zone S Roy, D Bardhan, S Das International Conference on Distributed Computing and Internet Technology …, 2005 | 10 | 2005 |
| A fast algorithm for point labeling problem. S Roy, S Bhattacharjee, S Das, SC Nandy CCCG, 155-158, 2005 | 10 | 2005 |
| Irregular-shaped event boundary estimation in wireless sensor networks S Kundu, N Das, S Roy, D Saha Progress in Intelligent Computing Techniques: Theory, Practice, and …, 2018 | 9 | 2018 |
