| 2009 | 
|---|
| 20 | EE | 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) | 
| 2008 | 
|---|
| 19 |  | Prosenjit Bose,
Stefan Langerman,
Sasanka Roy:
Smallest enclosing circle centered on a query line segment.
CCCG 2008 | 
| 18 | EE | Arindam Karmakar,
Sasanka Roy,
Sandip Das:
Guarding Exterior Region of a Simple Polygon.
WALCOM 2008: 100-110 | 
| 17 | EE | 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) | 
| 16 | EE | John Augustine,
Brian Putnam,
Sasanka Roy:
Largest Empty Circle Centered on a Query Line
CoRR abs/0809.2651:  (2008) | 
| 15 | EE | 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) | 
| 14 | EE | 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) | 
| 13 | EE | Sasanka Roy,
Debabrata Bardhan,
Sandip Das:
Base station placement on boundary of a convex polygon.
J. Parallel Distrib. Comput. 68(2): 265-273 (2008) | 
| 2007 | 
|---|
| 12 |  | Sasanka Roy,
Sachin Lodha,
Sandip Das,
Anil Maheshwari:
Approximate Shortest Descent Path on a Terrain.
CCCG 2007: 189-192 | 
| 11 |  | Arindam Karmakar,
Sasanka Roy,
Sandip Das:
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment.
CCCG 2007: 273-276 | 
| 10 |  | 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 | 
| 9 | EE | Sasanka Roy,
Sandip Das,
Subhas C. Nandy:
Shortest monotone descent path problem in polyhedral terrain.
Comput. Geom. 37(2): 115-133 (2007) | 
| 2006 | 
|---|
| 8 | EE | Debabrata Bardhan,
Sasanka Roy,
Sandip Das:
Optimal Guard Placement Problem Under L-Visibility.
ICCSA (1) 2006: 10-19 | 
| 7 | EE | Sasanka Roy,
Arindam Karmakar,
Sandip Das,
Subhas C. Nandy:
Constrained Minimum Enclosing Circle with Center on a Query Line Segment.
MFCS 2006: 765-776 | 
| 2005 | 
|---|
| 6 | EE | Sasanka Roy,
Subhasis Bhattacharjee,
Sandip Das,
Subhas C. Nandy:
A Fast Algorithm for Point Labeling Problem.
CCCG 2005: 155-158 | 
| 5 | EE | Sasanka Roy,
Debabrata Bardhan,
Sandip Das:
Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone.
ICDCIT 2005: 105-116 | 
| 4 | EE | Sasanka Roy,
Sandip Das,
Subhas C. Nandy:
Shortest Monotone Descent Path Problem in Polyhedral Terrain.
STACS 2005: 281-292 | 
| 2004 | 
|---|
| 3 | EE | 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 | 
| 2 | EE | 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) | 
| 2002 | 
|---|
| 1 | EE | Sasanka Roy,
Partha P. Goswami,
Sandip Das,
Subhas C. Nandy:
Optimal Algorithm for a Special Point-Labeling Problem.
SWAT 2002: 110-120 |