Остановите войну!
for scientists:
default search action
Binay K. Bhattacharya
- > Home > Persons > Binay K. Bhattacharya
Publications
- 2023
- [i12]Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. CoRR abs/2303.17204 (2023) - 2022
- [j53]Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
The weighted k-center problem in trees for fixed k. Theor. Comput. Sci. 906: 64-75 (2022) - 2021
- [j52]Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of spatial skyline points. Comput. Geom. 93: 101698 (2021) - 2020
- [j51]Binay Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-time fitting of a k-step function. Discret. Appl. Math. 280: 43-52 (2020) - 2019
- [c68]Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
The Weighted k-Center Problem in Trees for Fixed k. ISAAC 2019: 27:1-27:11 - 2018
- [j47]Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song:
Optimizing squares covering a set of points. Theor. Comput. Sci. 729: 68-83 (2018) - 2017
- [j45]Sandip Banerjee, Bhargab B. Bhattacharya, Binay Bhattacharya, Arindam Biswas, Sandip Das, Ritankar Mandal, Sasanka Roy:
On representing a simple polygon perceivable to a blind person. Inf. Process. Lett. 120: 1-5 (2017) - 2016
- [c62]Binay Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-Time Fitting of a k-Step Function. CALDAM 2016: 85-96 - [c61]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The p-Center Problem in Tree Networks Revisited. SWAT 2016: 6:1-6:15 - [i7]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The $p$-Center Problem in Tree Networks Revisited. CoRR abs/1604.07535 (2016) - 2015
- [c58]Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG 2015: 24-36 - [i4]Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR abs/1512.07533 (2015) - [i3]Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-Time Fitting of a $k$-Step Function. CoRR abs/1512.07537 (2015) - 2014
- [c55]Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song:
Optimizing Squares Covering a Set of Points. COCOA 2014: 37-52 - 2013
- [j37]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2): 176-190 (2013) - 2010
- [c46]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368 - [c44]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM 2010: 82-93 - 2009
- [j34]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Single facility collection depots location problem in the plane. Comput. Geom. 42(5): 403-418 (2009) - [i1]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
On Finding Non-dominated Points using Compact Voronoi Diagrams. CoRR abs/0909.0814 (2009) - 2007
- [c36]Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi:
Computing a planar widest empty alpha-siphon in o(n3) time. CCCG 2007: 33-36 - 2005
- [c29]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Collection depot location problem in the plane. CCCG 2005: 76-79
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-02-06 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint