Aravind Srinivasan

21 papers · 2018–2025 · 6 conferences · across top CS/AI conferences

Achievements

🐝 Cross-Pollinator (10) 🌍 Conference Polyglot (6) 🏃 Academic Marathon (7) 🌈 Renaissance Researcher (5) 🧭 Keyword Pioneer 🗺️ Taxonomy Completionist (22) 🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🔬 Deep Specialist (10) 🏆 Keyword Champion (3) 🧬 Topic Evolution 🗃️ Keyword Collector (71) 🚀 Conference Pioneer 💎 Century Club (21) 🔥 Unstoppable (8) 📈 Trend Setter ⚡ Prolific Year (5)

Conferences

AAAI (6) AISTATS (5) IJCAI (3) NIPS (3) ICML (2) JMLR (2)

Top co-authors

Leonidas Tsepenekas (7) John Dickerson (6) Brian Brubach (5) Pan Xu (4) Thomas Pensyl (4) John P. Dickerson (4) Khoa Trinh (4) Darshan Chakrabarti (3) Sharmila Duppala (3) Nathaniel Grammel (3)

Keywords

approximation algorithm (13) fair clustering (5) combinatorial optimization (5) group fairness (3) individual fairness (3) randomized rounding (3) bipartite matching (2) stochastic clustering (2) online bipartite matching (2) matching algorithm (2) kidney exchange (2) online matching (2) fairness constraint (2) bipartite graph (2) knapsack constraint (2) probabilistic model (1) discrete mathematics (1) network diffusion (1) k-means clustering (1) unsupervised learning (1)

Papers

Proportionally Fair Matching via Randomized Rounding AAAI 2025

Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation ICML 2024

Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers IJCAI 2023

Group Fairness in Set Packing Problems IJCAI 2023

Rawlsian Fairness in Online Bipartite Matching: Two-Sided, Group, and Individual AAAI 2023

A New Notion of Individually Fair Clustering: $α$-Equitable $k$-Center AISTATS 2022

Dependent randomized rounding for clustering and partition systems with knapsack constraints JMLR 2022

Forecasting Patient Outcomes in Kidney Exchange IJCAI 2022

Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks AISTATS 2022

Fair Disaster Containment via Graph-Cut Problems AISTATS 2022

Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience AISTATS 2021

Fair Clustering Under a Bounded Cost NIPS 2021

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes NIPS 2021

Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints AAAI 2021

Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours AAAI 2020

Dependent randomized rounding for clustering and partition systems with knapsack constraints AISTATS 2020

A Pairwise Fair and Community-preserving Approach to k-Center Clustering ICML 2020

Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity AAAI 2019

A Unified Approach to Online Matching with Conflict-Aware Constraints AAAI 2019

Approximation Algorithms for Stochastic Clustering JMLR 2019

Approximation algorithms for stochastic clustering NIPS 2018