| A study of rumor control strategies on social networks RM Tripathy, A Bagchi, S Mehta Proceedings of the 19th ACM international conference on Information and …, 2010 | 182 | 2010 |
| Spatio-temporal and events based analysis of topic popularity in twitter S Ardon, A Bagchi, A Mahanti, A Ruhela, A Seth, RM Tripathy, S Triukose Proceedings of the 22nd ACM international conference on Information …, 2013 | 84 | 2013 |
| Fluid modeling of pollution proliferation in p2p networks R Kumar, DD Yao, A Bagchi, KW Ross, D Rubenstein ACM SIGMETRICS Performance Evaluation Review 34 (1), 335-346, 2006 | 74 | 2006 |
| Deterministic sampling and range counting in geometric data streams A Bagchi, A Chaudhary, D Eppstein, MT Goodrich ACM Transactions on Algorithms (TALG) 3 (2), 16-es, 2007 | 73 | 2007 |
| Towards combating rumors in social networks: Models and metrics RM Tripathy, A Bagchi, S Mehta Intelligent Data Analysis 17 (1), 149-175, 2013 | 66 | 2013 |
| Three approaches to heuristic search in networks A Bagchi, A Mahanti Journal of the ACM (JACM) 32 (1), 1-27, 1985 | 63 | 1985 |
| Biased skip lists A Bagchi, AL Buchsbaum, MT Goodrich Algorithmica 42, 31-48, 2005 | 53 | 2005 |
| The effect of faults on network expansion A Bagchi, A Bhargava, A Chaudhary, D Eppstein, C Scheideler Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004 | 50 | 2004 |
| Admissible heuristic search in AND/OR graphs A Bagchi, A Mahanti Theoretical Computer Science 24 (2), 207-219, 1983 | 50 | 1983 |
| Beyond shortest paths: Route recommendations for ride-sharing CF Yuen, AP Singh, S Goyal, S Ranu, A Bagchi The World Wide Web Conference, 2258-2269, 2019 | 45 | 2019 |
| Spatio-temporal analysis of topic popularity in twitter S Ardon, A Bagchi, A Mahanti, A Ruhela, A Seth, RM Tripathy, S Triukose arXiv preprint arXiv:1111.2904, 2011 | 36 | 2011 |
| Efficiently answering regular simple path queries on large labeled networks S Wadhwa, A Prasad, S Ranu, A Bagchi, S Bedathur Proceedings of the 2019 international conference on management of data, 1463 …, 2019 | 35 | 2019 |
| Arrow: Approximating reachability using random walks over web-scale graphs N Sengupta, A Bagchi, M Ramanath, S Bedathur 2019 IEEE 35th International Conference on Data Engineering (ICDE), 470-481, 2019 | 29 | 2019 |
| Constructing disjoint paths for secure communication A Bagchi, A Chaudhary, MT Goodrich, S Xu Distributed Computing: 17th International Conference, DISC 2003, Sorrento …, 2003 | 26 | 2003 |
| Batching and matching for food delivery in dynamic road networks M Joshi, A Singh, S Ranu, A Bagchi, P Karia, P Kala 2021 IEEE 37th international conference on data engineering (ICDE), 2099-2104, 2021 | 24 | 2021 |
| Short length Menger's theorem and reliable optical routing A Bagchi, A Chaudhary, P Kolman Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003 | 24 | 2003 |
| Algorithms for fault-tolerant routing in circuit switched networks A Bagchi, A Chaudhary, C Scheideler, P Kolman Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002 | 21 | 2002 |
| Towards characterization of actor evolution and interactions in news corpora R Choudhary, S Mehta, A Bagchi, R Balakrishnan Advances in Information Retrieval: 30th European Conference on IR Research …, 2008 | 20 | 2008 |
| Seller-focused algorithms for online auctioning A Bagchi, A Chaudhary, R Garg, MT Goodrich, V Kumar Algorithms and Data Structures: 7th International Workshop, WADS 2001 …, 2001 | 20 | 2001 |
| A simple combinatorial proof of duality of multiroute flows and cuts A Bagchi, A Chaudhary, P Kolman, J Sgall Charles Univ., 2004 | 16 | 2004 |
