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

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

#	Work	Indexed citations
1	Linear-time fitting of a k-step function 2017 ·Discrete Applied Mathematics ·Binay Bhattacharya, Sandip Das, Tsunehiko Kameda	2
2	Improved algorithms for computing minmax regret sinks on dynamic path and tree networks 2015 ·Theoretical Computer Science ·Binay Bhattacharya, Tsunehiko Kameda	7
3	Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. 2014 ·Canadian Conference on Computational Geometry ·Binay Bhattacharya, (unknown), Subhas C. Nandy, Sasanka Roy	0
4	Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks 2014 ·Discrete Applied Mathematics ·Binay Bhattacharya, Tsunehiko Kameda, Zhao Song	6
5	Improved algorithms to network p -center location problems 2013 ·Computational Geometry ·Binay Bhattacharya, (unknown)	4
6	Efficient algorithms for the conditional covering problem 2012 ·Information and Computation ·(unknown), Binay Bhattacharya, (unknown), Chien‐Hsin Lin, (unknown), Biing-Feng Wang	1
7	Optimal movement of mobile sensors for barrier coverage of a planar region 2009 ·Theoretical Computer Science ·Binay Bhattacharya, Mike Burmester, (unknown), Evangelos Kranakis, (unknown), Andreas Wiese	56
8	Application of computational geometry to network p-center location problems 2008 ·Canadian Conference on Computational Geometry ·(unknown), Binay Bhattacharya	1
9	Computing a planar widest empty -siphon in o(n 3 ) time 2007 ·Canadian Conference on Computational Geometry ·Boaz Ben‐Moshe, Binay Bhattacharya, Sandip Das, Daya Ram Gaur, (unknown)	1
10	Efficient Snap Rounding with Integer Arithmetic. 2007 ·Canadian Conference on Computational Geometry ·Binay Bhattacharya, (unknown)	1
11	Faster Algorithms for k-Medians in Trees (Extended Abstract) 2007 ·(unknown), Binay Bhattacharya, Marek Chrobák, Lawrence L. Larmore, Wojciech Rytter	1
12	Efficient algorithms for center problems in cactus networks 2007 ·Theoretical Computer Science ·Boaz Ben‐Moshe, Binay Bhattacharya, (unknown), Arie Tamir	21
13	Computing the Widest Empty Boomerang. 2005 ·Canadian Conference on Computational Geometry ·Boaz Ben‐Moshe, Binay Bhattacharya, (unknown)	1
14	Optimally computing a shortest weakly visible line segment inside a simple polygon 2002 ·Computational Geometry ·Binay Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan	1
15	Biased search and k-point clustering. 1997 ·Canadian Conference on Computational Geometry ·Binay Bhattacharya	2
16	Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. 1993 ·Canadian Conference on Computational Geometry ·(unknown), (unknown), Binay Bhattacharya	4
17	Efficient reconstruction of binary trees from their traversals 1989 ·Applied Mathematics Letters ·(unknown), Binay Bhattacharya, Ed Merks	1
18	Planning Viewpoints And The Navigation Route Of A Patrol Robot In A Known 2-D Environment 1987 ·Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE ·(unknown), Thomas W. Calvert, Binay Bhattacharya	2
19	On the multimodality of distances in convex polygons 1982 ·Computers & Mathematics with Applications ·David Avis, Godfried T. Toussaint, Binay Bhattacharya	17
20	A Counterexample to a Diameter Algorithm for Convex Polygons 1982 ·IEEE Transactions on Pattern Analysis and Machine Intelligence ·Binay Bhattacharya, (unknown)	8

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