- h-index
- 15
- Citations
- 913
- Publications
- 92
via OpenAlex
via OpenAlex
About
Amitabha Bagchi is a researcher at Merck & Co., Inc. in Rahway, NJ, USA. He has published 11 papers on topics such as network optimization and graph theory, with a focus on spatio-temporal analysis, connectivity, and clustering. His work spans over two decades, from 2006 to 2025.
Research areas
- Computer science
- Combinatorics
- Mathematics
- Graph
- Artificial intelligence
Publications (92)
Sorted by most cited.
- 149 cites
- 58 cites
- 54 cites
- 44 cites
- 36 cites
- 33 cites
- 33 cites
- 29 cites
- 27 cites
- 26 cites
- 18 cites
- 17 cites
- 16 cites
- 16 cites
- 14 cites
- 13 cites
- 12 cites
- 12 cites
- 10 cites
The rich and middle classes on Twitter: Are popular users indeed different from regular users?
Computer Communications2016journal article
View DOI - 10 cites
- 10 cites
- 9 cites
- 9 cites
- 9 cites
- 8 cites
- 8 cites
- 7 cites
Analysis and characterization of comparison shopping behavior in the mobile handset domain
2016
View DOI - 7 cites
- 7 cites
- 7 cites
- 6 cites
- 5 cites
- 5 cites
- 5 cites
- 5 cites
- 5 cites
- 4 cites
A stochastic process on a network with connections to Laplacian systems of equations
Advances in Applied Probability2022journal article
View DOI - 4 cites
- 4 cites
- 4 cites
Hierarchical Neighbor Graphs: A Topology Control Mechanism for Data Collection in Heterogeneous Wireless Sensor Networks.
2015
- 4 cites
- 4 cites
- 4 cites
Dynamic Programming Based Multi-User Resource Allocation for Partial Crosstalk Cancellation in VDSL
2012
View DOI - 4 cites
- 4 cites
- 4 cites
- 3 cites
- 3 cites
A queueing network-based distributed Laplacian solver for directed graphs
Information Processing Letters2021journal article
View DOI - 3 cites
- 3 cites
- 3 cites
- 3 cites
- 2 cites
A Lovász-Simonovits Theorem for Hypergraphs with Application to Local Clustering
Proceedings of the ACM on Management of Data2024journal article
View DOI - 2 cites
- 2 cites
- 2 cites
- 2 cites
Learning User Representations in Online Social Networks using Temporal Dynamics of Information Diffusion
2017
View DOI - 2 cites
Decentralized Random Walk-Based Data Collection in Networks.
2017
- 2 cites
- 2 cites
- 2 cites
Brief Announcement: Hierarchical Neighbor Graphs: A Sparse Connected Structure for Euclidean Point Sets
2010
View DOI - 2 cites
- 1 cites
- 1 cites
- 1 cites
A Distributed Laplacian Solver and its Applications to Electrical Flow and Random Spanning Tree Computation
2019
View DOI - 1 cites
Dynamic Partition Bloom Filters: A Bounded False Positive Solution For Dynamic Set Membership (Extended Abstract)
2019
View DOI - 1 cites
Connectivity of a Dense Mesh of Randomly Oriented Directional Antennas Under a Realistic Fading Model
2015
View DOI - 1 cites
- 1 cites
A computationally inexpensive and power efficient fully distributed topology for data collection in heterogeneous wireless sensor networks
2011
View DOI - 1 cites
- 1 cites
Achieving communication efficiency through push-pull partitioning of semantic spaces in client-server architectures
2006
- 1 cites
- 1 cites
- 0 cites
Attacks on Sparse LWE and Sparse LPN with new Sample-Time tradeoffs
2026
- 0 cites
- 0 cites
- 0 cites
- 0 cites
- 0 cites
- 0 cites
- 0 cites
- 0 cites
A user activity-based measurement study characterizing and classifying Stack Exchange communities across multiple domains
2017
View DOI - 0 cites
- 0 cites
- 0 cites
Hierarchical neighbor graphs: A low stretch connected structure for\n points in Euclidean space
2009
View DOI - 0 cites
- 0 cites
Lecture 1: Overview of percolation and foundational results from probability theory
2007
- 0 cites
Constructing Disjoint Paths for Secure Communication
2003
- 0 cites
Ecien t Strategies for Topics in Internet Algorithmics
2002
- 0 cites
- 0 cites