Binay Bhattacharyya
Binay Bhattacharyya
Unknown affiliation
Verified email at
Cited by
Cited by
Clustering algorithms based on minimum and maximum spanning trees
T Asano, B Bhattacharya, M Keil, F Yao
Proceedings of the fourth annual symposium on Computational Geometry, 252-257, 1988
Algorithms for computing d-dimensional Voronoi diagrams and their duals
D Avis, BK Bhattacharya
Advances in computing research 1, 159-180, 1983
Optimal movement of mobile sensors for barrier coverage of a planar region
B Bhattacharya, M Burmester, Y Hu, E Kranakis, Q Shi, A Wiese
Theoretical Computer Science 410 (52), 5515-5528, 2009
Application of proximity graphs to editing nearest neighbor decision rule
BK Bhattacharya, RS Poulsen, GT Toussaint
International Symposium on Information Theory, Santa Monica, 1981
Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications
R Ge, M Ester, BJ Gao, Z Hu, B Bhattacharya, B Ben-Moshe
ACM Transactions on Knowledge Discovery from Data (TKDD) 2 (2), 1-35, 2008
Mobile facility location
S Bespamyatnikh, B Bhattacharya, D Kirkpatrick, M Segal
Proceedings of the 4th International Workshop on Discrete Algorithms and …, 2000
Efficient algorithms for center problems in cactus networks
B Ben-Moshe, B Bhattacharya, Q Shi, A Tamir
Theoretical Computer Science 378 (3), 237-252, 2007
A new linear convex hull algorithm for simple polygons
BK Bhattacharya, H ElGindy
IEEE Transactions on Information Theory 30 (1), 85-88, 1984
Erupted maxillary conical mesiodens in deciduous dentition in a Bengali girl-A case report
D Ray, B Bhattacharya, S Sarkar, G Das
Journal of Indian Society of Pedodontics and Preventive Dentistry 23 (3 …, 2005
Computing the volume of the union of spheres
D Avis, BK Bhattacharya, H Imai
The Visual Computer 3, 323-328, 1988
On a simple, practical, optimal, output-sensitive randomized planar convex hull algorithm
BK Bhattacharya, S Sen
Journal of Algorithms 25 (1), 177-193, 1997
Optimal algorithms for computing the minimum distance between two finite planar sets
GT Toussaint, BK Bhattacharya
Pattern Recognition Letters 2 (2), 79-82, 1983
Efficient algorithms for centers and medians in interval and circular‐arc graphs
S Bespamyatnikh, B Bhattacharya, M Keil, D Kirkpatrick, M Segal
Networks: An International Journal 39 (3), 144-152, 2002
Planning views for the incremental construction of body models
S Xie, T Calvert, B Bhattacharya
Proceedings of the International Conference on Pattern Recognition, Paris …, 1986
On the multimodality of distances in convex polygons
D Avis, GT Toussaint, BK Bhattacharya
Computers & Mathematics with Applications 8 (2), 153-156, 1982
Efficient algorithms for computing the maximum distance between two finite planar sets
BK Bhattacharya, GT Toussaint
Journal of Algorithms 4 (2), 121-136, 1983
Efficient algorithms for the weighted 2-center problem in a cactus graph
B Ben-Moshe, B Bhattacharya, Q Shi
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya …, 2005
Optimal algorithms for two-guard walkability of simple polygons
B Bhattacharya, A Mukhopadhyay, G Narasimhan
Algorithms and Data Structures: 7th International Workshop, WADS 2001 …, 2001
Optimal movement of mobile sensors for barrier coverage of a planar region
B Bhattacharya, B Burmester, Y Hu, E Kranakis, Q Shi, A Wiese
Combinatorial Optimization and Applications: Second International Conference …, 2008
Application of computational geometry to pattern recognition problems
BK Bhattacharya
McGill University, 1981
The system can't perform the operation now. Try again later.
Articles 1–20