Amitabha Bagchi

Orcid: 0000-0003-0694-0602

According to our database1, Amitabha Bagchi authored at least 71 papers between 2001 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 




GRAPHGINI: Fostering Individual and Group Fairness in Graph Neural Networks.
CoRR, 2024

KWIQ: Answering k-core Window Queries in Temporal Networks.
Proceedings of the Proceedings 26th International Conference on Extending Database Technology, 2023

FoodMatch: Batching and Matching for Food Delivery in Dynamic Road Networks.
ACM Trans. Spatial Algorithms Syst., March, 2022

CHEX: Multiversion Replay with Ordered Checkpoints.
Proc. VLDB Endow., 2022

New Wine in an Old Bottle: Data-aware Hash Functions for Bloom Filters.
Proc. VLDB Endow., 2022

Gigs with Guarantees: Achieving Fair Wage for Food Delivery Workers.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

FairFoody: Bringing In Fairness in Food Delivery.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Answering Regular Path Queries through Exemplars.
Proc. VLDB Endow., 2021

A queueing network-based distributed Laplacian solver for directed graphs.
Inf. Process. Lett., 2021

Lower bounds for in-network computation of arbitrary functions.
Distributed Comput., 2021

A Queueing Network-Based Distributed Laplacian Solver.
Algorithmica, 2021

Balance Maximization in Signed Networks via Edge Deletions.
Proceedings of the WSDM '21, 2021

Fast One-class Classification using Class Boundary-preserving Random Projections.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Batching and Matching for Food Delivery in Dynamic Road Networks.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

A Group-to-Group Version of Random Walk Betweenness Centrality.
Proceedings of the CODS-COMAD 2021: 8th ACM IKDD CODS and 26th COMAD, 2021

FROCC: Fast Random projection-based One-Class Classification.
CoRR, 2020

Lecture notes: Efficient approximation of kernel functions.
CoRR, 2020

Adaptive Learned Bloom Filters under Incremental Workloads.
Proceedings of the CoDS-COMAD 2020: 7th ACM IKDD CoDS and 25th COMAD, 2020

A Distributed Laplacian Solver and its Applications to Electrical Flow and Random Spanning Tree Computation.
CoRR, 2019

Dynamic Partition Bloom Filters: A Bounded False Positive Solution For Dynamic Set Membership (Extended Abstract).
CoRR, 2019

Beyond Shortest Paths: Route Recommendations for Ride-sharing.
Proceedings of the World Wide Web Conference, 2019

Efficiently Answering Regular Simple Path Queries on Large Labeled Networks.
Proceedings of the 2019 International Conference on Management of Data, 2019

ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Sampling and Reconstruction Using Bloom Filters.
IEEE Trans. Knowl. Data Eng., 2018

Border effects on connectivity for randomly oriented directional antenna networks.
Proceedings of the 17th Annual Mediterranean Ad Hoc Networking Workshop, 2018

Analysis and characterization of comparison shopping behavior in the mobile handset domain.
Electron. Commer. Res., 2017

Learning User Representations in Online Social Networks using Temporal Dynamics of Information Diffusion.
CoRR, 2017

Random walk based in-network computation of arbitrary functions.
CoRR, 2017

Decentralized Random Walk-Based Data Collection in Networks.
CoRR, 2017

A user activity-based measurement study characterizing and classifying Stack Exchange communities across multiple domains.
Proceedings of the Fourth ACM IKDD Conferences on Data Sciences, 2017

Joint scheduling and routing using space-time graphs for TDM wireless mesh networks.
Wirel. Networks, 2016

The rich and middle classes on Twitter: Are popular users indeed different from regular users?
Comput. Commun., 2016

Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks.
ACM Trans. Sens. Networks, 2015

On the role of conductance, geography and topology in predicting hashtag virality.
Soc. Netw. Anal. Min., 2015

Tracking the Conductance of Rapidly Evolving Topic-Subgraphs.
Proc. VLDB Endow., 2015

Hierarchical Neighbor Graphs: A Topology Control Mechanism for Data Collection in Heterogeneous Wireless Sensor Networks.
Ad Hoc Sens. Wirel. Networks, 2015

Connectivity of a Dense Mesh of Randomly Oriented Directional Antennas Under a Realistic Fading Model.
Proceedings of the Algorithms for Sensor Systems, 2015

Surveillance using non-stealthy sensors: A new intruder model.
Secur. Commun. Networks, 2014

Characterizing comparison shopping behavior: A case study.
Proceedings of the Workshops Proceedings of the 30th International Conference on Data Engineering Workshops, 2014

Theme Based Clustering of Tweets.
Proceedings of the 1st IKDD Conference on Data Sciences, Delhi, India, March 21 - 23, 2014, 2014

Towards combating rumors in social networks: Models and metrics.
Intell. Data Anal., 2013

ESTHETE: a news browsing system to visualize the context and evolution of news stories.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Spatio-temporal and events based analysis of topic popularity in twitter.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Complex Network Characteristics and Team Performance in the Game of Cricket.
Proceedings of the Big Data Analytics - Second International Conference, 2013

Temporal Analysis of User Behavior and Topic Evolution on Twitter.
Proceedings of the Big Data Analytics - Second International Conference, 2013

The scope for Online Social Network aided caching in web CDNs.
Proceedings of the Symposium on Architecture for Networking and Communications Systems, 2013

Dynamic Programming Based Multi-User Resource Allocation for Partial Crosstalk Cancellation in VDSL.
IEEE Commun. Lett., 2012

Topic Diffusion and Emergence of Virality in Social Networks
CoRR, 2012

Spatio-Temporal Analysis of Topic Popularity in Twitter
CoRR, 2011

Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

A computationally inexpensive and power efficient fully distributed topology for data collection in heterogeneous wireless sensor networks.
Proceedings of the Distributed Computing in Sensor Systems, 2011

Towards the use of online social networks for efficient Internet content distribution.
Proceedings of the Fifth IEEE International Conference on Advanced Telecommunication Systems and Networks, 2011

Sparse power-efficient topologies for wireless ad hoc sensor networks.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

A study of rumor control strategies on social networks.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

Brief Announcement: Hierarchical Neighbor Graphs: A Sparse Connected Structure for Euclidean Point Sets.
Proceedings of the Algorithms for Sensor Systems, 2010

Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space
CoRR, 2009

Relating web pages to enable information-gathering tasks.
Proceedings of the HYPERTEXT 2009, Proceedings of the 20th ACM Conference on Hypertext and Hypermedia, Torino, Italy, June 29, 2009

On the metric distortion of nearest-neighbour graphs on random point sets
CoRR, 2008

Nearest-neighbor graphs on random point sets and their applications to sensor networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Towards Characterization of Actor Evolution and Interactions in News Corpora.
Proceedings of the Advances in Information Retrieval , 2008

On quantifying changes in temporally evolving dataset.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

Deterministic sampling and range counting in geometric data streams.
ACM Trans. Algorithms, 2007

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.
SIAM J. Discret. Math., 2007

Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information.
IEEE Trans. Knowl. Data Eng., 2006

The Effect of Faults on Network Expansion.
Theory Comput. Syst., 2006

Approximate maximum weight branchings.
Inf. Process. Lett., 2006

Fluid modeling of pollution proliferation in P2P networks.
Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006

Short length Menger's theorem and reliable optical routing.
Theor. Comput. Sci., 2005

Biased Skip Lists.
Algorithmica, 2005

Constructing Disjoint Paths for Secure Communication.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Seller-Focused Algorithms for Online Auctioning.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001