E-LIB Suche - Ergebnisse für: Bhattacharya, Binay K.

1

Constant work-space algorithms for facility location proble..:

Bhattacharya, Binay K. ; De, Minati ; Nandy, Subhas C..
Discrete Applied Mathematics. 283 (2020) - p. 456-472 , 2020

Link: https://doi.org/10.1016/..

2

Rectilinear path problems in restricted memory setup:

Bhattacharya, Binay K. ; De, Minati ; Maheshwari, Anil..
Discrete Applied Mathematics. 228 (2017) - p. 80-87 , 2017

Link: https://doi.org/10.1016/..

3

Space-efficient algorithm for computing a centerpoint of a ..:

Bhattacharya, Binay K. ; Nandy, Subhas C. ; Roy, Sasanka
Theoretical Computer Science. 615 (2016) - p. 61-70 , 2016

Link: https://doi.org/10.1016/..

4

Some variations on constrained minimum enclosing circle pro..:

Karmakar, Arindam ; Das, Sandip ; Nandy, Subhas C..
Journal of Combinatorial Optimization. 25 (2012) 2 - p. 176-190 , 2012

Link: https://doi.org/10.1007/..

5

Single facility collection depots location problem in the p..:

Benkoczi, Robert ; Bhattacharya, Binay K. ; Das, Sandip.
Computational Geometry. 42 (2009) 5 - p. 403-418 , 2009

Link: https://doi.org/10.1016/..

6

Efficient computation of 2-medians in a tree network with p..:

Benkoczi, Robert R. ; Bhattacharya, Binay K. ; Breton, David
Electronic Notes in Discrete Mathematics. 15 (2003) - p. 39-42 , 2003

Link: https://doi.org/10.1016/..

7

Optimally computing a shortest weakly visible line segment ..:

Bhattacharya, Binay K. ; Das, Gautam ; Mukhopadhyay, Asish.
Computational Geometry. 23 (2002) 1 - p. 1-29 , 2002

Link: https://doi.org/10.1016/..

8

Characterizing LR-visibility polygons and related problems☆..:

Bhattacharya, Binay K. ; Ghosh, Subir Kumar
Computational Geometry. 18 (2001) 1 - p. 19-36 , 2001

Link: https://doi.org/10.1016/..

9

AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Ci..:

Bhattacharya, Binay K. ; Kaller, Damon
Journal of Algorithms. 25 (1997) 2 - p. 336-358 , 1997

Link: https://doi.org/10.1006/..

10

COMPUTING MAXIMUM CLIQUES OF CIRCULAR ARCS IN PARALLEL*:

AKL, SELIM G. ; BHATTACHARYA, BINAY K.
Parallel Algorithms and Applications. 12 (1997) 4 - p. 305-320 , 1997

Link: https://doi.org/10.1080/..

11

On a Simple, Practical, Optimal, Output-Sensitive Randomize..:

Bhattacharya, Binay K ; Sen, Sandeep
Journal of Algorithms. 25 (1997) 1 - p. 177-193 , 1997

Link: https://doi.org/10.1006/..

12

An optimal algorithm to translate a convex polyhedron throu..:

Bhattacharya, Binay K
CVGIP: Graphical Models and Image Processing. 53 (1991) 3 - p. 269-270 , 1991

Link: https://doi.org/10.1016/..

13

Optimal algorithms for some smallest intersection radius pr..:

, In: Proceedings of the seventh annual symposium on Computational geometry,

Bhattacharya, Binay K. ; Jadhav, Sreesh ; Mukhopadhayay, Asish. - p. 81-88 , 1991

Link: https://dl.acm.org/doi/1..

14

Computing the volume of the union of spheres:

Avis, David ; Bhattacharya, Binay K. ; Imai, Hiroshi
The Visual Computer. 3 (1988) 6 - p. 323-328 , 1988

Link: https://doi.org/10.1007/..

15

Fast algorithms for computing the diameter of a finite plan..:

Bhattacharya, Binay K. ; Toussaint, Godfried T.
The Visual Computer. 3 (1988) 6 - p. 379-388 , 1988

Link: https://doi.org/10.1007/..