Academic Profile :

Sasanka Roy did his Bsc (in mathematics) from ABN Seal College, Cooch Behar and Masters in computer applications from North Bengal University. He did his PhD from Indian Statistical Institute. He worked at Tata Research Development and Design Centre, the R&D centre of Tata Consultancy Services, as a scientist and as a Centenary Postdoctoral Fellow at Indian Institute of Sciences. Prior to joining Indian Statistical Institute, he was a faculty member of Chennai Mathematical Institute and Indian Institute of Science Education and Research Kolkata and visiting professor at Simon Fraser University, Canada. He is currently an Associate Professor at the Advanced Computing and Microelectronics Unit, ISI Kolkata.

Publications :

Journal Publications

27) S. Sadhu, S. Roy, S. C. Nandy, S. Roy: Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. to appear in Theoretical Computer Science.
26) S. Sadhu, S. Roy, S Nandi, A. Maheshwari, S. C. Nandy: Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model, to apear in Fundamenta Informaticae.
25) S. Chakraborty, R. Pratap, S. Roy, S. Saraf: Helly-Type Theorems in Property Testing, to appear in International Journal of Computational Geometry and Applications.
24) S. Das, S. Roy, R. Sambasivan: Fast Gaussian Process Regression for Big Data, to appear in Big Data Research.
23) A. Acharyya, S. C. Nandy, S. Roy: Minimum Width Color Spanning Annulus. Theoretical Computer Science. Vol. 725: 16-30 (2018).
22) D. Pattanayak, A. Maheshwari, S. C. Nandy, S. Roy, M. Smid: Geometric Path Problems with Violations. Algorithimca, Vol. 80: 448-471 (2018).
21) S. C. Nandy, S. Pandit, S. Roy: Faster Approximation for Maximum Independent Set on Unit Disk Graph. Information Processing Letters. Vol. 127: 58-61 (2017).
20) B. K. Bhattacharya, M. De, A. Maheshwari, S. C. Nandy, S. Roy: Rectilinear Path Problems in Restricted Memory Setup. Discrete Applied Mathematics. Vol. 228: 80-87 (2017) (invited in special issue of CALDAM 2015).
19) S. Banerjee, B. B. Bhattacharya, B. Bhattacharya, A. Biswas, S. Das, R. Mandal, S. Roy: On Representing a Simple Polygon Perceivable to a Blind Person. Information Processing Letters. Vol. 120: 1-5 (2017).
18) B. K. Bhattacharya, S. C. Nandy, S. Roy: Space-efficient algorithm for computing a centerpoint of a set of points in R 2 . Theoretical Computer Science. Vol. 615: 61-70 (2016).
17) M. De, S. C. Nandy, S. Roy: Prune-and-Search with Limited Work-space. Journal of Computer and System Sciences. Vol. 81: 398-414, 2015.
16) M. De, S. C. Nandy, S. Roy: In-place algorithms for computing a largest clique in geometric inter-section graphs. Discrete Applied Mathematics. Vol. 178: 58-70 (2014).
15) J. Augustine, S. Das, A. Maheshwari, S. Nandy, S. Roy , S. Sarvattomananda: Localized Geometric Query Problems, Computational Geometry Theory and Applications. Vol. 46: 340-357 (2013).
14) S. Roy: Near optimal algorithm for the shortest descending path on the surface of a convex terrain, Journal of Discrete Algorithms. Vol. 15: 63-70 (2012).
13) J. Augustine, Q. Han, P. Loden, S. Lodha, S. Roy: Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks. International Journal of Foundations of Computer Science. Vol. 24: 31-50 (2013) (invited in special issue of CATS 2011).
12) S. Banerjee, B. B. Bhattacharya, S. Das, A. Karmakar, A. Maheshwari, S. Roy: On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. Transactions on Computational Science. Vol. 20: 22-38 (2013) (Invited in special issue of ISVD 2012).
11) M. Ahmed, A. Maheshwari, S. C. Nandy, S. Roy: On number of shortest descent paths on convexpolyhedron. Journal of Discrete Algorithms. Vol. 9: 182-189 (2011).10) J. Augustine, B. Putnam, S. Roy: Largest empty circle centered on a query Line. Journal of Discrete Algorithms. Vol. 8: 143-153 (2010).
9) M. Ahmed, S. Das, S. Lodha, A. Lubiw, A. Maheshwari, S. Roy: Approximation Algorithms for Shortest Descending Paths in Terrains. Journal of Discrete Algorithms. Vol. 8: 214-230 (2010).
8) S. Roy, A. Karmakar, S. Das, S. C. Nandy: Constrained minimum enclosing circle with center on a query line segment. Computational Geometry Theory and Applications. Vol. 42: 632-638 (2009).
7) D. Bardhan, S. Roy, S. Das: Optimal guard placement problem under L-visibility, International Journal of Computational Geometry and Applications. Vol. 10: 478-484 (2009) (invited in special issue of ICCSA 2006).
6) S. Roy, S. Bhattacharjee, S. Das, S. C. Nandy: A fast algorithm for point labeling problem. Information Processing Letters. Vol. 109: 478-484. 2009.
5) A. Karmakar, S. Roy, S. Das, Fast Computation of smallest enclosing circle with center on a query line segment. Information Processing Letters. Vol. 108: 343-346 (2008).
4) G. K. Das, S. Roy, S. Das, S. C. Nandy: Variations of base station placement problem on the boundary of a convex region. International Journal of Foundations of Computer Science. Vol. 19: 405-427 (2008).
3) S. Roy, D. Bardhan, S. Das: Base station placement on boundary of a convex polygon. Journal of Parallel and Distributed Computing. Vol. 68: 263-275 (2008).
2) S. Roy, S. Das, S. C. Nandy: Shortest monotone descent path problem in polyhedral terrain. Computational Geometry: Theory and Applications. Vol. 37: 115-133 (2007).
1) S. Roy, P P. Goswami, S. Das, S. C. Nandy: Optimal algorithm for a special point-labeling problem. Information Processing Letters. Vol. 89: 91-98 (2004).

Conference Publications:

C-30) J. Ajay and S. Roy: Collision-free Routing Problem with Restricted L-path. to appear at IWOCA 2018.
C-29) H. Kaplan, S. Roy and M. Sharir: Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. ESA 2017: 52:1-52:13.
C-28) A. Acharyya, S. C. Nandy, S. Pandit, S. Roy: Covering segments with unit squares. WADS 2017: 1-12.
C-27) S. Sadhu, S. Roy, S. C. Nandy, S. Roy: Optimal covering and hitting of line segments by two axis-parallel squares. COCOON 2017: 457-468.
C-26) S. Sadhu, S. Roy , S. Nandi, S. C. Nandy, S. Roy: Computing the triangle maximizing the length of its smallest side inside a convex polygon. ICCSA 2017: 509-524.
C-25) S. C. Nandy, S. Pandit, S. Roy: Covering Points: Minimizing the Maximum Depth. CCCG 2017: 37-42.
C-24) A. Acharyya, S. C. Nandy, S. Roy: Minimum Width Color Spanning Annulus. COCOON 2016: 431-442.
C-23) S. Chakraborty, S. Ghosh, N. Jha, S. Roy: Maximal and Maximum Transitive Relation Contained in a Given Binary Relation, COCOON 2015: 587-600.
C-22) N. Banerjee, S. Chakraborty, V. Raman, S. Roy, S. Saurabh: Time-space Tradeoffs for Dynamic Programming in Trees and Bounded Treewidth Graphs. COCOON 2015: 349-360.
C-21) B. K. Bhattacharya, M. De, A. Maheshwari, S. C. Nandy, S. Roy: Maximum Independent Set for Interval Graph and Tree in Space-efficient Models. CALDAM 2015: 69-80.
C-20) B. K. Bhattacharya, S. C. Nandy, S. Roy: Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R 2 . CCCG 2014: 26-32.
C-19) B. K. Bhattacharya, M. De, S. C. Nandy, S. Roy: Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG 2014: 226-232.
C-18) S. Chakraborty, R. Pratap, S. Roy, S. Saraf: Helly-Type Theorems in Property Testing. LATIN 2014: 306-317.
C-17) B. K. Bhattacharya, M. De, T. Kameda, S. Roy, V. Sokol, Z. Song: Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON 2014: 417-428.
C-16) M. De, S. C. Nandy, S. Roy: Minimum Enclosing Circle with Few Extra Variables, FSTTCS 2012: 510-521.
C-15) M. De, S. C. Nandy, S. Roy: In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs, FAW-AIM 2012: 327-338.
C-14) S. Banerjee, B. B. Bhattacharya, S. Das, A. Karmakar, A. Maheshwari, S. Roy: On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation, ISVD 2012: 132-137.
C-13) J. Augustine, Q. Han, P. Loden, S. Lodha, S. Roy: Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks. CATS 2011: 31-41.
C-12) S. Patil, S. Roy, J. Augustine, A. Redlich, A. Deshpande, M. Gharote, S. Lodha, A. Mehrotra, H. Vin: Minimizing Application Testing in Database Migration. COMAD 2010: 191-201.
C-11) P. Bose, S. Langerman, S. Roy: Smallest enclosing circle centered on a query line segment. CCCG 2008: 167-170.
C-10) A. Karmakar, S. Roy, S Das: Guarding exterior region of a simple polygon. WALCOM 2008: 100-110.
C-9) S. Roy, S. Lodha, S. Das, A. Maheshwari: Approximate shortest descent path on a terrain. CCCG 2008: 189-192.
C-8) A. Karmakar, S. Roy, S Das: Fast Computation of smallest enclosing circle with center on a query line segment. CCCG 2008: 273-276.
C-7) S. Roy, A. Karmakar, S. Das, S. C. Nandy: Constrained minimum enclosing circle with center on a query line segment. MFCS 2006: 765-776.
C-6) D. Bardhan, S. Roy, S. Das: Optimal guard placement problem under L-visibility. ICCSA 2006: 10-19.
C-5) S. Roy, D. Bardhan, S Das: Efficient algorithm for placing base stations by avoiding forbidden zone. ICDCIT 2005: 105- 116.
C-4) S. Roy, S. Bhattacharjee, S. Das, S. C.Nandy: A Fast algorithm for point labeling problem. CCCG 2005: 152-155.
C-3) S. Roy, S. Das, S. C. Nandy: Shortest monotone descent path problem in polyhedral terrain. STACS 2005: 281-292.
C-2)S. Roy, S. Das, S. C. Nandy: A practical algorithm for approximating shortest weighted path between a pair of points on polyhedral surface. ICCSA 2004: 42-52.
C-1) S. Roy, P. P. Goswami, S. Das, S. C. Nandy: Optimal algorithm for a special point-labeling problem. SWAT 2002: 110-120.