Binay Bhattacharya

1.5k total citations
69 papers, 592 citations indexed

About

Binay Bhattacharya is a scholar working on Computer Graphics and Computer-Aided Design, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Binay Bhattacharya has authored 69 papers receiving a total of 592 indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Computer Graphics and Computer-Aided Design, 20 papers in Computer Networks and Communications and 19 papers in Computer Vision and Pattern Recognition. Recurrent topics in Binay Bhattacharya's work include Computational Geometry and Mesh Generation (45 papers), Optimization and Search Problems (18 papers) and Facility Location and Emergency Management (17 papers). Binay Bhattacharya is often cited by papers focused on Computational Geometry and Mesh Generation (45 papers), Optimization and Search Problems (18 papers) and Facility Location and Emergency Management (17 papers). Binay Bhattacharya collaborates with scholars based in Canada, India and United States. Binay Bhattacharya's co-authors include Godfried T. Toussaint, Tetsuo Asano, Fei Yao, David Kirkpatrick, Michael Segal, Sergei Bespamyatnikh, Evangelos Kranakis, David Avis, Tsunehiko Kameda and Arie Tamir and has published in prestigious journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, Pattern Recognition Letters and Computers & Mathematics with Applications.

In The Last Decade

Binay Bhattacharya

64 papers receiving 563 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Binay Bhattacharya Canada	14	240	181	149	105	103	69	592
Subhas C. Nandy India	11	183 0.8×	101 0.6×	100 0.7×	30 0.3×	96 0.9×	79	411
Hartmut Noltemeier Germany	11	89 0.4×	116 0.6×	69 0.5×	59 0.6×	60 0.6×	39	468
Daniel Greene United States	9	177 0.7×	155 0.9×	172 1.2×	30 0.3×	102 1.0×	18	720
Sergio Cabello Slovenia	18	359 1.5×	116 0.6×	197 1.3×	25 0.2×	172 1.7×	75	762
Adrian Dumitrescu United States	15	401 1.7×	237 1.3×	238 1.6×	12 0.1×	62 0.6×	117	804
Ferrán Hurtado Spain	15	588 2.5×	102 0.6×	229 1.5×	15 0.1×	155 1.5×	123	815
Ruei‐Chuan Chang Taiwan	12	127 0.5×	543 3.0×	83 0.6×	21 0.2×	53 0.5×	65	738
Chris Harrelson United States	6	62 0.3×	271 1.5×	164 1.1×	23 0.2×	286 2.8×	8	655
Christian Icking Germany	14	192 0.8×	200 1.1×	203 1.4×	10 0.1×	59 0.6×	46	501
Olivier Goldschmidt United States	12	74 0.3×	204 1.1×	47 0.3×	14 0.1×	17 0.2×	24	535

Countries citing papers authored by Binay Bhattacharya

Since Specialization

Citations

This map shows the geographic impact of Binay Bhattacharya's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Binay Bhattacharya with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Binay Bhattacharya more than expected).

Fields of papers citing papers by Binay Bhattacharya

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Binay Bhattacharya. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Binay Bhattacharya. The network helps show where Binay Bhattacharya may publish in the future.

Co-authorship network of co-authors of Binay Bhattacharya

This figure shows the co-authorship network connecting the top 25 collaborators of Binay Bhattacharya. A scholar is included among the top collaborators of Binay Bhattacharya based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Binay Bhattacharya. Binay Bhattacharya is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bhattacharya, Binay, Sandip Das, & Tsunehiko Kameda. (2017). Linear-time fitting of a k-step function. Discrete Applied Mathematics. 280. 43–52. 2 indexed citations

Bhattacharya, Binay & Tsunehiko Kameda. (2015). Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. Theoretical Computer Science. 607. 411–425. 7 indexed citations

Bhattacharya, Binay, et al.. (2014). Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.. Canadian Conference on Computational Geometry.

Bhattacharya, Binay, Tsunehiko Kameda, & Zhao Song. (2014). Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Discrete Applied Mathematics. 195. 18–30. 6 indexed citations

Bhattacharya, Binay, et al.. (2013). Improved algorithms to network p -center location problems. Computational Geometry. 47(2). 307–315. 4 indexed citations

Bhattacharya, Binay, et al.. (2012). Efficient algorithms for the conditional covering problem. Information and Computation. 219. 39–57. 1 indexed citations

Bhattacharya, Binay, et al.. (2009). Optimal movement of mobile sensors for barrier coverage of a planar region. Theoretical Computer Science. 410(52). 5515–5528. 56 indexed citations

Bhattacharya, Binay, et al.. (2008). Application of computational geometry to network p-center location problems. Canadian Conference on Computational Geometry. 1 indexed citations

Ben‐Moshe, Boaz, et al.. (2007). Computing a planar widest empty -siphon in o(n 3 ) time. Canadian Conference on Computational Geometry. 33–36. 1 indexed citations

10.

Bhattacharya, Binay, et al.. (2007). Efficient Snap Rounding with Integer Arithmetic.. Canadian Conference on Computational Geometry. 145–148. 1 indexed citations

11.

Bhattacharya, Binay, et al.. (2007). Faster Algorithms for k-Medians in Trees (Extended Abstract). 1 indexed citations

12.

Ben‐Moshe, Boaz, et al.. (2007). Efficient algorithms for center problems in cactus networks. Theoretical Computer Science. 378(3). 237–252. 21 indexed citations

13.

Ben‐Moshe, Boaz, et al.. (2005). Computing the Widest Empty Boomerang.. Canadian Conference on Computational Geometry. 80–83. 1 indexed citations

14.

Bhattacharya, Binay, Gautam Das, Asish Mukhopadhyay, & Giri Narasimhan. (2002). Optimally computing a shortest weakly visible line segment inside a simple polygon. Computational Geometry. 23(1). 1–29. 1 indexed citations

15.

Bhattacharya, Binay. (1997). Biased search and k-point clustering.. Canadian Conference on Computational Geometry. 2 indexed citations

16.

Bhattacharya, Binay, et al.. (1993). Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments.. Canadian Conference on Computational Geometry. 169–174. 4 indexed citations

17.

Bhattacharya, Binay, et al.. (1989). Efficient reconstruction of binary trees from their traversals. Applied Mathematics Letters. 2(1). 79–82. 1 indexed citations

18.

Calvert, Thomas W., et al.. (1987). Planning Viewpoints And The Navigation Route Of A Patrol Robot In A Known 2-D Environment. Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE. 727. 206–206. 2 indexed citations

19.

Avis, David, Godfried T. Toussaint, & Binay Bhattacharya. (1982). On the multimodality of distances in convex polygons. Computers & Mathematics with Applications. 8(2). 153–156. 17 indexed citations

20.

Bhattacharya, Binay, et al.. (1982). A Counterexample to a Diameter Algorithm for Convex Polygons. IEEE Transactions on Pattern Analysis and Machine Intelligence. PAMI-4(3). 306–309. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact