Amitabha Bagchi

904 total citations
57 papers, 526 citations indexed

About

Amitabha Bagchi is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Amitabha Bagchi has authored 57 papers receiving a total of 526 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computer Networks and Communications, 15 papers in Computational Theory and Mathematics and 12 papers in Artificial Intelligence. Recurrent topics in Amitabha Bagchi's work include Complex Network Analysis Techniques (11 papers), Complexity and Algorithms in Graphs (10 papers) and Caching and Content Delivery (9 papers). Amitabha Bagchi is often cited by papers focused on Complex Network Analysis Techniques (11 papers), Complexity and Algorithms in Graphs (10 papers) and Caching and Content Delivery (9 papers). Amitabha Bagchi collaborates with scholars based in India, United States and Czechia. Amitabha Bagchi's co-authors include Sameep Mehta, Srikanta Bedathur, Sayan Ranu, Amitabh Chaudhary, Dan Rubenstein, Rakesh Kumar, David D. Yao, Keith W. Ross, Aaditeshwar Seth and Michael T. Goodrich and has published in prestigious journals such as IEEE Communications Letters, Proceedings of the VLDB Endowment and Theoretical Computer Science.

In The Last Decade

Amitabha Bagchi

52 papers receiving 505 citations

Peers

Amitabha Bagchi
Guangmo Tong United States
Zaixin Lu United States
Mi-Yen Yeh Taiwan
William Hendrix United States
Alessandro Epasto United States
Yi Fang United States
Guangmo Tong United States
Amitabha Bagchi
Citations per year, relative to Amitabha Bagchi Amitabha Bagchi (= 1×) peers Guangmo Tong

Countries citing papers authored by Amitabha Bagchi

Since Specialization
Citations

This map shows the geographic impact of Amitabha Bagchi'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 Amitabha Bagchi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amitabha Bagchi more than expected).

Fields of papers citing papers by Amitabha Bagchi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Amitabha Bagchi. 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 Amitabha Bagchi. The network helps show where Amitabha Bagchi may publish in the future.

Co-authorship network of co-authors of Amitabha Bagchi

This figure shows the co-authorship network connecting the top 25 collaborators of Amitabha Bagchi. A scholar is included among the top collaborators of Amitabha Bagchi 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 Amitabha Bagchi. Amitabha Bagchi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bagchi, Amitabha, et al.. (2024). A Lovász-Simonovits Theorem for Hypergraphs with Application to Local Clustering. Proceedings of the ACM on Management of Data. 2(4). 1–27.
2.
Bagchi, Amitabha, et al.. (2023). Algorithms and Discrete Applied Mathematics. Lecture notes in computer science. 1 indexed citations
3.
Malik, Tanu, et al.. (2022). CHEX. Proceedings of the VLDB Endowment. 15(6). 1297–1310. 5 indexed citations
4.
Yadav, Rahul, et al.. (2022). Gigs with Guarantees: Achieving Fair Wage for Food Delivery Workers. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. 5122–5128. 2 indexed citations
5.
Bagchi, Amitabha, et al.. (2021). Fast One-class Classification using Class Boundary-preserving Random Projections. 66–74. 2 indexed citations
6.
Bagchi, Amitabha, et al.. (2021). A Queueing Network-Based Distributed Laplacian Solver. Algorithmica. 83(9). 2859–2894.
7.
Bagchi, Amitabha, et al.. (2020). A queueing network-based distributed Laplacian solver for directed graphs. Information Processing Letters. 166. 106040–106040. 2 indexed citations
8.
Bagchi, Amitabha, et al.. (2020). A Group-to-Group Version of Random Walk Betweenness Centrality. 127–135. 2 indexed citations
9.
Bagchi, Amitabha, et al.. (2019). ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs. 470–481. 16 indexed citations
10.
Bagchi, Amitabha, et al.. (2015). Hierarchical Neighbor Graphs: A Topology Control Mechanism for Data Collection in Heterogeneous Wireless Sensor Networks.. Ad Hoc & Sensor Wireless Networks. 26. 171–191. 4 indexed citations
11.
Bagchi, Amitabha, et al.. (2015). Joint scheduling and routing using space–time graphs for TDM wireless mesh networks. Wireless Networks. 22(7). 2355–2367. 2 indexed citations
12.
Bagchi, Amitabha, et al.. (2015). Tracking the conductance of rapidly evolving topic-subgraphs. Proceedings of the VLDB Endowment. 8(13). 2170–2181. 12 indexed citations
13.
Dogdas, Belma, Sameep Mehta, Kathleen Haskell, et al.. (2012). Quantification of Cy-5 siRNA signal in the intra-vital multi-photon microscopy images. PubMed. 2012. 3712–3715. 4 indexed citations
14.
Prakriya, Shankar, et al.. (2012). Dynamic Programming Based Multi-User Resource Allocation for Partial Crosstalk Cancellation in VDSL. IEEE Communications Letters. 16(3). 420–423. 3 indexed citations
15.
Mehta, Sameep, et al.. (2008). On quantifying changes in temporally evolving dataset. 1459–1460. 3 indexed citations
16.
Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, & Petr Kolman. (2007). Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks. SIAM Journal on Discrete Mathematics. 21(1). 141–157. 6 indexed citations
17.
Bagchi, Amitabha, et al.. (2006). Achieving communication efficiency through push-pull partitioning of semantic spaces in client-server architectures. 1 indexed citations
18.
Bagchi, Amitabha, et al.. (2006). The Effect of Faults on Network Expansion. Theory of Computing Systems. 39(6). 903–928. 14 indexed citations
19.
Bagchi, Amitabha, et al.. (2004). The effect of faults on network expansion. 286–293. 2 indexed citations
20.
Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, & Petr Kolman. (2002). Algorithms for fault-tolerant routing in circuit switched networks. 265–274. 6 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

Rankless by CCL
2026