| 2010 |
|---|
| 19 | A study of rumor control strategies on social networks. Rudra M. Tripathy, Amitabha Bagchi, Sameep Mehta. CIKM 2010, 1817-1820. Web SearchBibTeXDownload |
| 2008 |
|---|
| 18 | On quantifying changes in temporally evolving dataset. Rohan Choudhary, Sameep Mehta, Amitabha Bagchi. CIKM 2008, 1459-1460. Web SearchBibTeXDownload |
| 17 | Towards Characterization of Actor Evolution and Interactions in News Corpora. Rohan Choudhary, Sameep Mehta, Amitabha Bagchi, Rahul Balakrishnan. ECIR 2008, 422-429. Web SearchBibTeXDownload |
| 2007 |
|---|
| 16 | Deterministic sampling and range counting in geometric data streams. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload |
| 15 | Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman. SIAM J. Discrete Math. (21): 141-157 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 14 | Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information. Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Chen Li, Michal Shmueli-Scheuer. IEEE Trans. Knowl. Data Eng. (18): 1352-1367 (2006). Web SearchBibTeXDownload |
| 13 | Approximate maximum weight branchings. Amitabha Bagchi, Ankur Bhargava, Torsten Suel. Inf. Process. Lett. (99): 54-58 (2006). Web SearchBibTeXDownload |
| 12 | The Effect of Faults on Network Expansion. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler. Theory Comput. Syst. (39): 903-928 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 11 | Biased Skip Lists. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich. Algorithmica (42): 31-48 (2005). Web SearchBibTeXDownload |
| 10 | Short length Menger's theorem and reliable optical routing. Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman. Theor. Comput. Sci. (339): 315-332 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 9 | The Effect of Faults on Network Expansion. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler. CoRR (cs.DC/0404029) (2004). Web SearchBibTeXDownload |
| 8 | The effect of faults on network expansion. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler. SPAA 2004, 286-293. Web SearchBibTeXDownload |
| 7 | Deterministic sampling and range counting in geometric data streams. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich. Symposium on Computational Geometry 2004, 144-151. Web SearchBibTeXDownload |
| 2003 |
|---|
| 6 | Deterministic Sampling and Range Counting in Geometric Data Streams. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich. CoRR (cs.CG/0307027) (2003). Web SearchBibTeXDownload |
| 5 | Constructing Disjoint Paths for Secure Communication. Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu. DISC 2003, 181-195. Web SearchBibTeXDownload |
| 4 | Short length menger's theorem and reliable optical routing. Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman. SPAA 2003, 246-247. Web SearchBibTeXDownload |
| 2002 |
|---|
| 3 | Biased Skip Lists. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich. ISAAC 2002, 1-13. Web SearchBibTeXDownload |
| 2 | Algorithms for fault-tolerant routing in circuit switched networks. Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman. SPAA 2002, 265-274. Web SearchBibTeXDownload |
| 2001 |
|---|
| 1 | Seller-Focused Algorithms for Online Auctioning. Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar. WADS 2001, 135-147. Cited by 15Web SearchBibTeXDownload |
