Aravind Srinivasan

310 papers A* 80A 21B 13C 3Misc 2Journal 156Unranked 31

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Barter Exchange with Asymmetric Item Valuations. WWW Juan Luque, Sharmila Duppala, Michael J. Curry, John P. Dickerson, Aravind Srinivasan
2026	J	`jnl`	Concentration of Submodular Functions and Read-k Families Under Negative Dependence. Algorithmica Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, Renata Valieva
2026	J	`jnl`	Differentially private graph coloring. CoRR Michael Xie, Jiayi Wu, Dung Nguyen, Aravind Srinivasan
2026	A	`conf`	Dimension-Free Correlated Sampling for the Hypersimplex. ITCS Joseph (Seffi) Naor, Nitya Raju, Abhishek Shetty, Aravind Srinivasan, Renata Valieva, David Wajc
2025	A	`conf`	Concentration of Submodular Functions and Read-k Families Under Negative Dependence. ITCS Sharmila Duppala, George Li, Juan Luque, Aravind Srinivasan, Renata Valieva
2025	J	`jnl`	Controlling the Spread of Epidemics on Networks with Differential Privacy. CoRR Dung Nguyen, Aravind Srinivasan, Renata Valieva, Anil Vullikanti, Jiayi Wu
2025	J	`jnl`	Dimension-Free Correlated Sampling for the Hypersimplex. CoRR Joseph Naor, Nitya Raju, Abhishek Shetty, Aravind Srinivasan, Renata Valieva, David Wajc
2025	J	`jnl`	Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes. Math. Oper. Res. Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2025	A*	`conf`	Online Dependent Rounding Schemes for Bipartite Matchings, with. SODA Joseph (Seffi) Naor, Aravind Srinivasan, David Wajc
2025	J	`jnl`	Online Matching Frameworks Under Stochastic Rewards, Product Ranking, and Unknown Patience. Oper. Res. Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2025	A*	`conf`	Proportionally Fair Matching via Randomized Rounding. AAAI Sharmila Duppala, Nathaniel Grammel, Juan Luque, Calum MacRury, Aravind Srinivasan
2025	J	`jnl`	Technical Note - Improved Sample-Complexity Bounds in Stochastic Optimization. Oper. Res. Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu
2024	J	`jnl`	Approximating weighted completion time via stronger negative correlation. J. Sched. Alok Baveja, Xiaoran Qu, Aravind Srinivasan
2024	A*	`conf`	Barter Exchange with Shared Item Valuations. WWW Juan Luque, Sharmila Duppala, John P. Dickerson, Aravind Srinivasan
2024	J	`jnl`	Barter Exchange with Shared Item Valuations. CoRR Juan Luque, Sharmila Duppala, John Dickerson, Aravind Srinivasan
2024	J	`jnl`	Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals. ACM Trans. Economics and Comput. John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu, Yifan Xu
2024	A*	`conf`	Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation. ICML Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2024	J	`jnl`	Proportionally Fair Matching via Randomized Rounding. CoRR Sharmila Duppala, Nathaniel Grammel, Juan Luque, Calum MacRury, Aravind Srinivasan
2023	J	`jnl`	Concentration of Submodular Functions Under Negative Dependence. CoRR Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, Renata Valieva
2023	J	`jnl`	Deploying vaccine distribution sites for improved accessibility and equity to support pandemic response. Auton. Agents Multi Agent Syst. George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2023	A*	`conf`	Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers. IJCAI Da Qi Chen, Ann Li, George Z. Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2023	J	`jnl`	Flamingo: Environmental Impact Factor Matching for Life Cycle Assessment with Zero-shot Machine Learning. ACM J. Comput. Sustain. Soc. Bharathan Balaji, Venkata Sai Gargeya Vunnava, Nina Domingo, Shikhar Gupta, Harsh Gupta, Geoffrey Guest, Aravind Srinivasan
2023	A*	`conf`	Group Fairness in Set Packing Problems. IJCAI Sharmila Duppala, Juan Luque, John P. Dickerson, Aravind Srinivasan
2023	A*	`conf`	Improved Bi-point Rounding Algorithms and a Golden Barrier for SODA Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2023	J	`jnl`	Online Dependent Rounding Schemes. CoRR Joseph Naor, Aravind Srinivasan, David Wajc
2023	A*	`conf`	Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting. KDD Christine Herlihy, Aviva Prins, Aravind Srinivasan, John P. Dickerson
2023	A*	`conf`	Rawlsian Fairness in Online Bipartite Matching: Two-Sided, Group, and Individual. AAAI Seyed A. Esmaeili, Sharmila Duppala, Davidson Cheng, Vedant Nanda, Aravind Srinivasan, John P. Dickerson
2022	A	`conf`	A New Notion of Individually Fair Clustering: α-Equitable k-Center. AISTATS Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas
2022	A	`conf`	Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. AISTATS Amy E. Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2022	J	`jnl`	Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. CoRR Amy Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2022	J	`jnl`	Dependent randomized rounding for clustering and partition systems with knapsack constraints. J. Mach. Learn. Res. David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2022	A	`conf`	Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response. AAMAS George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2022	J	`jnl`	Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response. CoRR George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2022	J	`jnl`	Dynamic Layout Design Optimization to Improve Patient Flow in Outpatient Clinics Using Genetic Algorithms. Algorithms Jyoti R. Munavalli, Shyam Vasudeva Rao, Aravind Srinivasan, Frits van Merode
2022	A*	`conf`	Effective Social Network-Based Allocation of COVID-19 Vaccines. KDD 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
2022	A	`conf`	Fair Disaster Containment via Graph-Cut Problems. AISTATS Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2022	A*	`conf`	Forecasting Patient Outcomes in Kidney Exchange. IJCAI Naveen Durvasula, Aravind Srinivasan, John P. Dickerson
2022	J	`jnl`	Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median. CoRR Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2022	J	`jnl`	Low-complexity scheduling algorithms with constant queue length and throughput guarantees. Perform. Evaluation Subrahmanya Swamy Peruru, Aravind Srinivasan, Radha Krishna Ganti, Krishna P. Jagannathan
2022	A	`conf`	Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual. AAMAS Seyed A. Esmaeili, Sharmila Duppala, Vedant Nanda, Aravind Srinivasan, John P. Dickerson
2022	J	`jnl`	Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual. CoRR Seyed A. Esmaeili, Sharmila Duppala, Vedant Nanda, Aravind Srinivasan, John P. Dickerson
2022	A	`conf`	The Generalized Magician Problem under Unknown Distributions and Related Applications. AAMAS Aravind Srinivasan, Pan Xu
2022	A	`conf`	Theoretical Models and Preliminary Results for Contact Tracing and Isolation. AAMAS George Z. Li, Arash Haddadan, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Anil Vullikanti, Zeyu Zhao
2021	J	`jnl`	A Markov Decision Process Framework for Efficient and Implementable Contact Tracing and Isolation. CoRR George Z. Li, Arash Haddadan, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Anil Vullikanti, Zeyu Zhao
2021	J	`jnl`	A New Notion of Individually Fair Clustering: α-Equitable k-Center. CoRR Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas
2021	J	`jnl`	Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources. ACM Trans. Economics and Comput. John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2021	—	`conf`	Approximating Two-Stage Stochastic Supplier Problems. APPROX-RANDOM Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2021	A*	`conf`	Fair Clustering Under a Bounded Cost. NeurIPS Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan, John Dickerson
2021	J	`jnl`	Fair Clustering Under a Bounded Cost. CoRR Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan, John P. Dickerson
2021	J	`jnl`	Fair Disaster Containment via Graph-Cut Problems. CoRR Amy Babay, Michael Dinitz, Prathyush Sambaturu, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2021	A*	`conf`	Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. AAAI Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas
2021	J	`jnl`	Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. CoRR Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas
2021	A	`conf`	Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. AISTATS Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan
2021	A*	`conf`	Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. NeurIPS Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2021	J	`jnl`	Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. CoRR Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2021	J	`jnl`	Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. SIAM J. Comput. Nikhil Bansal, Aravind Srinivasan, Ola Svensson
2021	J	`jnl`	Partial resampling to approximate covering integer programs. Random Struct. Algorithms Antares Chen, David G. Harris, Aravind Srinivasan
2021	J	`jnl`	Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting. CoRR Christine Herlihy, Aviva Prins, Aravind Srinivasan, John Dickerson
2021	—	`conf`	Property B: Two-Coloring Non-Uniform Hypergraphs. FSTTCS Jaikumar Radhakrishnan, Aravind Srinivasan
2020	A*	`conf`	A Pairwise Fair and Community-preserving Approach to k-Center Clustering. ICML Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas
2020	J	`jnl`	A Pairwise Fair and Community-preserving Approach to k-Center Clustering. CoRR Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas
2020	J	`jnl`	Algorithms to Approximate Column-sparse Packing Problems. ACM Trans. Algorithms Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2020	J	`jnl`	An intelligent real-time scheduler for out-patient clinics: A multi-agent system model. Health Informatics J. Jyoti R. Munavalli, Shyam Vasudeva Rao, Aravind Srinivasan, Godefridus G. van Merode
2020	J	`jnl`	Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints. CoRR Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
2020	J	`jnl`	Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. Algorithmica Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2020	A*	`conf`	Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AAAI Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan
2020	C	`conf`	Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AIES Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan
2020	A	`conf`	Dependent randomized rounding for clustering and partition systems with knapsack constraints. AISTATS David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2020	J	`jnl`	Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2020	J	`jnl`	Integral patient scheduling in outpatient clinics under demand uncertainty to minimize patient waiting times. Health Informatics J. Jyoti R. Munavalli, Shyam Vasudeva Rao, Aravind Srinivasan, Godefridus G. van Merode
2020	A*	`conf`	Meddling Metrics: the Effects of Measuring and Constraining Partisan Gerrymandering on Voter Incentives. EC Brian Brubach, Aravind Srinivasan, Shawn Zhao
2020	J	`jnl`	Online Stochastic Matching: New Algorithms and Bounds. Algorithmica Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2019	J	`jnl`	A Lottery Model for Center-Type Problems With Outliers. ACM Trans. Algorithms David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2019	A*	`conf`	A Unified Approach to Online Matching with Conflict-Aware Constraints. AAAI Pan Xu, Yexuan Shi, Hao Cheng, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yongxin Tong, Leonidas Tsepenekas
2019	J	`jnl`	Approximation Algorithms for Stochastic Clustering. J. Mach. Learn. Res. David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2019	A*	`conf`	Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. AAAI John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2019	J	`jnl`	Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours. CoRR Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan
2019	J	`jnl`	Editorial. ACM Trans. Algorithms Aravind Srinivasan
2019	J	`jnl`	Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare. CoRR Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu
2019	—	`conf`	Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare. WINE Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu
2019	A	`conf`	Online Resource Allocation with Matching Constraints. AAMAS John P. Dickerson, Karthik Abinav Sankararaman, Kanthi Kiran Sarpatwar, Aravind Srinivasan, Kun-Lung Wu, Pan Xu
2019	J	`jnl`	The Moser-Tardos Framework with Partial Resampling. J. ACM David G. Harris, Aravind Srinivasan
2019	J	`jnl`	Vertex-weighted Online Stochastic Matching with Patience Constraints. CoRR Brian Brubach, Nathaniel Grammel, Aravind Srinivasan
2018	J	`jnl`	A new approximation technique for resource-allocation problems. Random Struct. Algorithms Barna Saha, Aravind Srinivasan
2018	A*	`conf`	Algorithms to Approximate Column-Sparse Packing Problems. SODA Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2018	A*	`conf`	Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources. AAAI John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2018	J	`jnl`	An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Algorithmica Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh
2018	J	`jnl`	Approximation Algorithms for Stochastic and Risk-Averse Optimization. SIAM J. Discret. Math. Jaroslaw Byrka, Aravind Srinivasan
2018	A*	`conf`	Approximation algorithms for stochastic clustering. NeurIPS David G. Harris, Shi Li, Aravind Srinivasan, Khoa Trinh, Thomas W. Pensyl
2018	J	`jnl`	Approximation algorithms for stochastic clustering. CoRR David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2018	A	`conf`	Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals. AAMAS John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2018	J	`jnl`	Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. CoRR Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2018	J	`jnl`	Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. CoRR John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2018	B	`conf`	Hierarchical scheduling algorithms with throughput guarantees and low delay. WiOpt Peruru Subrahmanya Swamy, Aravind Srinivasan, Radha Krishna Ganti, Krishna P. Jagannathan
2018	J	`jnl`	Improved Bounds in Stochastic Matching and Optimization. Algorithmica Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu
2018	J	`jnl`	Improved bounds and algorithms for graph cuts and network reliability. Random Struct. Algorithms David G. Harris, Aravind Srinivasan
2018	J	`jnl`	Probability and Computing. SIGACT News Aravind Srinivasan
2017	J	`jnl`	A Constructive Lovász Local Lemma for Permutations. Theory Comput. David G. Harris, Aravind Srinivasan
2017	—	`conf`	A Lottery Model for Center-Type Problems with Outliers. APPROX-RANDOM David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2017	J	`jnl`	A Lottery Model for Center-type Problems With Outliers. CoRR David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2017	J	`jnl`	Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. ACM Trans. Algorithms David G. Harris, Aravind Srinivasan
2017	J	`jnl`	Algorithms to Approximate Column-Sparse Packing Problems. CoRR Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2017	J	`jnl`	Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources. CoRR John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2017	J	`jnl`	An Improved Approximation for ACM Trans. Algorithms Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh
2017	J	`jnl`	Approximation algorithms for stochastic and risk-averse optimization. CoRR Jaroslaw Byrka, Aravind Srinivasan
2017	A	`conf`	Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. AAMAS Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2017	C	`conf`	Better Greedy Sequence Clustering with Fast Banded Alignment. WABI Brian Brubach, Jay Ghurye, Mihai Pop, Aravind Srinivasan
2017	A	`conf`	Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice. AAMAS Pan Xu, Aravind Srinivasan, Kanthi K. Sarpatwar, Kun-Lung Wu
2017	J	`jnl`	Symmetric Randomized Dependent Rounding. CoRR David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh
2016	J	`jnl`	A constructive algorithm for the LLL on permutations. CoRR David G. Harris, Aravind Srinivasan
2016	J	`jnl`	A note on near-optimal coloring of shift hypergraphs. Random Struct. Algorithms David G. Harris, Aravind Srinivasan
2016	A*	`conf`	Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. SODA David G. Harris, Aravind Srinivasan
2016	J	`jnl`	Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks. ACM Trans. Algorithms V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2016	J	`jnl`	Efficient computation of sparse structures. Random Struct. Algorithms David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
2016	J	`jnl`	Improved bounds and algorithms for graph cuts and network reliability. CoRR David G. Harris, Aravind Srinivasan
2016	A*	`conf`	Lift-and-round to improve weighted completion time on unrelated machines. STOC Nikhil Bansal, Aravind Srinivasan, Ola Svensson
2016	—	`ch.`	Minimum Weighted Completion Time. Encyclopedia of Algorithms V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2016	A	`conf`	New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. ESA Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2016	J	`jnl`	New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. CoRR Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2016	J	`jnl`	On Computing Maximal Independent Sets of Hypergraphs in Parallel. ACM Trans. Parallel Comput. Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan
2016	A*	`conf`	Partial Resampling to Approximate Covering Integer Programs. SODA Antares Chen, David G. Harris, Aravind Srinivasan
2015	J	`jnl`	Algorithmic and enumerative aspects of the Moser-Tardos distribution. CoRR David G. Harris, Aravind Srinivasan
2015	A	`conf`	An Improved Approximation Algorithm for Knapsack Median Using Sparsification. ESA Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh
2015	A*	`conf`	An Improved Approximation for SODA Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh
2015	—	`conf`	Improved Bounds in Stochastic Matching and Optimization. APPROX-RANDOM Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu
2015	J	`jnl`	Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. CoRR Nikhil Bansal, Ola Svensson, Aravind Srinivasan
2015	J	`jnl`	Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems. ACM Trans. Comput. Theory Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
2015	J	`jnl`	Model-Based Forecasting of Significant Societal Events. IEEE Intell. Syst. Naren Ramakrishnan, Chang-Tien Lu, Madhav V. Marathe, Achla Marathe, Anil Vullikanti, Stephen G. Eubank, Scotland Leman, Michael J. Roan, John S. Brownstein, Kristen Maria Summers, Lise Getoor, Aravind Srinivasan, Tanzeem Choudhury, Dipak Gupta, David Mares
2015	J	`jnl`	On the Energy Efficiency of Device Discovery in Mobile Opportunistic Networks: A Systematic Approach. IEEE Trans. Mob. Comput. Bo Han, Jian Li, Aravind Srinivasan
2015	J	`jnl`	Partial Resampling to Approximate Covering Integer Programs. CoRR Antares Chen, David G. Harris, Aravind Srinivasan
2015	A	`conf`	Selling Tomorrow's Bargains Today. AAMAS Melika Abolhassani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, Aravind Srinivasan
2015	—	`conf`	Towards numerical temporal-frequency system modelling of associations between electrocardiogram and ballistocardiogram. EMBC Aravind Srinivasan, Haihong Zhang, Zhiping Lin, Jit Biswas, Zhihao Chen
2014	J	`jnl`	'Beating the news' with EMBERS: Forecasting Civil Unrest using Open Source Indicators. CoRR Naren Ramakrishnan, Patrick Butler, Sathappan Muthiah, Nathan Self, Rupinder Paul Khandpur, Parang Saraf, Wei Wang, Jose Cadena, Anil Vullikanti, Gizem Korkmaz, Chris J. Kuhlman, Achla Marathe, Liang Zhao, Ting Hua, Feng Chen, Chang-Tien Lu, Bert Huang, Aravind Srinivasan, Khoa Trinh, Lise Getoor, Graham Katz, Andy Doyle, Chris Ackermann, Ilya Zavorin, Jim Ford, Kristen Maria Summers, Youssef Fayed, Jaime Arredondo, Dipak Gupta, David Mares
2014	A*	`conf`	'Beating the news' with EMBERS: forecasting civil unrest using open source indicators. KDD Naren Ramakrishnan, Patrick Butler, Sathappan Muthiah, Nathan Self, Rupinder Paul Khandpur, Parang Saraf, Wei Wang, Jose Cadena, Anil Vullikanti, Gizem Korkmaz, Chris J. Kuhlman, Achla Marathe, Liang Zhao, Ting Hua, Feng Chen, Chang-Tien Lu, Bert Huang, Aravind Srinivasan, Khoa Trinh, Lise Getoor, Graham Katz, Andy Doyle, Chris Ackermann, Ilya Zavorin, Jim Ford, Kristen Maria Summers, Youssef Fayed, Jaime Arredondo, Dipak Gupta, David Mares
2014	A*	`conf`	A constructive algorithm for the Lovász Local Lemma on permutations. SODA David G. Harris, Aravind Srinivasan
2014	—	`conf`	A monolithically-integrated optical transmitter and receiver in a zero-change 45nm SOI process. VLSIC Michael Georgas, Benjamin Moss, Chen Sun, Jeffrey Shainline, Jason Orcutt, Mark T. Wade, Yu-Hsin Chen, Kareem Nammari, Jonathan C. Leu, Aravind Srinivasan, Rajeev J. Ram, Milos A. Popovic, Vladimir Stojanovic
2014	J	`jnl`	An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization. CoRR Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh
2014	A*	`conf`	Improved bounds and algorithms for graph cuts and network reliability. SODA David G. Harris, Aravind Srinivasan
2014	J	`jnl`	On Computing Maximal Independent Sets of Hypergraphs in Parallel. CoRR Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan
2014	J	`jnl`	On Random Sampling Auctions for Digital Goods. ACM Trans. Economics and Comput. Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan
2014	B	`conf`	On computing maximal independent sets of hypergraphs in parallel. SPAA Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan
2014	J	`jnl`	Review of Visions of Infinity: The Great Mathematical Problems by Ian Stewart. SIGACT News Aravind Srinivasan
2014	J	`jnl`	The Moser-Tardos Framework with Partial Resampling. CoRR David G. Harris, Aravind Srinivasan
2014	J	`jnl`	Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random-Walk Sampling. IEEE/ACM Trans. Netw. Bo Han, Jian Li, Aravind Srinivasan
2013	J	`jnl`	Approximation Algorithms for Throughput Maximization in Wireless Networks With Delay Constraints. IEEE/ACM Trans. Netw. Guanhong Pei, Srinivasan Parthasarathy, Aravind Srinivasan, Anil Kumar S. Vullikanti
2013	A*	`conf`	Constraint satisfaction, packet routing, and the lovasz local lemma. STOC David G. Harris, Aravind Srinivasan
2013	—	`conf`	Efficient Computation of Balanced Structures. ICALP (2) David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
2013	B	`conf`	Enabling energy-aware collaborative mobile data offloading for smartphones. SECON Aaron Yi Ding, Bo Han, Yu Xiao, Pan Hui, Aravind Srinivasan, Markku Kojo, Sasu Tarkoma
2013	J	`jnl`	On Random Sampling Auctions for Digital Goods CoRR Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan
2013	J	`jnl`	Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). SIAM J. Comput. Chris Peikert, Robert Kleinberg, Aravind Srinivasan, Alan M. Frieze, Alexander Russell, Leonard J. Schulman
2013	A*	`conf`	The Moser-Tardos Framework with Partial Resampling. FOCS David G. Harris, Aravind Srinivasan
2012	—	`conf`	Efficient booster pump placement in water networks using graph theoretic principles. IGCC Iyswarya Narayanan, Venkatesh Sarangan, Arunchandar Vasan, Aravind Srinivasan, Anand Sivasubramaniam, B. S. Murt, Shankar Narasimhan
2012	J	`jnl`	Mobile Data Offloading through Opportunistic Communications and Social Participation. IEEE Trans. Mob. Comput. Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marathe, Jianhua Shao, Aravind Srinivasan
2012	Misc	`conf`	Networking lessons: From computers to water. COMSNETS Iyswarya Narayanan, Venkatesh Sarangan, Arunchandar Vasan, Aravind Srinivasan, Anand Sivasubramaniam
2012	—	`conf`	Optimizing epidemic protection for socially essential workers. IHI Christopher L. Barrett, Richard J. Beckman, Keith R. Bisset, Jiangzhuo Chen, Thomas M. DuBois, Stephen G. Eubank, V. S. Anil Kumar, Bryan L. Lewis, Madhav V. Marathe, Aravind Srinivasan, Paula Elaine Stretz
2012	J	`jnl`	Solving Packing Integer Programs via Randomized Rounding with Alterations. Theory Comput. Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan
2012	J	`jnl`	The Effect of Random Edge Removal on Network Degree Sequence. Electron. J. Comb. Thomas M. DuBois, Stephen G. Eubank, Aravind Srinivasan
2012	B	`conf`	Your friends have more friends than you do: identifying influential mobile users through random walks. MobiHoc Bo Han, Aravind Srinivasan
2012	B	`conf`	eDiscovery: Energy efficient device discovery for mobile opportunistic communications. ICNP Bo Han, Aravind Srinivasan
2011	A*	`conf`	Approximation algorithms for throughput maximization in wireless networks with delay constraints. INFOCOM Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthasarathy, Aravind Srinivasan
2011	J	`jnl`	Capacity of wireless networks under SINR interference constraints. Wirel. Networks Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2011	J	`jnl`	Maximum bipartite flow in networks with adaptive channel width. Theor. Comput. Sci. Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan
2011	J	`jnl`	Network Clustering Approximation Algorithm Using One Pass Black Box Sampling CoRR Thomas M. DuBois, Jennifer Golbeck, Aravind Srinivasan
2011	J	`jnl`	New Constructive Aspects of the Lovász Local Lemma. J. ACM Bernhard Haeupler, Barna Saha, Aravind Srinivasan
2011	—	`conf`	Predicting Trust and Distrust in Social Networks. SocialCom/PASSAT Thomas M. DuBois, Jennifer Golbeck, Aravind Srinivasan
2010	J	`jnl`	A New Approximation Technique for Resource-Allocation Problems CoRR Barna Saha, Aravind Srinivasan
2010	A	`conf`	A New Approximation Technique for Resource-Allocation Problems. ICS Barna Saha, Aravind Srinivasan
2010	—	`conf`	Cellular traffic offloading through opportunistic communications: a case study. CHANTS@MobiCom Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marathe, Guanhong Pei, Aravind Srinivasan
2010	J	`jnl`	Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009. SIGACT News Aravind Srinivasan
2010	B	`conf`	Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. IPCO Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy
2010	J	`jnl`	Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm CoRR Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy
2010	J	`jnl`	LP-rounding algorithms for facility-location problems CoRR Jaroslaw Byrka, Mohammadreza Ghodsi, Aravind Srinivasan
2010	J	`jnl`	Mobile data offloading in metropolitan area networks. ACM SIGMOBILE Mob. Comput. Commun. Rev. Bo Han, Pan Hui, Aravind Srinivasan
2010	—	`conf`	Mélange: Supporting heterogeneous QoS requirements in delay tolerant sensor networks. INSS Hengchang Liu, Aravind Srinivasan, Kamin Whitehouse, John A. Stankovic
2010	J	`jnl`	New Constructive Aspects of the Lovasz Local Lemma CoRR Bernhard Haeupler, Barna Saha, Aravind Srinivasan
2010	A*	`conf`	New Constructive Aspects of the Lovasz Local Lemma. FOCS Bernhard Haeupler, Barna Saha, Aravind Srinivasan
2010	B	`conf`	On IPCO Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan
2009	J	`jnl`	A unified approach to scheduling on unrelated parallel machines. J. ACM V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2009	A*	`conf`	Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. INFOCOM Bo Han, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2009	—	`conf`	Maximum Bipartite Flow in Networks with Adaptive Channel Width. ICALP (2) Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan
2009	A*	`conf`	On random sampling auctions for digital goods. EC Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan
2009	—	`conf`	Rigorous Probabilistic Trust-Inference with Applications to Clustering. Web Intelligence Thomas M. DuBois, Jennifer Golbeck, Aravind Srinivasan
2009	J	`jnl`	Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. Algorithmica V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2008	J	`jnl`	A note on the distribution of the number of prime factors of the integers. Inf. Process. Lett. Aravind Srinivasan
2008	A*	`conf`	Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. INFOCOM Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2008	—	`conf`	Budgeted Allocations in the Full-Information Setting. APPROX-RANDOM Aravind Srinivasan
2008	A*	`conf`	Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. INFOCOM Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2008	J	`jnl`	Cost-Sharing Mechanisms for Network Design. Algorithmica Anupam Gupta, Aravind Srinivasan, Éva Tardos
2008	J	`jnl`	Efficient and Resilient Backbones for Multihop Wireless Networks. IEEE Trans. Mob. Comput. Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan, Samir Khuller
2008	A*	`conf`	Improved algorithmic versions of the Lovász Local Lemma. SODA Aravind Srinivasan
2008	—	`ch.`	Innovization: Discovery of Innovative Design Principles Through Multiobjective Evolutionary Optimization. Multiobjective Problem Solving from Nature Kalyanmoy Deb, Aravind Srinivasan
2008	—	`ch.`	Minimum Weighted Completion Time. Encyclopedia of Algorithms V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2008	—	`conf`	The Randomized Coloring Procedure with Symmetry-Breaking. ICALP (1) Sriram V. Pemmaraju, Aravind Srinivasan
2007	A*	`conf`	Approximation algorithms for stochastic and risk-averse optimization. SODA Aravind Srinivasan
2007	B	`conf`	Cross-layer latency minimization in wireless networks with SINR constraints. MobiHoc Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2007	Misc	`conf`	Distributed Ranked Search. HiPC Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhattacharjee, Peter J. Keleher, Aravind Srinivasan
2007	J	`jnl`	Efficient lookup on unstructured topologies. IEEE J. Sel. Areas Commun. Ruggero Morselli, Bobby Bhattacharjee, Michael A. Marsh, Aravind Srinivasan
2007	—	`conf`	INT-MANUS: Interactive Production Control in a Distributed Environment. HCI (4) Thomas Schlegel, Aravind Srinivasan, Maxim Foursa, Manfred Bogen, Rejin Narayanan, David d'Angelo, Géza Haidegger, István Mezgár, Joseph Canou, Damien Sallé, Fabrizio Meo, Jon Agirre Ibarbia, Anja Herrmann Praturlon
2007	J	`jnl`	Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. SIAM J. Comput. Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang
2007	—	`conf`	Randomized Algorithms and Probabilistic Analysis in Wireless Networking. SAGA Aravind Srinivasan
2006	A*	`conf`	A Client-Driven Approach for Channel Management in Wireless LANs. INFOCOM Arunesh Mishra, Vladimir Brik, Suman Banerjee, Aravind Srinivasan, William A. Arbaugh
2006	B	`conf`	A Population-Based, Parent Centric Procedure for Constrained Real-Parameter Optimization. IEEE Congress on Evolutionary Computation Ankur Sinha, Aravind Srinivasan, Kalyanmoy Deb
2006	J	`jnl`	An Extension of the Lovász Local Lemma, and its Applications to Integer Programming. SIAM J. Comput. Aravind Srinivasan
2006	J	`jnl`	An Improved Approximation Ratio for the Covering Steiner Problem. Theory Comput. Anupam Gupta, Aravind Srinivasan
2006	J	`jnl`	An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci. Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
2006	J	`jnl`	Approximation algorithms for channel allocation problems in broadcast networks. Networks Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang
2006	J	`jnl`	Client-driven channel management for wireless LANs. ACM SIGMOBILE Mob. Comput. Commun. Rev. Arunesh Mishra, Vladimir Brik, Suman Banerjee, Aravind Srinivasan, William A. Arbaugh
2006	J	`jnl`	Dependent rounding and its applications to approximation algorithms. J. ACM Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan
2006	J	`jnl`	Foreword. Theory Comput. Syst. Peter Sanders, Aravind Srinivasan, Berthold Vöcking
2006	A	`conf`	Innovization: innovating design principles through optimization. GECCO Kalyanmoy Deb, Aravind Srinivasan
2006	B	`conf`	Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. ISAAC Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
2006	J	`jnl`	Provable algorithms for parallel generalized sweep scheduling. J. Parallel Distributed Comput. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Sibylle Zust
2006	J	`jnl`	Resilient multicast using overlays. IEEE/ACM Trans. Netw. Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan
2006	J	`jnl`	Review of "The Random Projection Method by Santosh Vempala". SIGACT News Aravind Srinivasan
2005	A*	`conf`	Algorithmic aspects of capacity in wireless networks. SIGMETRICS V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2005	A*	`conf`	Approximation Algorithms for Scheduling on Multiple Machines. FOCS V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2005	A*	`conf`	Efficient lookup on unstructured topologies. PODC Ruggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh
2005	J	`jnl`	Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
2005	J	`jnl`	P J. Comput. Secur. Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan
2005	A	`conf`	Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes. IPDPS V. S. Anil Kumar, Srinivasan Parthasarathy, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust
2005	—	`conf`	Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. APPROX-RANDOM V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2004	J	`jnl`	Approximation algorithms for partial covering problems. J. Algorithms Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
2004	—	`conf`	Cost-Sharing Mechanisms for Network Design. APPROX-RANDOM Anupam Gupta, Aravind Srinivasan, Éva Tardos
2004	A*	`conf`	End-to-end packet-scheduling in wireless ad-hoc networks. SODA V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
2004	J	`jnl`	Finding Large Independent Sets in Graphs and Hypergraphs. SIAM J. Discret. Math. Hadas Shachnai, Aravind Srinivasan
2004	J	`jnl`	Lower bounds on the Deterministic and Quantum Communication Complexity of HAM Electron. Colloquium Comput. Complex. Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
2004	J	`jnl`	Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance CoRR Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
2004	B	`conf`	Scalable resilient media streaming. NOSSDAV Suman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind Srinivasan
2004	J	`jnl`	Special issue: 35th Annual ACM Symposium on Theory of Computing. J. Comput. Syst. Sci. Sanjeev Khanna, Aravind Srinivasan
2004	A*	`conf`	Structural and algorithmic aspects of massive social networks. SODA Stephen G. Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang
2004	—	`conf`	Structure of Social Contact Networks and Their Impact on Epidemics. Discrete Methods in Epidemiology Stephen G. Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang
2003	J	`jnl`	An Extension of the Lovasz Local Lemma, and its Applications to Integer Programming CoRR Aravind Srinivasan
2003	A*	`conf`	An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ICALP Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
2003	—	`conf`	Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. RANDOM-APPROX Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang
2003	A*	`conf`	Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. SODA Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
2003	A*	`conf`	Integrality ratio for group Steiner trees and directed steiner trees. SODA Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang
2003	—	`conf`	On the Covering Steiner Problem. FSTTCS Anupam Gupta, Aravind Srinivasan
2003	J	`jnl`	On the approximability of clique and related maximization problems. J. Comput. Syst. Sci. Aravind Srinivasan
2003	A*	`conf`	Resilient multicast using overlays. SIGMETRICS Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan
2003	J	`jnl`	Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry. J. Graph Algorithms Appl. Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist
2003	J	`jnl`	When does a random Robin Hood win? Theor. Comput. Sci. William I. Gasarch, Evan Golub, Aravind Srinivasan
2002	J	`jnl`	Approximating the Domatic Number. SIAM J. Comput. Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan
2002	J	`jnl`	Approximation algorithms for the covering Steiner problem. Random Struct. Algorithms Goran Konjevod, R. Ravi, Aravind Srinivasan
2002	A*	`conf`	Clustering and Server Selection using Passive Monitoring. INFOCOM Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane
2002	A*	`conf`	Dependent Rounding in Bipartite Graphs. FOCS Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan
2002	—	`conf`	Improved Approximation Algorithms for the Partial Vertex Cover Problem. APPROX Eran Halperin, Aravind Srinivasan
2002	—	`conf`	P5: A Protocol for Scalable Anonymous Communication. S&P Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan
2002	J	`jnl`	Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan
2001	A*	`conf`	Approximation Algorithms for Partial Covering Problems. ICALP Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
2001	J	`jnl`	Better Approximation Guarantees for Job-Shop Scheduling. SIAM J. Discret. Math. Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk
2001	A*	`conf`	Distributions on Level-Sets with Applications to Approximation Algorithms. FOCS Aravind Srinivasan
2001	A*	`conf`	Domatic partitions and the Lovász local lemma. SODA Aravind Srinivasan
2001	B	`conf`	Efficient algorithms for location and sizing problems in network design. GLOBECOM Krishnan Kumaran, Aravind Srinivasan, Qiong Wang, Steven Lanning, K. G. Ramakrishnan
2001	—	`conf`	Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. WAE Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist
2001	B	`conf`	Finding large independent sets of hypergraphs in parallel. SPAA Hadas Shachnai, Aravind Srinivasan
2001	J	`jnl`	Improved Bounds on the Sample Complexity of Learning. J. Comput. Syst. Sci. Yi Li, Philip M. Long, Aravind Srinivasan
2001	J	`jnl`	New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SIAM J. Comput. Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan
2001	A*	`conf`	New approaches to covering and packing problems. SODA Aravind Srinivasan
2001	J	`jnl`	The one-inclusion graph algorithm is near-optimal for the prediction model of learning. IEEE Trans. Inf. Theory Yi Li, Philip M. Long, Aravind Srinivasan
2000	J	`jnl`	A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria. SIAM J. Comput. Aravind Srinivasan, Chung-Piaw Teo
2000	J	`jnl`	Approximating Hyper-Rectangles: Learning and Pseudo-random Sets Electron. Colloquium Comput. Complex. Peter Auer, Philip M. Long, Aravind Srinivasan
2000	J	`jnl`	Approximating low-congestion routing and column-restricted packing problems. Inf. Process. Lett. Alok Baveja, Aravind Srinivasan
2000	J	`jnl`	Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Math. Oper. Res. Alok Baveja, Aravind Srinivasan
2000	J	`jnl`	Contention resolution with constant expected delay. J. ACM Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan
2000	J	`jnl`	Improved Algorithms via Approximations of Probability Distributions. J. Comput. Syst. Sci. Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
2000	J	`jnl`	Improved bounds and algorithms for hypergraph 2-coloring. Random Struct. Algorithms Jaikumar Radhakrishnan, Aravind Srinivasan
2000	A*	`conf`	Improved bounds on the sample complexity of learning. SODA Yi Li, Philip M. Long, Aravind Srinivasan
2000	J	`jnl`	Low discrepancy sets yield approximate min-wise independent permutation families. Inf. Process. Lett. Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
2000	A*	`conf`	Optimal Design of Signaling Networks for Internet Telephony. INFOCOM Aravind Srinivasan, K. G. Ramakrishnan, Krishnan Kumaran, Murali Aravamudan, Shamim A. Naqvi
2000	J	`jnl`	Retrieval Scheduling for Collaborative Multimedia Presentations. Multim. Syst. Ping Bai, B. Prabhakaran, Aravind Srinivasan
2000	A*	`conf`	The value of strong inapproximability results for clique. STOC Aravind Srinivasan
2000	—	`conf`	Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan
1999	A*	`conf`	Application-layer broker for scalable Internet services with resource reservation. ACM Multimedia (2) Ping Bai, B. Prabhakaran, Aravind Srinivasan
1999	J	`jnl`	Computing with Very Weak Random Sources. SIAM J. Comput. Aravind Srinivasan, David Zuckerman
1999	J	`jnl`	Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM J. Comput. Aravind Srinivasan
1999	—	`conf`	Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families. RANDOM-APPROX Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
1999	A*	`conf`	New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SODA Frank Thomson Leighton, Satish Rao, Aravind Srinivasan
1998	J	`jnl`	Approximating Hyper-Rectangles: Learning and Pseudorandom Sets. J. Comput. Syst. Sci. Peter Auer, Philip M. Long, Aravind Srinivasan
1998	J	`jnl`	Explicit OR-Dispersers with Polylogarithmic Degree. J. ACM Michael E. Saks, Aravind Srinivasan, Shiyu Zhou
1998	A*	`conf`	Improved Bounds and Algorithms for Hypergraph Two-Coloring. FOCS Jaikumar Radhakrishnan, Aravind Srinivasan
1998	A*	`conf`	Low-Bandwidth Routing and Electrical Power Networks. ICALP Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann
1998	—	`conf`	Multicommodity Flow and Circuit Switching. HICSS (7) Tom Leighton, Satish Rao, Aravind Srinivasan
1997	A*	`conf`	A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria. STOC Aravind Srinivasan, Chung-Piaw Teo
1997	—	`conf`	A survey of the role of multicommodity flow and randomization in network design and routing. Randomization Methods in Algorithm Design Aravind Srinivasan
1997	A*	`conf`	Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets. STOC Peter Auer, Philip M. Long, Aravind Srinivasan
1997	A*	`conf`	Better Approximation Guarantees for Job-shop Scheduling. SODA Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk
1997	A*	`conf`	Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems. FOCS Aravind Srinivasan
1997	J	`jnl`	Improved Parallel Approximation of a Class of Integer Programming Problems. Algorithmica Noga Alon, Aravind Srinivasan
1997	A*	`conf`	Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems. SODA Aravind Srinivasan
1997	C	`conf`	Mechanism design for intellectual property rights protection. ICIS P. S. Giridharan, Aravind Srinivasan
1997	J	`jnl`	Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds. SIAM J. Comput. Alessandro Panconesi, Aravind Srinivasan
1996	A*	`conf`	An Extension of the Lovász Local Lemma, and its Applications to Integer Programming. SODA Aravind Srinivasan
1996	A*	`conf`	Improved Parallel Approximation of a Class of Integer Programming Programming Problems. ICALP Noga Alon, Aravind Srinivasan
1996	J	`jnl`	On the Complexity of Distributed Network Decomposition. J. Algorithms Alessandro Panconesi, Aravind Srinivasan
1995	J	`jnl`	Chernoff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discret. Math. Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
1995	A*	`conf`	Contention Resolution with Bounded Delay. FOCS Mike Paterson, Aravind Srinivasan
1995	A*	`conf`	Explicit dispersers with polylog degree. STOC Michael E. Saks, Aravind Srinivasan, Shiyu Zhou
1995	A*	`conf`	Improved approximations of packing and covering problems. STOC Aravind Srinivasan
1995	J	`jnl`	Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems. SIAM J. Comput. Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
1995	A*	`conf`	Splitters and Near-Optimal Derandomization. FOCS Moni Naor, Leonard J. Schulman, Aravind Srinivasan
1995	J	`jnl`	The Local Natur of Delta-Coloring and its Algorithmic Applications. Comb. Alessandro Panconesi, Aravind Srinivasan
1994	A*	`conf`	Computing with Very Weak Random Sources FOCS Aravind Srinivasan, David Zuckerman
1994	A*	`conf`	Improved algorithms via approximations of probability distributions (extended abstract). STOC Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
1993	A*	`conf`	Chernoff-Hoeffding Bounds for Applications with Limited Independence. SODA Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
1993	A*	`conf`	Randomness-optimal unique element isolation, with applications to perfect matching and related problems. STOC Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
1993	—	`—`	Techniques for Probabilistic Analysis and Randomness-Efficient Computation. Aravind Srinivasan
1992	A*	`conf`	Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract). PODC Alessandro Panconesi, Aravind Srinivasan
1992	A*	`conf`	Improved Distributed Algorithms for Coloring and Network Decomposition Problems STOC Alessandro Panconesi, Aravind Srinivasan
1991	J	`jnl`	Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs. Theor. Comput. Sci. Aravind Srinivasan, C. Pandu Rangan
1991	J	`jnl`	On Finding the Minimum Bandwidth of Interval Graphs Inf. Comput. R. Mahesh, C. Pandu Rangan, Aravind Srinivasan