default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBhaswar B. Bhattacharya
Publications
- 2025
[c12]Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Almost Empty Monochromatic Polygons in Planar Point Sets. CALDAM 2025: 50-59- 2024
- [c11]Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Growth Rate of the Number of Empty Triangles in the Plane. CALDAM 2024: 77-87 - [i9]Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Growth Rate of the Number of Empty Triangles in the Plane. CoRR abs/2402.07775 (2024) - 2019
- [j16]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
The 1-dimensional discrete Voronoi game. Oper. Res. Lett. 47(2): 115-121 (2019) - 2017
- [j13]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee:
The discrete Voronoi game in R2. Comput. Geom. 63: 53-62 (2017) - 2016
- [j12]Deepan Basu, Kinjal Basu, Bhaswar B. Bhattacharya, Sandip Das:
Almost empty monochromatic triangles in planar point sets. Discret. Appl. Math. 210: 207-213 (2016) - 2014
- [j9]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum enclosing circle of a set of fixed points and a mobile point. Comput. Geom. 47(9): 891-898 (2014) - 2013
- [j8]Bhaswar B. Bhattacharya, Sandip Das:
On pseudo-convex partitions of a planar point set. Discret. Math. 313(21): 2401-2408 (2013) - [j7]Deepan Basu, Bhaswar B. Bhattacharya, Sandip Das:
Almost Empty Monochromatic Triangles in Planar Point Sets. Electron. Notes Discret. Math. 44: 53-59 (2013) - [j5]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Optimal strategies for the one-round discrete Voronoi game on a line. J. Comb. Optim. 26(4): 655-669 (2013) - [j4]Bhaswar B. Bhattacharya, Sandip Das:
Disjoint empty convex pentagons in planar point sets. Period. Math. Hung. 66(1): 73-86 (2013) - [c6]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
Two-Round Discrete Voronoi Game along a Line. FAW-AAIM 2013: 210-220 - [c5]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee:
One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities. CCCG 2013 - 2011
- [c4]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. COCOON 2011: 213-224 - [c3]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. WALCOM 2011: 98-109 - 2010
- [i1]Bhaswar B. Bhattacharya, Sandip Das:
Holes or Empty Pseudo-Triangles in Planar Point Sets. CoRR abs/1011.0517 (2010)
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 2025-02-26 20:45 CET 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:
