Sasanka Roy

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 52

Top Venues

Publications

Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M, Bodhayan Roy, Sasanka Roy, Abhishek Sahu
Minimum Consistent Subset in Trees and Interval Graphs. CoRR (2024)
Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan
Geometric Covering via Extraction Theorem. ITCS (2024)
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira
Constant delay lattice train schedules. Discret. Appl. Math. 339 (2023)
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
Maximum Bipartite Subgraphs of Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 33 (3&4) (2023)
Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
The balanced connected subgraph problem for geometric intersection graphs. Theor. Comput. Sci. 929 (2022)
Jammigumpula Ajay, Satyabrata Jana, Sasanka Roy
Collision-free routing problem with restricted L-path. Discret. Appl. Math. 319 (2022)
Satyabrata Jana, Anil Maheshwari, Sasanka Roy
Linear-size planar Manhattan network for convex point sets. Comput. Geom. 100 (2022)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The balanced connected subgraph problem. Discret. Appl. Math. 319 (2022)
Satyabrata Jana, Supantha Pandit, Sasanka Roy
Balanced Connected Graph Partition. CALDAM (2021)
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira
Constant Delay Lattice Train Schedules. CCCG (2021)
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira
Constant Delay Lattice Train Schedules. CoRR (2021)
Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
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]. Theor. Comput. Sci. 806 (2020)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy
Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. Int. J. Found. Comput. Sci. 31 (4) (2020)
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
Constant work-space algorithms for facility location problems. Discret. Appl. Math. 283 (2020)
Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid
Covering Points with Pairs of Concentric Disks. CCCG (2020)
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
Maximum Bipartite Subgraph of Geometric Intersection Graphs. WALCOM (2020)
Binayak Dutta, Sasanka Roy
Approximate Shortest Paths in Polygons with Violations. Int. J. Comput. Geom. Appl. 30 (1) (2020)
Jammigumpula Ajay, Avinandan Das, Binayak Dutta, Arindam Karmakar, Sasanka Roy, Navaneeta Saikia
Problems on One Way Road Networks. J. Graph Algorithms Appl. 24 (3) (2020)
Binayak Dutta, Arindam Karmakar, Sasanka Roy
Optimal facility location problem on polyhedral terrains using descending paths. Theor. Comput. Sci. 847 (2020)
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
Maximum Bipartite Subgraph of Geometric Intersection Graphs. CoRR (2019)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. Fundam. Informaticae 164 (1) (2019)
Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
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. CoRR (2019)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The Balanced Connected Subgraph Problem. CALDAM (2019)
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering segments with unit squares. Comput. Geom. 79 (2019)
Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. CoRR (2019)
Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. COCOA (2019)
Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. Theor. Comput. Sci. 769 (2019)
Anisur Rahaman Molla, Supantha Pandit, Sasanka Roy
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. J. Parallel Distributed Comput. 132 (2019)
Satyabrata Jana, Anil Maheshwari, Sasanka Roy
Linear Size Planar Manhattan Network for Convex Point Sets. CoRR (2019)
Haim Kaplan, Sasanka Roy, Micha Sharir
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. 81 (2019)
Binayak Dutta, Sasanka Roy
Approximate Shortest Paths in Polygons with Violations. COCOA (2019)
Sourish Das, Sasanka Roy, Rajiv Sambasivan
Fast Gaussian Process Regression for Big Data. Big Data Res. 14 (2018)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The Balanced Connected Subgraph Problem. CoRR (2018)
Jammigumpula Ajay, Sasanka Roy
Collision-Free Routing Problem with Restricted L-Path. IWOCA (2018)
Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
Minimum width color spanning annulus. Theor. Comput. Sci. 725 (2018)
Sourav Chakraborty, Shamik Ghosh, Nitesh Jha, Sasanka Roy
Maximal and maximum transitive relation contained in a given binary relation. CoRR (2018)
Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf
Helly-Type Theorems in Property Testing. Int. J. Comput. Geom. Appl. 28 (4) (2018)
Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid
Geometric Path Problems with Violations. Algorithmica 80 (2) (2018)
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering Points: Minimizing the Maximum Depth. CCCG (2017)
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering Segments with Unit Squares. WADS (2017)
Haim Kaplan, Sasanka Roy, Micha Sharir
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. ESA (2017)
Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. CoRR (2017)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy
Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. ICCSA (2) (2017)
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228 (2017)
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. 127 (2017)
Sandip Banerjee, Bhargab B. Bhattacharya, Binay Bhattacharya, Arindam Biswas, Sandip Das, Ritankar Mandal, Sasanka Roy
On representing a simple polygon perceivable to a blind person. Inf. Process. Lett. 120 (2017)
Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. COCOON (2017)
Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
Color Spanning Annulus: Square, Rectangle and Equilateral Triangle. CoRR (2016)
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering segments with axis-parallel unit squares. CoRR (2016)
Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
. Theor. Comput. Sci. 615 (2016)
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Faster Approximation for Maximum Independent Set on Unit Disk Graph. CoRR (2016)
Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
Minimum Width Color Spanning Annulus. COCOON (2016)
Sourish Das, Sasanka Roy, Rajiv Sambasivan
Fast Gaussian Process Regression for Big Data. CoRR (2015)
Minati De, Subhas C. Nandy, Sasanka Roy
Prune-and-search with limited workspace. J. Comput. Syst. Sci. 81 (2) (2015)
Sourav Chakraborty, Shamik Ghosh, Nitesh Jha, Sasanka Roy
Maximal and Maximum Transitive Relation Contained in a Given Binary Relation. COCOON (2015)
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. COCOON (2015)
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
Rectilinear Path Problems in Restricted Memory Setup. CALDAM (2015)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
Approximation algorithms for the two-center problem of convex polygon. CoRR (2015)
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
Facility location problems in the constant work-space read-only memory model. CoRR (2014)
Minati De, Subhas C. Nandy, Sasanka Roy
In-place algorithms for computing a largest clique in geometric intersection graphs. Discret. Appl. Math. 178 (2014)
Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON (2014)
Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf
Helly-Type Theorems in Property Testing. LATIN (2014)
Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. CCCG (2014)
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG (2014)
Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy
On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. Trans. Comput. Sci. 20 (2013)
Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf
Helly-Type Theorems in Property Testing. CoRR (2013)
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
Localized geometric query problems. Comput. Geom. 46 (3) (2013)
John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. Int. J. Found. Comput. Sci. 24 (1) (2013)
Minati De, Subhas C. Nandy, Sasanka Roy
Minimum Enclosing Circle with Few Extra Variables. FSTTCS (2012)
Minati De, Subhas C. Nandy, Sasanka Roy
Convex Hull and Linear Programming in Read-only Setup with Limited Work-space CoRR (2012)
Minati De, Subhas C. Nandy, Sasanka Roy
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM (2012)
Sasanka Roy
Near optimal algorithm for the shortest descending path on the surface of a convex terrain. J. Discrete Algorithms 15 (2012)
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)
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 (2012)
John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. CATS (2011)
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
Localized Geometric Query Problems CoRR (2011)
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) (2011)
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 (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) (2010)
John Augustine, Brian Putnam, Sasanka Roy
Largest empty circle centered on a query line. J. Discrete Algorithms 8 (2) (2010)
Sangameshwar Patil, Sasanka Roy, John Augustine, Amanda Redlich, Sachin Lodha, Harrick M. Vin, Anand Deshpande, Mangesh S. Gharote, Ankit Mehrotra
Minimizing Testing Overheads in Database Migration Lifecycle. COMAD (2010)
John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy
Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks CoRR (2009)
Debabrata Bardhan, Sasanka Roy, Sandip Das
Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon. Int. J. Comput. Geom. Appl. 19 (4) (2009)
Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy
A new fast heuristic for labeling points. Inf. Process. Lett. 109 (10) (2009)
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) (2009)
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy
Approximation Algorithms for Shortest Descending Paths in Terrains CoRR (2008)
Prosenjit Bose, Stefan Langerman, Sasanka Roy
Smallest enclosing circle centered on a query line segment. CCCG (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) (2008)
Sasanka Roy, Debabrata Bardhan, Sandip Das
Base station placement on boundary of a convex polygon. J. Parallel Distributed Comput. 68 (2) (2008)
John Augustine, Brian Putnam, Sasanka Roy
Largest Empty Circle Centered on a Query Line CoRR (2008)
Arindam Karmakar, Sasanka Roy, Sandip Das
Guarding Exterior Region of a Simple Polygon. WALCOM (2008)
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) (2008)
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
Base Station Placement Problem on the Boundary of a Convex Region. WALCOM (2007)
Sasanka Roy, Sandip Das, Subhas C. Nandy
Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37 (2) (2007)
Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari
Approximate Shortest Descent Path on a Terrain. CCCG (2007)
Arindam Karmakar, Sasanka Roy, Sandip Das
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. CCCG (2007)
Debabrata Bardhan, Sasanka Roy, Sandip Das
Optimal Guard Placement Problem Under L-Visibility. ICCSA (1) (2006)
Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy
Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS (2006)
Sasanka Roy, Sandip Das, Subhas C. Nandy
Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS (2005)
Sasanka Roy, Debabrata Bardhan, Sandip Das
Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. ICDCIT (2005)

Sasanka Roy.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sasanka Roy