Aravind Srinivasan
21 papers · 2018–2025 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (20) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π¬
Deep Specialist
(10)
π
Keyword Champion
(3)
π
Conference Pioneer
β‘
Prolific Year Β· Productive
π₯
Unstoppable Β· Bronze
ποΈ
Keyword Collector
(77)
π
Century Club Β· Bronze
Top co-authors
Research topics
Machine Learning
(16)
Mathematics & Optimization
(13)
Optimization
(13)
Application Areas
(10)
Core Methods
(8)
Optimization & Theory
(7)
Data Science & Analytics
(4)
Applications Β· Data Science & Analytics
(4)
Mathematics
(3)
Artificial Intelligence
(2)
Core AI
(2)
Learning Types
(2)
Computer Science
(1)
Applications Β· Computer Science
(1)
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
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks
AISTATS 2022
Dependent randomized rounding for clustering and partition systems with knapsack constraints
JMLR 2022
Fair Disaster Containment via Graph-Cut Problems
AISTATS 2022
Forecasting Patient Outcomes in Kidney Exchange
IJCAI 2022
Fair Clustering Under a Bounded Cost
NeurIPS 2021
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints
AAAI 2021
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience
AISTATS 2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes
NeurIPS 2021
A Pairwise Fair and Community-preserving Approach to k-Center Clustering
ICML 2020
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
Approximation Algorithms for Stochastic Clustering
JMLR 2019
A Unified Approach to Online Matching with Conflict-Aware Constraints
AAAI 2019
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
AAAI 2019
Approximation algorithms for stochastic clustering
NeurIPS 2018