Sasanka Roy

Most-cited papers

Fast Gaussian Process Regression for Big Data
Sourish Das, Sasanka Roy, R. Sambasivan
2015Big Data Research56 citations Open access
Semantic Scholar
Base station placement on boundary of a convex polygon
Sasanka Roy, Debabrata Bardhan, Sandip Das
2008J. Parallel Distributed Comput.21 citations
Semantic Scholar
Variations of Base-Station Placement Problem on the Boundary of a Convex Region
G. Das, Sasanka Roy, Sandip Das, S. Nandy
2008International Journal of Foundations of Computer Science21 citations
Semantic Scholar
Shortest monotone descent path problem in polyhedral terrain
Sasanka Roy, Sandip Das, S. Nandy
2005Computational geometry20 citations Open access
Semantic Scholar
Constrained minimum enclosing circle with center on a query line segment
Sasanka Roy, A. Karmakar, Sandip Das, S. Nandy
2006Computational geometry19 citations Open access
Semantic Scholar
Querying for the Largest Empty Geometric Object in a Desired Location
J. Augustine, Sandip Das, A. Maheshwari, S. Nandy +2 more
201016 citations
Semantic Scholar
Approximation algorithms for shortest descending paths in terrains
Mustaq Ahmed, Sandip Das, S. Lodha, A. Lubiw +2 more
2008J. Discrete Algorithms16 citations Open access
Semantic Scholar
Smallest enclosing circle centered on a query line segment
P. Bose, S. Langerman, Sasanka Roy
2008Canadian Conference on Computational Geometry13 citations
Semantic Scholar
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
A. Karmakar, Sasanka Roy, Sandip Das
2008Canadian Conference on Computational Geometry13 citations
Semantic Scholar
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location
J. Augustine, Sandip Das, A. Maheshwari, S. Nandy +2 more
2010arXiv.org12 citations
Semantic Scholar
Optimal algorithm for a special point-labeling problem
Sasanka Roy, Partha P. Goswami, Sandip Das, S. Nandy
2002Information Processing Letters12 citations Open access
Semantic Scholar
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy +1 more
2015International Computing and Combinatorics Conference11 citations
Semantic Scholar
Largest empty circle centered on a query line
J. Augustine, B. Putnam, Sasanka Roy
2008J. Discrete Algorithms11 citations Open access
Semantic Scholar
Covering Segments with Unit Squares
Ankush Acharyya, S. Nandy, S. Pandit, Sasanka Roy
2016Workshop on Algorithms and Data Structures10 citations Open access
Semantic Scholar
Localized geometric query problems
J. Augustine, Sandip Das, A. Maheshwari, S. Nandy +2 more
2011Computational geometry10 citations Open access
Semantic Scholar
A Fast Algorithm for Point Labeling Problem
Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, S. Nandy
2005Canadian Conference on Computational Geometry10 citations
Semantic Scholar
The Balanced Connected Subgraph Problem
S. Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell +2 more
2018International Conference on Algorithms and Discrete Applied Mathematics9 citations
Semantic Scholar
Faster approximation for maximum independent set on unit disk graph
S. Nandy, S. Pandit, Sasanka Roy
2016Information Processing Letters9 citations
Semantic Scholar
On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation
Sandip Banerjee, B. B. Bhattacharya, Sandip Das, A. Karmakar +2 more
20122012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering9 citations
Semantic Scholar
Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone
Sasanka Roy, Debabrata Bardhan, Sandip Das
2005International Conference on Distributed Computing and Internet Technology9 citations
Semantic Scholar
Balanced Connected Subgraph Problem in Geometric Intersection Graphs
S. Bhore, Satyabrata Jana, S. Pandit, Sasanka Roy
2019International Conference on Combinatorial Optimization and Applications8 citations
Semantic Scholar
Helly-Type Theorems in Property Testing
Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf
2013Latin American Symposium on Theoretical Informatics8 citations Open access
Semantic Scholar
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points
Haim Kaplan, Sasanka Roy, M. Sharir
2019Embedded Systems and Applications7 citations Open access
Semantic Scholar
Minimum Width Color Spanning Annulus
Ankush Acharyya, S. Nandy, Sasanka Roy
2016International Computing and Combinatorics Conference7 citations Open access
Semantic Scholar
Approximate Shortest Descent Path on a Terrain
Sasanka Roy, S. Lodha, Sandip Das, A. Maheshwari
2007Canadian Conference on Computational Geometry7 citations
Semantic Scholar
Irregular-Shaped Event Boundary Estimation in Wireless Sensor Networks
Srabani Kundu, Nabanita Das, Sasanka Roy, Dibakar Saha
20186 citations
Semantic Scholar
Convex Hull and Linear Programming in Read-only Setup with Limited Work-space
Minati De, S. Nandy, Sasanka Roy
2012arXiv.org6 citations
Semantic Scholar
Covering Points: Minimizing the Maximum Depth
S. Nandy, S. Pandit, Sasanka Roy
2017Canadian Conference on Computational Geometry5 citations
Semantic Scholar
On the number of shortest descending paths on the surface of a convex terrain
Mustaq Ahmed, A. Maheshwari, S. Nandy, Sasanka Roy
2011J. Discrete Algorithms5 citations Open access
Semantic Scholar
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs
A. Molla, S. Pandit, Sasanka Roy
2019J. Parallel Distributed Comput.4 citations
Semantic Scholar
Geometric Path Problems with Violations
A. Maheshwari, S. Nandy, Drimit Pattanayak, Sasanka Roy +1 more
2018Algorithmica4 citations
Semantic Scholar
A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
Sanjib Sadhu, Sasanka Roy, S. Nandy, Suchismita Roy
2017arXiv.org4 citations
Semantic Scholar
Problems on One Way Road Networks
Jammigumpula Ajay, Avinandan Das, Binayak Dutta, A. Karmakar +2 more
2016Canadian Conference on Computational Geometry4 citations Open access
Semantic Scholar
In-place algorithms for computing a largest clique in geometric intersection graphs
Minati De, S. Nandy, Sasanka Roy
2012Discrete Applied Mathematics4 citations Open access
Semantic Scholar
Minimum Enclosing Circle with Few Extra Variables
Minati De, S. Nandy, Sasanka Roy
2012Foundations of Software Technology and Theoretical Computer Science4 citations
Semantic Scholar
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks
J. Augustine, Qi Han, Philip Loden, S. Lodha +1 more
2011International Journal of Foundations of Computer Science4 citations
Semantic Scholar
Minimizing Testing Overheads in Database Migration Lifecycle
Sangameshwar Patil, Sasanka Roy, J. Augustine, Amanda Redlich +5 more
2010International Conference on Management of Data4 citations
Semantic Scholar
Balanced Connected Graph Partition
Satyabrata Jana, S. Pandit, Sasanka Roy
2021International Conference on Algorithms and Discrete Applied Mathematics3 citations
Semantic Scholar
Prune-and-search with limited workspace
Minati De, S. Nandy, Sasanka Roy
2015Journal of computer and system sciences (Print)3 citations Open access
Semantic Scholar
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models
B. Bhattacharya, Minati De, S. Nandy, Sasanka Roy
2014Canadian Conference on Computational Geometry3 citations
Semantic Scholar
Near optimal algorithm for the shortest descending path on the surface of a convex terrain
Sasanka Roy
2012J. Discrete Algorithms3 citations Open access
Semantic Scholar
A new fast heuristic for labeling points
Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, S. Nandy
2009Information Processing Letters3 citations
Semantic Scholar
Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks
J. Augustine, Qi Han, Philip Loden, S. Lodha +1 more
2009arXiv.org3 citations
Semantic Scholar
A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface
Sasanka Roy, Sandip Das, S. Nandy
2004Communication Systems and Applications3 citations
Semantic Scholar
Witness Set in Monotone Polygons: Exact and Approximate
Udvas Das, Binayak Dutta, Satyabrata Jana, Debabrata Pal +1 more
2025arXiv.org2 citations
Semantic Scholar
Optimal facility location problem on polyhedral terrains using descending paths
Binayak Dutta, A. Karmakar, Sasanka Roy
2020Theoretical Computer Science2 citations Open access
Semantic Scholar
Constant work-space algorithms for facility location problems
B. Bhattacharya, Minati De, S. Nandy, Sasanka Roy
2020Discrete Applied Mathematics2 citations Open access
Semantic Scholar
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, A. Maheshwari +1 more
2019Fundamenta Informaticae2 citations
Semantic Scholar
Maximum Bipartite Subgraph of Geometric Intersection Graphs
Satyabrata Jana, A. Maheshwari, S. Mehrabi, Sasanka Roy
2019Workshop on Algorithms and Computation2 citations Open access
Semantic Scholar
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
Sanjib Sadhu, Sasanka Roy, S. Nandy, Suchismita Roy
2019Theoretical Computer Science2 citations Open access
Semantic Scholar