default search action
Sanjib Sadhu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Sukanya Maji, Sanjib Sadhu:
Discrete and mixed two-center problems for line segments. Inf. Process. Lett. 184: 106451 (2024) - [i5]Sukanya Maji, Supantha Pandit, Sanjib Sadhu:
Generalized Red-Blue Circular Annulus Cover Problem. CoRR abs/2402.13767 (2024) - 2023
- [c9]Sukanya Maji, Sanjib Sadhu:
Arbitrary-Oriented Color Spanning Region for Line Segments. CALDAM 2023: 71-86 - [c8]Sukanya Maji, Supantha Pandit, Sanjib Sadhu:
Red-Blue Rectangular Annulus Cover Problem. IJTCS-FAW 2023: 195-211 - 2022
- [c7]Sukanya Maji, Sanjib Sadhu:
Color-Spanning Problem for Line Segments. ICCSA (1) 2022: 76-89 - 2020
- [j5]Sanjib Sadhu, Sasanka Roy, Soumen Nandi
, Subhas C. Nandy
Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. Int. J. Found. Comput. Sci. 31(4): 421-443 (2020) - [j4]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: 632-640 (2020)
2010 – 2019
- 2019
- [j3]Sanjib Sadhu, Sasanka Roy, Soumen Nandi
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. Fundam. Informaticae 164(1): 119-138 (2019) - [j2]Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. Theor. Comput. Sci. 769: 63-74 (2019) - [i4]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 abs/1909.09445 (2019) - 2017
- [c6]Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. COCOON 2017: 457-468 - [c5]Sanjib Sadhu, Sasanka Roy, Soumen Nandi
Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. ICCSA (2) 2017: 509-524 - [i3]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 abs/1709.04870 (2017) - [i2]Arpita Baral, Abhilash Gondane, Sanjib Sadhu, Priya Ranjan Sinha Mahapatra:
Maximum-width Axis-Parallel Empty Rectangular Annulus. CoRR abs/1712.00375 (2017) - 2015
- [i1]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy:
Approximation algorithms for the two-center problem of convex polygon. CoRR abs/1512.02356 (2015) - 2013
- [c4]Sanjib Sadhu, Niraj Kumar:
Random polygon generation using 'GRP_AS' heuristic. IC3 2013: 13-17 - 2012
- [c3]Sanjib Sadhu, Subhashis Hazarika
GRP_CH Heuristic for Generating Random Simple Polygon. IWOCA 2012: 293-302 - 2010
- [j1]Fernando Peruani, Aurghya Maiti, Sanjib Sadhu, Hugues Chaté
Modeling broadcasting using omnidirectional and directional antenna in delay tolerant networks as an epidemic dynamics. IEEE J. Sel. Areas Commun. 28(4): 524-531 (2010) - [c2]Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami:
Cluster connecting problem inside a polygon. CCCG 2010: 265-268
2000 – 2009
- 2006
- [c1]Subrata Nandi, Sanjib Sadhu:
A Predictive Location Management Scheme by Extracting the Unique Sub-patterns from the Mobility Logs. ICDCN 2006: 600-605
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: