Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBinay K. Bhattacharya
- > Home > Persons > Binay K. Bhattacharya
Publications
- 2022
[c71]Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari:
A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic. CCCG 2022: 40-47- 2021
- [c69]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama:
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS 2021: 13:1-13:19 - 2020
- [j51]Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
:
Linear-time fitting of a k-step function. Discret. Appl. Math. 280: 43-52 (2020) - [j48]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-sink problem on path networks. Theor. Comput. Sci. 806: 388-401 (2020) - 2019
- [c67]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax-Regret Evacuation Planning for Cycle Networks. TAMC 2019: 42-58 - 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) - [c66]Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. ISAAC 2018: 14:1-14:13 - [c65]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA 2018: 78-89 - [i10]Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. CoRR abs/1806.00814 (2018) - [i9]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Path Networks. CoRR abs/1810.10631 (2018) - 2017
- [c63]Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS 2017: 133-144 - 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) - [i6]Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR abs/1609.01373 (2016) - 2015
- [j42]Binay Bhattacharya, Tsunehiko Kameda, Zhao Song:
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Discret. Appl. Math. 195: 18-30 (2015) - [j41]Binay K. Bhattacharya, Tsunehiko Kameda:
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. Theor. Comput. Sci. 607: 411-425 (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
- [j40]Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. Algorithmica 70(1): 2-21 (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 - [c54]Binay K. Bhattacharya, Tsunehiko Kameda:
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. COCOA 2014: 146-160 - [c53]Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song:
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON 2014: 417-428 - [c52]Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. LATIN 2014: 330-341 - 2012
- [c50]Binay K. Bhattacharya, Tsunehiko Kameda:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. COCOON 2012: 1-12 - [c48]Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. ISAAC 2012: 588-597 - 2011
- [c47]Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi:
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. ICTAC 2011: 45-61 - 2009
- [c42]Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang:
Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. ICRA 2009: 2461-2466 - 2006
- [c32]Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda:
An Optimal Solution to Room Search Problem. CCCG 2006
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-07 04:10 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:
