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

Optimal algorithm for a special point-labeling problem. - Sasanka Roy; Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 2004)

A Fast Algorithm for Point Labeling Problem. - Sasanka Roy; Subhasis Bhattacharjee; Sandip Das 001; Subhas C. Nandy (CCCG, 2005)

Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. - Sasanka Roy; Debabrata Bardhan; Sandip Das 001 (ICDCIT, 2005)

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

Approximate Shortest Descent Path on a Terrain. - Sasanka Roy; Sachin Lodha; Sandip Das 001; Anil Maheshwari (CCCG, 2007)

Base Station Placement Problem on the Boundary of a Convex Region. - Gautam K. Das; Sasanka Roy; Sandip Das 001; Subhas C. Nandy (WALCOM, 2007)

Shortest monotone descent path problem in polyhedral terrain. - Sasanka Roy; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2007)

Smallest enclosing circle centered on a query line segment. - Prosenjit Bose; Stefan Langerman; Sasanka Roy (CCCG, 2008)

Guarding Exterior Region of a Simple Polygon. - Arindam Karmakar; Sasanka Roy; Sandip Das 001 (WALCOM, 2008)

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

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

Base station placement on boundary of a convex polygon. - Sasanka Roy; Debabrata Bardhan; Sandip Das 001 (J. Parallel Distributed Comput., 2008)

Constrained minimum enclosing circle with center on a query line segment. - Sasanka Roy; Arindam Karmakar; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2009)

Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks - John Augustine; Qi Han 001; Philip Loden; Sachin Lodha; Sasanka Roy (CoRR, 2009)

Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon. - Debabrata Bardhan; Sasanka Roy; Sandip Das 001 (Int. J. Comput. Geom. Appl., 2009)

A new fast heuristic for labeling points. - Sasanka Roy; Subhasis Bhattacharjee; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 2009)

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

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

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

Largest empty circle centered on a query line. - John Augustine; Brian Putnam; Sasanka Roy (J. Discrete Algorithms, 2010)

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

Minimum Enclosing Circle with Few Extra Variables. - Minati De; Subhas C. Nandy; Sasanka Roy (FSTTCS, 2012)

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

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

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

Localized geometric query problems. - John Augustine; Sandip Das 001; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy; Swami Sarvattomananda (Comput. Geom., 2013)

Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. - John Augustine; Qi Han 001; Philip Loden; Sachin Lodha; Sasanka Roy (Int. J. Found. Comput. Sci., 2013)

On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. - Sandip Banerjee; Bhargab B. Bhattacharya; Sandip Das 001; Arindam Karmakar; Anil Maheshwari; Sasanka Roy (Trans. Comput. Sci., 2013)

Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (CCCG, 2014)

Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. - Binay K. Bhattacharya; Subhas C. Nandy; Sasanka Roy (CCCG, 2014)

Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. - Binay K. Bhattacharya; Minati De; Tsunehiko Kameda; Sasanka Roy; Vladyslav Sokol; Zhao Song 002 (COCOON, 2014)

Facility location problems in the constant work-space read-only memory model. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (CoRR, 2014)

In-place algorithms for computing a largest clique in geometric intersection graphs. - Minati De; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2014)

Maximal and Maximum Transitive Relation Contained in a Given Binary Relation. - Sourav Chakraborty 001; Shamik Ghosh; Nitesh Jha; Sasanka Roy (COCOON, 2015)

Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001; Sasanka Roy; Saket Saurabh 001 (COCOON, 2015)

Approximation algorithms for the two-center problem of convex polygon. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Anil Maheshwari; Subhas C. Nandy (CoRR, 2015)

Prune-and-search with limited workspace. - Minati De; Subhas C. Nandy; Sasanka Roy (J. Comput. Syst. Sci., 2015)

Covering segments with axis-parallel unit squares. - Ankush Acharyya; Subhas C. Nandy; Supantha Pandit; Sasanka Roy (CoRR, 2016)

Color Spanning Annulus: Square, Rectangle and Equilateral Triangle. - Ankush Acharyya; Subhas C. Nandy; Sasanka Roy (CoRR, 2016)

Space-efficient algorithm for computing a centerpoint of a set of points in R2. - Binay K. Bhattacharya; Subhas C. Nandy; Sasanka Roy (Theor. Comput. Sci., 2016)

Covering Points: Minimizing the Maximum Depth. - Subhas C. Nandy; Supantha Pandit; Sasanka Roy (CCCG, 2017)

Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. - Sanjib Sadhu; Sasanka Roy; Subhas C. Nandy; Suchismita Roy (COCOON, 2017)

Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Subhas C. Nandy; Suchismita Roy (ICCSA (2), 2017)

Rectilinear path problems in restricted memory setup. - Binay K. Bhattacharya; Minati De; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2017)

On representing a simple polygon perceivable to a blind person. - Sandip Banerjee; Bhargab B. Bhattacharya; Binay Bhattacharya; Arindam Biswas 002; Sandip Das 001; Ritankar Mandal; Sasanka Roy (Inf. Process. Lett., 2017)

Faster approximation for maximum independent set on unit disk graph. - Subhas C. Nandy; Supantha Pandit; Sasanka Roy (Inf. Process. Lett., 2017)

Collision-Free Routing Problem with Restricted L-Path. - Jammigumpula Ajay; Sasanka Roy (IWOCA, 2018)

Geometric Path Problems with Violations. - Anil Maheshwari; Subhas C. Nandy; Drimit Pattanayak; Sasanka Roy; Michiel H. M. Smid (Algorithmica, 2018)

Fast Gaussian Process Regression for Big Data. - Sourish Das; Sasanka Roy; Rajiv Sambasivan (Big Data Res., 2018)

Helly-Type Theorems in Property Testing. - Sourav Chakraborty 001; Rameshwar Pratap; Sasanka Roy; Shubhangi Saraf (Int. J. Comput. Geom. Appl., 2018)

Minimum width color spanning annulus. - Ankush Acharyya; Subhas C. Nandy; Sasanka Roy (Theor. Comput. Sci., 2018)

Covering segments with unit squares. - Ankush Acharyya; Subhas C. Nandy; Supantha Pandit; Sasanka Roy (Comput. Geom., 2019)

Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. - Haim Kaplan; Sasanka Roy; Micha Sharir (Comput. Geom., 2019)

Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63-74. - Sanjib Sadhu; Xiaozhou He; Sasanka Roy; Subhas C. Nandy; Suchismita Roy (CoRR, 2019)

Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Anil Maheshwari; Subhas C. Nandy (Fundam. Informaticae, 2019)

Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. - Anisur Rahaman Molla; Supantha Pandit; Sasanka Roy (J. Parallel Distributed Comput., 2019)

Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. - Sanjib Sadhu; Sasanka Roy; Subhas C. Nandy; Suchismita Roy (Theor. Comput. Sci., 2019)

Covering Points with Pairs of Concentric Disks. - Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy; Michiel Smid (CCCG, 2020)

Maximum Bipartite Subgraph of Geometric Intersection Graphs. - Satyabrata Jana; Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy (WALCOM, 2020)

Constant work-space algorithms for facility location problems. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2020)

Approximate Shortest Paths in Polygons with Violations. - Binayak Dutta; Sasanka Roy (Int. J. Comput. Geom. Appl., 2020)

Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Subhas C. Nandy; Suchismita Roy (Int. J. Found. Comput. Sci., 2020)

Problems on One Way Road Networks. - Jammigumpula Ajay; Avinandan Das; Binayak Dutta; Arindam Karmakar; Sasanka Roy; Navaneeta Saikia (J. Graph Algorithms Appl., 2020)

Optimal facility location problem on polyhedral terrains using descending paths. - Binayak Dutta; Arindam Karmakar; Sasanka Roy (Theor. Comput. Sci., 2020)

Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares" [Theor. Comput. Sci. 769 (2019) 63-74]. - Sanjib Sadhu; Xiaozhou He; Sasanka Roy; Subhas C. Nandy; Suchismita Roy (Theor. Comput. Sci., 2020)

Balanced Connected Graph Partition. - Satyabrata Jana; Supantha Pandit; Sasanka Roy (CALDAM, 2021)

Linear-size planar Manhattan network for convex point sets. - Satyabrata Jana; Anil Maheshwari; Sasanka Roy (Comput. Geom., 2022)

Collision-free routing problem with restricted L-path. - Jammigumpula Ajay; Satyabrata Jana; Sasanka Roy (Discret. Appl. Math., 2022)

The balanced connected subgraph problem. - Sujoy Bhore; Sourav Chakraborty 001; Satyabrata Jana; Joseph S. B. Mitchell; Supantha Pandit; Sasanka Roy (Discret. Appl. Math., 2022)

The balanced connected subgraph problem for geometric intersection graphs. - Sujoy Bhore; Satyabrata Jana; Supantha Pandit; Sasanka Roy (Theor. Comput. Sci., 2022)

Maximum Bipartite Subgraphs of Geometric Intersection Graphs. - Satyabrata Jana; Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy (Int. J. Comput. Geom. Appl., 2023)

Constant delay lattice train schedules. - Jean-Lou De Carufel; Darryl Hill; Anil Maheshwari; Sasanka Roy; Luís Fernando Schultz Xavier da Silveira (Discret. Appl. Math., 2023)

Minimum Consistent Subset in Trees and Interval Graphs. - Aritra Banik; Sayani Das; Anil Maheshwari; Bubai Manna; Subhas C. Nandy; Krishna Priya K. M.; Bodhayan Roy; Sasanka Roy; Abhishek Sahu (FSTTCS, 2024)

Geometric Covering via Extraction Theorem. - Sayan Bandyapadhyay; Anil Maheshwari; Sasanka Roy; Michiel Smid; Kasturi R. Varadarajan (ITCS, 2024)