Binay K. Bhattacharya

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Subhas C. Nandy

> Home > Persons > Binay K. Bhattacharya

Publications

2020
[j50]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/BhattacharyaDNR20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BhattacharyaDNR20
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Constant work-space algorithms for facility location problems. Discret. Appl. Math. 283: 456-472 (2020)
2017
[j46]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/BhattacharyaDMN17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BhattacharyaDMN17
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228: 80-87 (2017)
2016
[j43]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BhattacharyaNR16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BhattacharyaNR16
Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-efficient algorithm for computing a centerpoint of a set of points in R². Theor. Comput. Sci. 615: 61-70 (2016)
2015
[c60]
- view
  authority control:
- export record
  dblp key:
  - conf/caldam/BhattacharyaDMNR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/caldam/BhattacharyaDMNR15
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80
2014
[c57]
- view
  - electronic edition @ cccg.ca (open access)
  - details & citations
- export record
  dblp key:
  - conf/cccg/BhattacharyaDNR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/BhattacharyaDNR14
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG 2014
[c56]
- view
  - electronic edition @ cccg.ca (open access)
  - details & citations
- export record
  dblp key:
  - conf/cccg/BhattacharyaNR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/BhattacharyaNR14
Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. CCCG 2014
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/BhattacharyaDNR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BhattacharyaDNR14
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Facility location problems in the constant work-space read-only memory model. CoRR abs/1409.4092 (2014)
2013
[j37]
- view
  authority control:
- export record
  dblp key:
  - journals/jco/KarmakarDNB13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/KarmakarDNB13
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]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoa/KarmakarDNB10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/KarmakarDNB10
Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368

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.