Sanjib Sadhu

According to our database1, Sanjib Sadhu authored at least 19 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Discrete and mixed two-center problems for line segments.
Inf. Process. Lett., February, 2024

Generalized Red-Blue Circular Annulus Cover Problem.
CoRR, 2024

2023
Red-Blue Rectangular Annulus Cover Problem.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

Arbitrary-Oriented Color Spanning Region for Line Segments.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
Color-Spanning Problem for Line Segments.
Proceedings of the Computational Science and Its Applications - ICCSA 2022, 2022

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

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

2019
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares.
Theor. Comput. Sci., 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

2017
Maximum-width Axis-Parallel Empty Rectangular Annulus.
CoRR, 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

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

2013
Random polygon generation using 'GRP_AS' heuristic.
Proceedings of the Sixth International Conference on Contemporary Computing, 2013

2012
GRP_CH Heuristic for Generating Random Simple Polygon.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2010
Modeling broadcasting using omnidirectional and directional antenna in delay tolerant networks as an epidemic dynamics.
IEEE J. Sel. Areas Commun., 2010

Cluster connecting problem inside a polygon.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2006
A Predictive Location Management Scheme by Extracting the Unique Sub-patterns from the Mobility Logs.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006


  Loading...