Sasanka Roy

Orcid: 0000-0003-4174-4738

According to our database1, Sasanka Roy authored at least 74 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Geometric Covering via Extraction Theorem.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Constant delay lattice train schedules.
Discret. Appl. Math., November, 2023

Maximum Bipartite Subgraphs of Geometric Intersection Graphs.
Int. J. Comput. Geom. Appl., 2023

2022
The balanced connected subgraph problem for geometric intersection graphs.
Theor. Comput. Sci., 2022

The balanced connected subgraph problem.
Discret. Appl. Math., 2022

Collision-free routing problem with restricted L-path.
Discret. Appl. Math., 2022

Linear-size planar Manhattan network for convex point sets.
Comput. Geom., 2022

2021
Balanced Connected Graph Partition.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

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].
Theor. Comput. Sci., 2020

Optimal facility location problem on polyhedral terrains using descending paths.
Theor. Comput. Sci., 2020

Problems on One Way Road Networks.
J. Graph Algorithms Appl., 2020

Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.
Int. J. Found. Comput. Sci., 2020

Approximate Shortest Paths in Polygons with Violations.
Int. J. Comput. Geom. Appl., 2020

Constant work-space algorithms for facility location problems.
Discret. Appl. Math., 2020

Maximum Bipartite Subgraph of Geometric Intersection Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Covering Points with Pairs of Concentric Disks.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares.
Theor. Comput. Sci., 2019

Optimal deterministic distributed algorithms for maximal independent set in geometric graphs.
J. Parallel Distributed Comput., 2019

Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model.
Fundam. Informaticae, 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.
CoRR, 2019

Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points.
Comput. Geom., 2019

Covering segments with unit squares.
Comput. Geom., 2019

2018
Minimum width color spanning annulus.
Theor. Comput. Sci., 2018

Helly-Type Theorems in Property Testing.
Int. J. Comput. Geom. Appl., 2018

Fast Gaussian Process Regression for Big Data.
Big Data Res., 2018

Geometric Path Problems with Violations.
Algorithmica, 2018

Collision-Free Routing Problem with Restricted L-Path.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017
Faster approximation for maximum independent set on unit disk graph.
Inf. Process. Lett., 2017

On representing a simple polygon perceivable to a blind person.
Inf. Process. Lett., 2017

Rectilinear path problems in restricted memory setup.
Discret. Appl. Math., 2017

Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Covering Points: Minimizing the Maximum Depth.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Space-efficient algorithm for computing a centerpoint of a set of points in R<sup>2</sup>.
Theor. Comput. Sci., 2016

Color Spanning Annulus: Square, Rectangle and Equilateral Triangle.
CoRR, 2016

Covering segments with axis-parallel unit squares.
CoRR, 2016

2015
Prune-and-search with limited workspace.
J. Comput. Syst. Sci., 2015

Approximation algorithms for the two-center problem of convex polygon.
CoRR, 2015

Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Maximal and Maximum Transitive Relation Contained in a Given Binary Relation.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
In-place algorithms for computing a largest clique in geometric intersection graphs.
Discret. Appl. Math., 2014

Facility location problems in the constant work-space read-only memory model.
CoRR, 2014

Back-Up 2-Center on a Path/Tree/Cycle/Unicycle.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation.
Trans. Comput. Sci., 2013

Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks.
Int. J. Found. Comput. Sci., 2013

Localized geometric query problems.
Comput. Geom., 2013

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

Convex Hull and Linear Programming in Read-only Setup with Limited Work-space
CoRR, 2012

Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles
CoRR, 2012

Minimum Enclosing Circle with Few Extra Variables.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
On the number of shortest descending paths on the surface of a convex terrain.
J. Discrete Algorithms, 2011

2010
Largest empty circle centered on a query line.
J. Discrete Algorithms, 2010

Approximation algorithms for shortest descending paths in terrains.
J. Discrete Algorithms, 2010

Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location
CoRR, 2010

Minimizing Testing Overheads in Database Migration Lifecycle.
Proceedings of the 16th International Conference on Management of Data, 2010

2009
A new fast heuristic for labeling points.
Inf. Process. Lett., 2009

Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon.
Int. J. Comput. Geom. Appl., 2009

Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks
CoRR, 2009

Constrained minimum enclosing circle with center on a query line segment.
Comput. Geom., 2009

2008
Base station placement on boundary of a convex polygon.
J. Parallel Distributed Comput., 2008

Fast computation of smallest enclosing circle with center on a query line segment.
Inf. Process. Lett., 2008

Variations of Base-Station Placement Problem on the Boundary of a Convex Region.
Int. J. Found. Comput. Sci., 2008

Guarding Exterior Region of a Simple Polygon.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Smallest enclosing circle centered on a query line segment.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Shortest monotone descent path problem in polyhedral terrain.
Comput. Geom., 2007

Base Station Placement Problem on the Boundary of a Convex Region.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

Approximate Shortest Descent Path on a Terrain.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Optimal Guard Placement Problem Under L-Visibility.
Proceedings of the Computational Science and Its Applications, 2006

2005
Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone.
Proceedings of the Distributed Computing and Internet Technology, 2005

A Fast Algorithm for Point Labeling Problem.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Optimal algorithm for a special point-labeling problem.
Inf. Process. Lett., 2004

A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface.
Proceedings of the Computational Science and Its Applications, 2004


  Loading...