A Predictive Location Management Scheme by Extracting the Unique Sub-patterns from the Mobility Logs. - Subrata Nandi; Sanjib Sadhu (ICDCN, 2006)

Cluster connecting problem inside a polygon. - Sanjib Sadhu; Arijit Bishnu; Subhas C. Nandy; Partha P. Goswami (CCCG, 2010)

Modeling broadcasting using omnidirectional and directional antenna in delay tolerant networks as an epidemic dynamics. - Fernando Peruani; Aurghya Maiti; Sanjib Sadhu; Hugues Chaté; Romit Roy Choudhury; Niloy Ganguly (IEEE J. Sel. Areas Commun., 2010)

GRP_CH Heuristic for Generating Random Simple Polygon. - Sanjib Sadhu; Subhashis Hazarika; Kapil Kumar Jain; Saurav Basu; Tanmay De (IWOCA, 2012)

Random polygon generation using 'GRP_AS' heuristic. - Sanjib Sadhu; Niraj Kumar (IC3, 2013)

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

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)

Maximum-width Axis-Parallel Empty Rectangular Annulus. - Arpita Baral; Abhilash Gondane; Sanjib Sadhu; Priya Ranjan Sinha Mahapatra (CoRR, 2017)

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)

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)

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)

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)

Color-Spanning Problem for Line Segments. - Sukanya Maji; Sanjib Sadhu (ICCSA (1), 2022)

Arbitrary-Oriented Color Spanning Region for Line Segments. - Sukanya Maji; Sanjib Sadhu (CALDAM, 2023)

Red-Blue Rectangular Annulus Cover Problem. - Sukanya Maji; Supantha Pandit; Sanjib Sadhu (IJTCS-FAW, 2023)

Generalized Red-Blue Circular Annulus Cover Problem. - Sukanya Maji; Supantha Pandit; Sanjib Sadhu (CoRR, 2024)

Discrete and mixed two-center problems for line segments. - Sukanya Maji; Sanjib Sadhu (Inf. Process. Lett., 2024)