Sasanka Roy - RankMe

106 papers A 3B 6C 3Misc 7Journal 66Unranked 21

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