dblp.uni-trier.dewww.uni-trier.de

Sasanka Roy

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
20EEJohn 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
18EEArindam Karmakar, Sasanka Roy, Sandip Das: Guarding Exterior Region of a Simple Polygon. WALCOM 2008: 100-110
17EEMustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation Algorithms for Shortest Descending Paths in Terrains CoRR abs/0805.1401: (2008)
16EEJohn Augustine, Brian Putnam, Sasanka Roy: Largest Empty Circle Centered on a Query Line CoRR abs/0809.2651: (2008)
15EEArindam 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)
14EEGautam 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)
13EESasanka 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
9EESasanka Roy, Sandip Das, Subhas C. Nandy: Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007)
2006
8EEDebabrata Bardhan, Sasanka Roy, Sandip Das: Optimal Guard Placement Problem Under L-Visibility. ICCSA (1) 2006: 10-19
7EESasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy: Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776
2005
6EESasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy: A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158
5EESasanka Roy, Debabrata Bardhan, Sandip Das: Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. ICDCIT 2005: 105-116
4EESasanka Roy, Sandip Das, Subhas C. Nandy: Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292
2004
3EESasanka 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
2EESasanka 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
1EESasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy: Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120

Coauthor Index

1Mustaq Ahmed [17]
2John Augustine [16] [20]
3Debabrata Bardhan [5] [8] [13]
4Subhasis Bhattacharjee [6]
5Prosenjit Bose [19]
6Gautam K. Das [10] [14]
7Sandip Das [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [17] [18]
8Partha P. Goswami [1] [2]
9Qi Han [20]
10Arindam Karmakar [7] [11] [15] [18]
11Stefan Langerman [19]
12Philip Loden [20]
13Sachin Lodha [12] [17] [20]
14Anna Lubiw [17]
15Anil Maheshwari [12] [17]
16Subhas C. Nandy [1] [2] [3] [4] [6] [7] [9] [10] [14]
17Brian Putnam [16]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)