Sasanka Roy

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013)

Sasanka Roy: Near optimal algorithm for the shortest descending path on the surface of a convex terrain. J. Discrete Algorithms 15: 63-70 (2012)

Minati De, Subhas C. Nandy, Sasanka Roy: In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM 2012: 327-338

Minati De, Subhas C. Nandy, Sasanka Roy: Minimum Enclosing Circle with Few Extra Variables. FSTTCS 2012: 510-521

Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy: On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. ISVD 2012: 132-137

Ritankar Mandal, Anirban Ghosh, Sasanka Roy, Subhas C. Nandy: Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles. CoRR abs/1212.0640 (2012)

Minati De, Subhas C. Nandy, Sasanka Roy: Convex Hull and Linear Programming in Read-only Setup with Limited Work-space. CoRR abs/1212.5353 (2012)

Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy: On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011)

John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy: Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. CATS 2011: 31-40

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized Geometric Query Problems. CoRR abs/1111.2918 (2011)

John Augustine, Brian Putnam, Sasanka Roy: Largest empty circle centered on a query line. J. Discrete Algorithms 8(2): 143-153 (2010)

Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010)

Sangameshwar Patil, Sasanka Roy, John Augustine, Amanda Redlich, Sachin Lodha, Harrick M. Vin, Anand Deshpande, Mangesh Gharote, Ankit Mehrotra: Minimizing Testing Overheads in Database Migration Lifecycle. COMAD 2010: 191

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location. CoRR abs/1004.0558 (2010)

Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy: Constrained minimum enclosing circle with center on a query line segment. Comput. Geom. 42(6-7): 632-638 (2009)

Debabrata Bardhan, Sasanka Roy, Sandip Das: Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon. Int. J. Comput. Geometry Appl. 19(4): 357-370 (2009)

Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A new fast heuristic for labeling points. Inf. Process. Lett. 109(10): 478-484 (2009)

John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy: Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks. CoRR abs/0902.3517 (2009)

Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy: Variations of Base-Station Placement Problem on the Boundary of a Convex Region. Int. J. Found. Comput. Sci. 19(2): 405-427 (2008)

Arindam Karmakar, Sasanka Roy, Sandip Das: Fast computation of smallest enclosing circle with center on a query line segment. Inf. Process. Lett. 108(6): 343-346 (2008)

Sasanka Roy, Debabrata Bardhan, Sandip Das: Base station placement on boundary of a convex polygon. J. Parallel Distrib. Comput. 68(2): 265-273 (2008)

Prosenjit Bose, Stefan Langerman, Sasanka Roy: Smallest enclosing circle centered on a query line segment. CCCG 2008

Arindam Karmakar, Sasanka Roy, Sandip Das: Guarding Exterior Region of a Simple Polygon. WALCOM 2008: 100-110

Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation Algorithms for Shortest Descending Paths in Terrains. CoRR abs/0805.1401 (2008)

John Augustine, Brian Putnam, Sasanka Roy: Largest Empty Circle Centered on a Query Line. CoRR abs/0809.2651 (2008)

Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007)

Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari: Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192

Arindam Karmakar, Sasanka Roy, Sandip Das: Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. CCCG 2007: 273-276

Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy: Base Station Placement Problem on the Boundary of a Convex Region. WALCOM 2007: 151-152

Debabrata Bardhan, Sasanka Roy, Sandip Das: Optimal Guard Placement Problem Under L-Visibility. ICCSA (1) 2006: 10-19

Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy: Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776

Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158

Sasanka Roy, Debabrata Bardhan, Sandip Das: Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. ICDCIT 2005: 105-116

Sasanka Roy, Sandip Das, Subhas C. Nandy: Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292

Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal algorithm for a special point-labeling problem. Inf. Process. Lett. 89(2): 91-98 (2004)

Sasanka Roy, Sandip Das, Subhas C. Nandy: A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. ICCSA (3) 2004: 42-52

Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120