default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmitabha Bagchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j27]Raj Kamal
, Amitabha Bagchi:
A Lovász-Simonovits Theorem for Hypergraphs with Application to Local Clustering. Proc. ACM Manag. Data 2(4): 190:1-190:27 (2024)- [j26]Harsh Pandey, Amitabha Bagchi, Srikanta J. Bedathur, Arindam Bhattacharya:
Data-Dependent Generalization Bounds for Neural Networks with ReLU. Trans. Mach. Learn. Res. 2024 (2024) - [c43]Sumiaya Dabeer, Amitabha Bagchi, Rahul Narain:
GPU-LSolve: An Efficient GPU-Based Laplacian Solver for Million-Scale Graphs. IPDPS (Workshops) 2024: 890-899 - [i24]Anuj Kumar Sirohi, Anjali Gupta, Sayan Ranu, Sandeep Kumar, Amitabha Bagchi:
GRAPHGINI: Fostering Individual and Group Fairness in Graph Neural Networks. CoRR abs/2402.12937 (2024) - 2023
- [c42]Mahdihusain Momin, Raj Kamal, Shantwana Dixit, Sayan Ranu, Amitabha Bagchi:
KWIQ: Answering k-core Window Queries in Temporal Networks. EDBT 2023: 208-220 - [e2]Amitabha Bagchi, Rahul Muthu:
Algorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, Proceedings. Lecture Notes in Computer Science 13947, Springer 2023, ISBN 978-3-031-25210-5 [contents] - 2022
- [j25]Naga Nithin Manne, Shilvi Satpati, Tanu Malik, Amitabha Bagchi, Ashish Gehani, Amitabh Chaudhary:
CHEX: Multiversion Replay with Ordered Checkpoints. Proc. VLDB Endow. 15(6): 1297-1310 (2022) - [j24]Arindam Bhattacharya, Chathur Gudesa, Amitabha Bagchi, Srikanta Bedathur:
New Wine in an Old Bottle: Data-aware Hash Functions for Bloom Filters. Proc. VLDB Endow. 15(9): 1924-1936 (2022) - [j23]Manas Joshi, Arshdeep Singh, Sayan Ranu, Amitabha Bagchi, Priyank Karia, Puneet Kala:
FoodMatch: Batching and Matching for Food Delivery in Dynamic Road Networks. ACM Trans. Spatial Algorithms Syst. 8(1): 1-25 (2022) - [c41]Anjali Gupta, Rahul Yadav, Ashish Nair, Abhijnan Chakraborty, Sayan Ranu, Amitabha Bagchi:
FairFoody: Bringing In Fairness in Food Delivery. AAAI 2022: 11900-11907 - [c40]Ashish Nair, Rahul Yadav, Anjali Gupta, Abhijnan Chakraborty, Sayan Ranu, Amitabha Bagchi:
Gigs with Guarantees: Achieving Fair Wage for Food Delivery Workers. IJCAI 2022: 5122-5128 - [i23]Naga Nithin Manne, Shilvi Satpati, Tanu Malik, Amitabha Bagchi, Ashish Gehani, Amitabh Chaudhary:
CHEX: Multiversion Replay with Ordered Checkpoints. CoRR abs/2202.08429 (2022) - [i22]Anjali Gupta, Rahul Yadav, Ashish Nair, Abhijnan Chakraborty, Sayan Ranu, Amitabha Bagchi:
FairFoody: Bringing in Fairness in Food Delivery. CoRR abs/2203.08849 (2022) - [i21]Ashish Nair, Rahul Yadav, Anjali Gupta, Abhijnan Chakraborty, Sayan Ranu, Amitabha Bagchi:
Gigs with Guarantees: Achieving Fair Wage for Food Delivery Workers. CoRR abs/2205.03530 (2022) - 2021
- [j22]Iqra Altaf Gillani, Amitabha Bagchi:
A Queueing Network-Based Distributed Laplacian Solver. Algorithmica 83(9): 2859-2894 (2021) - [j21]Iqra Altaf Gillani, Pooja Vyavahare, Amitabha Bagchi:
Lower bounds for in-network computation of arbitrary functions. Distributed Comput. 34(3): 181-193 (2021) - [j20]Iqra Altaf Gillani, Amitabha Bagchi:
A queueing network-based distributed Laplacian solver for directed graphs. Inf. Process. Lett. 166: 106040 (2021) - [j19]Komal Chauhan, Kartik Jain, Sayan Ranu, Srikanta Bedathur, Amitabha Bagchi:
Answering Regular Path Queries through Exemplars. Proc. VLDB Endow. 15(2): 299-311 (2021) - [c39]Iqra Altaf Gillani, Amitabha Bagchi, Sayan Ranu:
A Group-to-Group Version of Random Walk Betweenness Centrality. COMAD/CODS 2021: 127-135 - [c38]Manas Joshi, Arshdeep Singh, Sayan Ranu, Amitabha Bagchi, Priyank Karia, Puneet Kala:
Batching and Matching for Food Delivery in Dynamic Road Networks. ICDE 2021: 2099-2104 - [c37]Arindam Bhattacharya, Sumanth Varambally, Amitabha Bagchi, Srikanta Bedathur:
Fast One-class Classification using Class Boundary-preserving Random Projections. KDD 2021: 66-74 - [c36]Kartik Sharma, Iqra Altaf Gillani, Sourav Medya, Sayan Ranu, Amitabha Bagchi:
Balance Maximization in Signed Networks via Edge Deletions. WSDM 2021: 752-760 - 2020
- [c35]Arindam Bhattacharya, Srikanta Bedathur, Amitabha Bagchi:
Adaptive Learned Bloom Filters under Incremental Workloads. COMAD/CODS 2020: 107-115 - [c34]Iqra Altaf Gillani, Amitabha Bagchi:
A Queueing Network-Based Distributed Laplacian Solver. SPAA 2020: 535-537 - [e1]Cristina Maria Pinotti, Alfredo Navarra, Amitabha Bagchi:
Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, September 9-10, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12503, Springer 2020, ISBN 978-3-030-62400-2 [contents] - [i20]Amitabha Bagchi:
Lecture notes: Efficient approximation of kernel functions. CoRR abs/2005.01566 (2020) - [i19]Manas Joshi, Arshdeep Singh, Sayan Ranu, Amitabha Bagchi, Priyank Karia, Puneet Kala:
Batching and Matching for Food Delivery in Dynamic Road Networks. CoRR abs/2008.12905 (2020) - [i18]Kartik Sharma, Iqra Altaf Gillani, Sourav Medya, Sayan Ranu, Amitabha Bagchi:
Balance Maximization in Signed Networks via Edge Deletions. CoRR abs/2010.10991 (2020) - [i17]Arindam Bhattacharya, Sumanth Varambally, Amitabha Bagchi, Srikanta Bedathur:
FROCC: Fast Random projection-based One-Class Classification. CoRR abs/2011.14317 (2020)
2010 – 2019
- 2019
- [c33]Neha Sengupta, Amitabha Bagchi, Maya Ramanath, Srikanta Bedathur:
ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs. ICDE 2019: 470-481 - [c32]Sarisht Wadhwa, Anagh Prasad, Sayan Ranu, Amitabha Bagchi, Srikanta Bedathur:
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks. SIGMOD Conference 2019: 1463-1480 - [c31]Chak Fai Yuen, Abhishek Pratap Singh, Sagar Goyal, Sayan Ranu, Amitabha Bagchi:
Beyond Shortest Paths: Route Recommendations for Ride-sharing. WWW 2019: 2258-2269 - [i16]Sidharth Negi, Ameya Dubey, Amitabha Bagchi, Manish Yadav, Nishant Yadav, Jeetu Raj:
Dynamic Partition Bloom Filters: A Bounded False Positive Solution For Dynamic Set Membership (Extended Abstract). CoRR abs/1901.06493 (2019) - [i15]Iqra Altaf Gillani, Amitabha Bagchi:
A Distributed Laplacian Solver and its Applications to Electrical Flow and Random Spanning Tree Computation. CoRR abs/1905.04989 (2019) - 2018
- [j18]Neha Sengupta, Amitabha Bagchi, Srikanta Bedathur, Maya Ramanath:
Sampling and Reconstruction Using Bloom Filters. IEEE Trans. Knowl. Data Eng. 30(7): 1324-1337 (2018) - [c30]Amitabha Bagchi, Federico Coro, Cristina M. Pinotti, Vlady Ravelomanana:
Border effects on connectivity for randomly oriented directional antenna networks. Med-Hoc-Net 2018: 1-8 - 2017
- [j17]Mona Gupta, Happy Mittal, Parag Singla, Amitabha Bagchi:
Analysis and characterization of comparison shopping behavior in the mobile handset domain. Electron. Commer. Res. 17(3): 521-551 (2017) - [c29]Akshit Trehan, Sumit Khurana, Amitabha Bagchi:
A user activity-based measurement study characterizing and classifying Stack Exchange communities across multiple domains. CODS 2017: 7:1-7:11 - [c28]Neha Sengupta, Amitabha Bagchi, Srikanta Bedathur, Maya Ramanath:
Sampling and Reconstruction Using Bloom Filters. ICDE 2017: 195-198 - [i14]Neha Sengupta, Amitabha Bagchi, Srikanta Bedathur, Maya Ramanath:
Sampling and Reconstruction Using Bloom Filters. CoRR abs/1701.03308 (2017) - [i13]Iqra Altaf Gillani, Amitabha Bagchi, Pooja Vyavahare, Tanmay Gupta:
Decentralized Random Walk-Based Data Collection in Networks. CoRR abs/1701.05296 (2017) - [i12]Iqra Altaf Gillani, Pooja Vyavahare, Amitabha Bagchi:
Random walk based in-network computation of arbitrary functions. CoRR abs/1702.03741 (2017) - [i11]Harvineet Singh, Amitabha Bagchi, Parag Singla:
Learning User Representations in Online Social Networks using Temporal Dynamics of Information Diffusion. CoRR abs/1710.07622 (2017) - 2016
- [j16]Amit Ruhela, Amitabha Bagchi, Anirban Mahanti, Aaditeshwar Seth:
The rich and middle classes on Twitter: Are popular users indeed different from regular users? Comput. Commun. 73: 219-228 (2016) - [j15]Salik Warsi, Vakul Jindal, Saket Kumar, Deepak Koli, Amitabha Bagchi, Vinay J. Ribeiro:
Joint scheduling and routing using space-time graphs for TDM wireless mesh networks. Wirel. Networks 22(7): 2355-2367 (2016) - 2015
- [j14]Amitabha Bagchi, Adit Madan, Achal Premi, Surabhi Sankhla:
Hierarchical Neighbor Graphs: A Topology Control Mechanism for Data Collection in Heterogeneous Wireless Sensor Networks. Ad Hoc Sens. Wirel. Networks 26(1-4): 171-191 (2015) - [j13]Sainyam Galhotra, Amitabha Bagchi, Srikanta Bedathur, Maya Ramanath, Vidit Jain:
Tracking the Conductance of Rapidly Evolving Topic-Subgraphs. Proc. VLDB Endow. 8(13): 2170-2181 (2015) - [j12]Siddharth Bora, Harvineet Singh, Anirban Sen, Amitabha Bagchi, Parag Singla:
On the role of conductance, geography and topology in predicting hashtag virality. Soc. Netw. Anal. Min. 5(1): 57:1-57:15 (2015) - [j11]Amitabha Bagchi, Sainyam Galhotra, Tarun Mangla, Cristina M. Pinotti:
Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks. ACM Trans. Sens. Networks 11(2): 36:1-36:37 (2015) - [c27]Amitabha Bagchi, Francesco Betti Sorbelli, Maria Cristina Pinotti, Vinay J. Ribeiro:
Connectivity of a Dense Mesh of Randomly Oriented Directional Antennas Under a Realistic Fading Model. ALGOSENSORS 2015: 13-26 - [i10]Siddharth Bora, Harvineet Singh, Anirban Sen, Amitabha Bagchi, Parag Singla:
On the Role of Conductance, Geography and Topology in Predicting Hashtag Virality. CoRR abs/1504.05351 (2015) - 2014
- [j10]Amitabha Bagchi, Rajshekar Kalayappan, Surabhi Sankhla:
Surveillance using non-stealthy sensors: A new intruder model. Secur. Commun. Networks 7(11): 1900-1911 (2014) - [c26]Rudra M. Tripathy, Shashank Sharma, Sachindra Joshi, Sameep Mehta, Amitabha Bagchi:
Theme Based Clustering of Tweets. CODS 2014: 1-5 - [c25]Mona Gupta, Happy Mittal, Parag Singla, Amitabha Bagchi:
Characterizing comparison shopping behavior: A case study. ICDE Workshops 2014: 115-122 - [i9]Amitabha Bagchi, Maria Cristina Pinotti, Sainyam Galhotra, Tarun Mangla:
Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks. CoRR abs/1408.5069 (2014) - 2013
- [j9]Rudra M. Tripathy, Amitabha Bagchi, Sameep Mehta:
Towards combating rumors in social networks: Models and metrics. Intell. Data Anal. 17(1): 149-175 (2013) - [c24]Amit Ruhela, Sipat Triukose, Sebastien Ardon, Amitabha Bagchi, Anirban Mahanti, Aaditeshwar Seth:
The scope for Online Social Network aided caching in web CDNs. ANCS 2013: 37-45 - [c23]Mona Jain, S. Rajyalakshmi, Rudra M. Tripathy, Amitabha Bagchi:
Temporal Analysis of User Behavior and Topic Evolution on Twitter. BDA 2013: 22-36 - [c22]Rudra M. Tripathy, Amitabha Bagchi, Mona Jain:
Complex Network Characteristics and Team Performance in the Game of Cricket. BDA 2013: 133-150 - [c21]Sebastien Ardon, Amitabha Bagchi, Anirban Mahanti, Amit Ruhela, Aaditeshwar Seth, Rudra Mohan Tripathy, Sipat Triukose:
Spatio-temporal and events based analysis of topic popularity in twitter. CIKM 2013: 219-228 - [c20]Rahul Goyal, Ravee Malla, Amitabha Bagchi, Sameep Mehta, Maya Ramanath:
ESTHETE: a news browsing system to visualize the context and evolution of news stories. CIKM 2013: 2529-2532 - [c19]Amitabha Bagchi, Cristina M. Pinotti, Sainyam Galhotra, Tarun Mangla:
Optimal radius for connectivity in duty-cycled wireless sensor networks. MSWiM 2013: 125-128 - 2012
- [j8]Pravesh Biyani, Shankar Prakriya, Amitabha Bagchi, Surendra Prasad:
Dynamic Programming Based Multi-User Resource Allocation for Partial Crosstalk Cancellation in VDSL. IEEE Commun. Lett. 16(3): 420-423 (2012) - [i8]S. Rajyalakshmi, Amitabha Bagchi, Soham Das, Rudra M. Tripathy:
Topic Diffusion and Emergence of Virality in Social Networks. CoRR abs/1202.2215 (2012) - 2011
- [c18]Amit Ruhela, Rudra M. Tripathy, Sipat Triukose, Sebastien Ardon, Amitabha Bagchi, Aaditeshwar Seth:
Towards the use of online social networks for efficient Internet content distribution. IEEE ANTS 2011: 1-6 - [c17]Amitabha Bagchi, Adit Madan, Achal Premi:
A computationally inexpensive and power efficient fully distributed topology for data collection in heterogeneous wireless sensor networks. DCOSS 2011: 1-8 - [c16]Amitabha Bagchi, Olivier Beaumont, Pascal Felber, Alberto Montresor:
Introduction. Euro-Par (1) 2011: 514-515 - [i7]Sebastien Ardon, Amitabha Bagchi, Anirban Mahanti, Amit Ruhela, Aaditeshwar Seth, Rudra M. Tripathy, Sipat Triukose:
Spatio-Temporal Analysis of Topic Popularity in Twitter. CoRR abs/1111.2904 (2011) - 2010
- [c15]Amitabha Bagchi, Adit Madan, Achal Premi:
Brief Announcement: Hierarchical Neighbor Graphs: A Sparse Connected Structure for Euclidean Point Sets. ALGOSENSORS 2010: 31-33 - [c14]Rudra M. Tripathy, Amitabha Bagchi, Sameep Mehta:
A study of rumor control strategies on social networks. CIKM 2010: 1817-1820 - [c13]Amitabha Bagchi:
Sparse power-efficient topologies for wireless ad hoc sensor networks. IPDPS 2010: 1-10
2000 – 2009
- 2009
- [c12]Amitabha Bagchi, Garima Lahoti:
Relating web pages to enable information-gathering tasks. Hypertext 2009: 109-118 - [i6]Amitabha Bagchi, Sariel Har-Peled, Achal Premi, Adit Madan:
Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space. CoRR abs/0903.0742 (2009) - 2008
- [c11]Rohan Choudhary, Sameep Mehta, Amitabha Bagchi:
On quantifying changes in temporally evolving dataset. CIKM 2008: 1459-1460 - [c10]Rohan Choudhary, Sameep Mehta, Amitabha Bagchi, Rahul Balakrishnan:
Towards Characterization of Actor Evolution and Interactions in News Corpora. ECIR 2008: 422-429 - [c9]Amitabha Bagchi, Sohit Bansal:
Nearest-neighbor graphs on random point sets and their applications to sensor networks. PODC 2008: 434 - [i5]Amitabha Bagchi, Sohit Bansal:
On the metric distortion of nearest-neighbour graphs on random point sets. CoRR abs/0804.3784 (2008) - [i4]Amitabha Bagchi:
Sparse power-efficient topologies for wireless ad hoc sensor networks. CoRR abs/0805.4060 (2008) - [i3]Amitabha Bagchi, Garima Lahoti:
Relating Web pages to enable information-gathering tasks. CoRR abs/0810.5428 (2008) - 2007
- [j7]Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discret. Math. 21(1): 141-157 (2007) - [j6]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams. ACM Trans. Algorithms 3(2): 16 (2007) - 2006
- [j5]Amitabha Bagchi, Ankur Bhargava, Torsten Suel:
Approximate maximum weight branchings. Inf. Process. Lett. 99(2): 54-58 (2006) - [j4]Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The Effect of Faults on Network Expansion. Theory Comput. Syst. 39(6): 903-928 (2006) - [j3]Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Chen Li, Michal Shmueli-Scheuer:
Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information. IEEE Trans. Knowl. Data Eng. 18(10): 1352-1367 (2006) - [c8]Rakesh Kumar, David D. Yao, Amitabha Bagchi, Keith W. Ross, Dan Rubenstein:
Fluid modeling of pollution proliferation in P2P networks. SIGMETRICS/Performance 2006: 335-346 - 2005
- [j2]Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich:
Biased Skip Lists. Algorithmica 42(1): 31-48 (2005) - [j1]Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman:
Short length Menger's theorem and reliable optical routing. Theor. Comput. Sci. 339(2-3): 315-332 (2005) - 2004
- [c7]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams. SCG 2004: 144-151 - [c6]Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The effect of faults on network expansion. SPAA 2004: 286-293 - [i2]Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The Effect of Faults on Network Expansion. CoRR cs.DC/0404029 (2004) - 2003
- [c5]Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman:
Short length menger's theorem and reliable optical routing. SPAA 2003: 246-247 - [c4]Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu:
Constructing Disjoint Paths for Secure Communication. DISC 2003: 181-195 - [i1]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic Sampling and Range Counting in Geometric Data Streams. CoRR cs.CG/0307027 (2003) - 2002
- [c3]Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich:
Biased Skip Lists. ISAAC 2002: 1-13 - [c2]Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
Algorithms for fault-tolerant routing in circuit switched networks. SPAA 2002: 265-274 - 2001
- [c1]Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar:
Seller-Focused Algorithms for Online Auctioning. WADS 2001: 135-147
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
