Aravind Srinivasan

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 105

Top Venues

CoRR

AAMAS

SODA

ACM Trans. Algorithms

Publications

Alok Baveja, Xiaoran Qu, Aravind Srinivasan
Approximating weighted completion time via stronger negative correlation. J. Sched. 27 (4) (2024)
Juan Luque, Sharmila Duppala, John P. Dickerson, Aravind Srinivasan
Barter Exchange with Shared Item Valuations. WWW (2024)
Juan Luque, Sharmila Duppala, John Dickerson, Aravind Srinivasan
Barter Exchange with Shared Item Valuations. CoRR (2024)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu, Yifan Xu
Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals. ACM Trans. Economics and Comput. 12 (2) (2024)
Da Qi Chen, Ann Li, George Z. Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers. IJCAI (2023)
Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
-Median. SODA (2023)
Joseph Naor, Aravind Srinivasan, David Wajc
Online Dependent Rounding Schemes. CoRR (2023)
Sharmila Duppala, Juan Luque, John P. Dickerson, Aravind Srinivasan
Group Fairness in Set Packing Problems. IJCAI (2023)
Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, Renata Valieva
Concentration of Submodular Functions Under Negative Dependence. CoRR (2023)
George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Deploying vaccine distribution sites for improved accessibility and equity to support pandemic response. Auton. Agents Multi Agent Syst. 37 (2) (2023)
Christine Herlihy, Aviva Prins, Aravind Srinivasan, John P. Dickerson
Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting. KDD (2023)
Seyed A. Esmaeili, Sharmila Duppala, Davidson Cheng, Vedant Nanda, Aravind Srinivasan, John P. Dickerson
Rawlsian Fairness in Online Bipartite Matching: Two-Sided, Group, and Individual. AAAI (2023)
Subrahmanya Swamy Peruru, Aravind Srinivasan, Radha Krishna Ganti, Krishna P. Jagannathan
Low-complexity scheduling algorithms with constant queue length and throughput guarantees. Perform. Evaluation (2022)
Seyed A. Esmaeili, Sharmila Duppala, Vedant Nanda, Aravind Srinivasan, John P. Dickerson
Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual. CoRR (2022)
Amy Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. CoRR (2022)
George Li, Ann Li, Madhav Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response. CoRR (2022)
Seyed A. Esmaeili, Sharmila Duppala, Vedant Nanda, Aravind Srinivasan, John P. Dickerson
Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual. AAMAS (2022)
Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median. CoRR (2022)
Jyoti R. Munavalli, Shyam Vasudeva Rao, Aravind Srinivasan, Frits van Merode
Dynamic Layout Design Optimization to Improve Patient Flow in Outpatient Clinics Using Genetic Algorithms. Algorithms 15 (3) (2022)
Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Fair Disaster Containment via Graph-Cut Problems. AISTATS (2022)
Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas
A New Notion of Individually Fair Clustering: α-Equitable k-Center. AISTATS (2022)
David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
Dependent randomized rounding for clustering and partition systems with knapsack constraints. J. Mach. Learn. Res. 23 (2022)
George Z. Li, Arash Haddadan, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Anil Vullikanti, Zeyu Zhao
Theoretical Models and Preliminary Results for Contact Tracing and Isolation. AAMAS (2022)
Jiangzhuo Chen, Stefan Hoops, Achla Marathe, Henning S. Mortveit, Bryan L. Lewis, Srinivasan Venkatramanan, Arash Haddadan, Parantapa Bhattacharya, Abhijin Adiga, Anil Vullikanti, Aravind Srinivasan, Mandy L. Wilson, Gal Ehrlich, Maier Fenster, Stephen G. Eubank, Christopher L. Barrett, Madhav V. Marathe
Effective Social Network-Based Allocation of COVID-19 Vaccines. KDD (2022)
Aravind Srinivasan, Pan Xu
The Generalized Magician Problem under Unknown Distributions and Related Applications. AAMAS (2022)
Amy E. Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. AISTATS (2022)
George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response. AAMAS (2022)
Naveen Durvasula, Aravind Srinivasan, John P. Dickerson
Forecasting Patient Outcomes in Kidney Exchange. IJCAI (2022)
Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. AISTATS (2021)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources. ACM Trans. Economics and Comput. 9 (3) (2021)
Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas
A New Notion of Individually Fair Clustering: α-Equitable k-Center. CoRR (2021)
Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan, John P. Dickerson
Fair Clustering Under a Bounded Cost. CoRR (2021)
Christine Herlihy, Aviva Prins, Aravind Srinivasan, John Dickerson
Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting. CoRR (2021)
Nikhil Bansal, Aravind Srinivasan, Ola Svensson
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. SIAM J. Comput. 50 (3) (2021)
Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Approximating Two-Stage Stochastic Supplier Problems. APPROX-RANDOM (2021)
Jaikumar Radhakrishnan, Aravind Srinivasan
Property B: Two-Coloring Non-Uniform Hypergraphs. FSTTCS (2021)
Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. CoRR (2021)
Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. CoRR (2021)
Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. AAAI (2021)
Amy Babay, Michael Dinitz, Prathyush Sambaturu, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Fair Disaster Containment via Graph-Cut Problems. CoRR (2021)
Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. NeurIPS (2021)
Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan, John Dickerson
Fair Clustering Under a Bounded Cost. NeurIPS (2021)
George Li, Arash Haddadan, Ann Li, Madhav Marathe, Aravind Srinivasan, Anil Vullikanti, Zeyu Zhao
A Markov Decision Process Framework for Efficient and Implementable Contact Tracing and Isolation. CoRR (2021)
Antares Chen, David G. Harris, Aravind Srinivasan
Partial resampling to approximate covering integer programs. Random Struct. Algorithms 58 (1) (2021)
Jyoti R. Munavalli, Shyam Vasudeva Rao, Aravind Srinivasan, Godefridus G. van Merode
An intelligent real-time scheduler for out-patient clinics: A multi-agent system model. Health Informatics J. 26 (4) (2020)
Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints. CoRR (2020)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. Algorithmica 82 (1) (2020)
Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR (2020)
Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AAAI (2020)
David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
Dependent randomized rounding for clustering and partition systems with knapsack constraints. AISTATS (2020)
Jyoti R. Munavalli, Shyam Vasudeva Rao, Aravind Srinivasan, Godefridus G. van Merode
Integral patient scheduling in outpatient clinics under demand uncertainty to minimize patient waiting times. Health Informatics J. 26 (1) (2020)
Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas
A Pairwise Fair and Community-preserving Approach to k-Center Clustering. ICML (2020)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Algorithms to Approximate Column-sparse Packing Problems. ACM Trans. Algorithms 16 (1) (2020)
Brian Brubach, Aravind Srinivasan, Shawn Zhao
Meddling Metrics: the Effects of Measuring and Constraining Partisan Gerrymandering on Voter Incentives. EC (2020)
Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas
A Pairwise Fair and Community-preserving Approach to k-Center Clustering. CoRR (2020)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Online Stochastic Matching: New Algorithms and Bounds. Algorithmica 82 (10) (2020)
Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AIES (2020)
David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
Approximation Algorithms for Stochastic Clustering. J. Mach. Learn. Res. 20 (2019)
David G. Harris, Aravind Srinivasan
The Moser-Tardos Framework with Partial Resampling. J. ACM 66 (5) (2019)
John P. Dickerson, Karthik Abinav Sankararaman, Kanthi Kiran Sarpatwar, Aravind Srinivasan, Kun-Lung Wu, Pan Xu
Online Resource Allocation with Matching Constraints. AAMAS (2019)
Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu
Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare. WINE (2019)
Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu
Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare. CoRR (2019)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. AAAI (2019)
Aravind Srinivasan
Editorial. ACM Trans. Algorithms 15 (2) (2019)
Pan Xu, Yexuan Shi, Hao Cheng, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yongxin Tong, Leonidas Tsepenekas
A Unified Approach to Online Matching with Conflict-Aware Constraints. AAAI (2019)
Brian Brubach, Nathaniel Grammel, Aravind Srinivasan
Vertex-weighted Online Stochastic Matching with Patience Constraints. CoRR (2019)
Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours. CoRR (2019)
David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
A Lottery Model for Center-Type Problems With Outliers. ACM Trans. Algorithms 15 (3) (2019)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Algorithms to Approximate Column-Sparse Packing Problems. SODA (2018)
Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Algorithmica 80 (4) (2018)
Jaroslaw Byrka, Aravind Srinivasan
Approximation Algorithms for Stochastic and Risk-Averse Optimization. SIAM J. Discret. Math. 32 (1) (2018)
David G. Harris, Shi Li, Aravind Srinivasan, Khoa Trinh, Thomas W. Pensyl
Approximation algorithms for stochastic clustering. NeurIPS (2018)
Barna Saha, Aravind Srinivasan
A new approximation technique for resource-allocation problems. Random Struct. Algorithms 52 (4) (2018)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals. AAMAS (2018)
David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
Approximation algorithms for stochastic clustering. CoRR (2018)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources. AAAI (2018)
Peruru Subrahmanya Swamy, Aravind Srinivasan, Radha Krishna Ganti, Krishna P. Jagannathan
Hierarchical scheduling algorithms with throughput guarantees and low delay. WiOpt (2018)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. CoRR (2018)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. CoRR (2018)
Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu
Improved Bounds in Stochastic Matching and Optimization. Algorithmica 80 (11) (2018)
Aravind Srinivasan
Probability and Computing. SIGACT News 49 (3) (2018)
David G. Harris, Aravind Srinivasan
Improved bounds and algorithms for graph cuts and network reliability. Random Struct. Algorithms 52 (1) (2018)
David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
Symmetric Randomized Dependent Rounding. CoRR (2017)
David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
A Lottery Model for Center-Type Problems with Outliers. APPROX-RANDOM (2017)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources. CoRR (2017)
Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh
-Median and Positive Correlation in Budgeted Optimization. ACM Trans. Algorithms 13 (2) (2017)
David G. Harris, Aravind Srinivasan
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. ACM Trans. Algorithms 13 (3) (2017)
Brian Brubach, Jay Ghurye, Mihai Pop, Aravind Srinivasan
Better Greedy Sequence Clustering with Fast Banded Alignment. WABI (2017)
David G. Harris, Aravind Srinivasan
A Constructive Lovász Local Lemma for Permutations. Theory Comput. 13 (1) (2017)
David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
A Lottery Model for Center-type Problems With Outliers. CoRR (2017)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. AAMAS (2017)
Pan Xu, Aravind Srinivasan, Kanthi K. Sarpatwar, Kun-Lung Wu
Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice. AAMAS (2017)
Jaroslaw Byrka, Aravind Srinivasan
Approximation algorithms for stochastic and risk-averse optimization. CoRR (2017)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Algorithms to Approximate Column-Sparse Packing Problems. CoRR (2017)
Nikhil Bansal, Aravind Srinivasan, Ola Svensson
Lift-and-round to improve weighted completion time on unrelated machines. STOC (2016)
Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan
On Computing Maximal Independent Sets of Hypergraphs in Parallel. ACM Trans. Parallel Comput. 3 (1) (2016)
David G. Harris, Aravind Srinivasan
A constructive algorithm for the LLL on permutations. CoRR (2016)
David G. Harris, Aravind Srinivasan
A note on near-optimal coloring of shift hypergraphs. Random Struct. Algorithms 48 (1) (2016)
David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
Efficient computation of sparse structures. Random Struct. Algorithms 49 (2) (2016)
Antares Chen, David G. Harris, Aravind Srinivasan
Partial Resampling to Approximate Covering Integer Programs. SODA (2016)

Aravind Srinivasan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Aravind Srinivasan