Aravind Srinivasan
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
107
Venues
33
Active years
1992–2026
Best venue rank
A*
Where they publish
- A*SODA22 papers
- A*STOC10 papers
- A*FOCS10 papers
- A*AAAI7 papers
- A*ICALP7 papers
- A*INFOCOM7 papers
- AAISTATS5 papers
- A*IJCAI3 papers
- A*KDD3 papers
- A*WWW2 papers
- CWABI2 papers
- A*ICML2 papers
- AESA2 papers
- BSPAA2 papers
- BMOBIHOC2 papers
- BIPCO2 papers
- A*PODC2 papers
- A*SIGMETRICS2 papers
- CAIES1 paper
- BWiOpt1 paper
- BSECON1 paper
- NationalCOMSNETS1 paper
- BICNP1 paper
- A*MOBICOM1 paper
- NationalHCI1 paper
- NationalHiPC1 paper
- BCEC1 paper
- AGECCO1 paper
- BISAAC1 paper
- BNOSSDAV1 paper
- A*SP1 paper
- BGLOBECOM1 paper
- CICIS1 paper
Papers
107 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | WWW | Barter Exchange with Asymmetric Item Valuations. | Juan Luque, Sharmila Duppala, Michael J. Curry, John P. Dickerson, Aravind Srinivasan |
| 2026 | WABI | Exact and Efficient Inference of Tumor Phylogenies via Novel Pruning Techniques. | Juan Luque, Jacob Gilbert, Arjun Subramanian, Aravind Srinivasan, Salem Malikic, S. Cenk Sahinalp |
| 2025 | AAAI | Proportionally Fair Matching via Randomized Rounding. | Sharmila Duppala, Nathaniel Grammel, Juan Luque, Calum MacRury, Aravind Srinivasan |
| 2025 | SODA | Online Dependent Rounding Schemes for Bipartite Matchings, with. | Joseph (Seffi) Naor, Aravind Srinivasan, David Wajc |
| 2024 | ICML | Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation. | Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu |
| 2024 | WWW | Barter Exchange with Shared Item Valuations. | Juan Luque, Sharmila Duppala, John P. Dickerson, Aravind Srinivasan |
| 2023 | AAAI | Rawlsian Fairness in Online Bipartite Matching: Two-Sided, Group, and Individual. | Seyed A. Esmaeili, Sharmila Duppala, Davidson Cheng, Vedant Nanda, Aravind Srinivasan, John P. Dickerson |
| 2023 | IJCAI | Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers. | Da Qi Chen, Ann Li, George Z. Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti |
| 2023 | IJCAI | Group Fairness in Set Packing Problems. | Sharmila Duppala, Juan Luque, John P. Dickerson, Aravind Srinivasan |
| 2023 | KDD | Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting. | Christine Herlihy, Aviva Prins, Aravind Srinivasan, John P. Dickerson |
| 2023 | SODA | Improved Bi-point Rounding Algorithms and a Golden Barrier for | Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh |
| 2022 | AISTATS | Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. | Amy E. Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti |
| 2022 | AISTATS | A New Notion of Individually Fair Clustering: α-Equitable k-Center. | Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas |
| 2022 | AISTATS | Fair Disaster Containment via Graph-Cut Problems. | Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti |
| 2022 | IJCAI | Forecasting Patient Outcomes in Kidney Exchange. | Naveen Durvasula, Aravind Srinivasan, John P. Dickerson |
| 2022 | KDD | Effective Social Network-Based Allocation of COVID-19 Vaccines. | 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 |
| 2021 | AAAI | Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. | Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas |
| 2021 | AISTATS | Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. | Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan |
| 2020 | AAAI | Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. | Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan |
| 2020 | AIES | Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. | Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan |
| 2020 | AISTATS | Dependent randomized rounding for clustering and partition systems with knapsack constraints. | David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh |
| 2020 | ICML | A Pairwise Fair and Community-preserving Approach to k-Center Clustering. | Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas |
| 2019 | AAAI | Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. | John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu |
| 2019 | AAAI | A Unified Approach to Online Matching with Conflict-Aware Constraints. | Pan Xu, Yexuan Shi, Hao Cheng, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yongxin Tong, Leonidas Tsepenekas |
| 2018 | AAAI | Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources. | John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu |
| 2018 | SODA | Algorithms to Approximate Column-Sparse Packing Problems. | Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu |
| 2018 | WiOpt | Hierarchical scheduling algorithms with throughput guarantees and low delay. | Peruru Subrahmanya Swamy, Aravind Srinivasan, Radha Krishna Ganti, Krishna P. Jagannathan |
| 2017 | WABI | Better Greedy Sequence Clustering with Fast Banded Alignment. | Brian Brubach, Jay Ghurye, Mihai Pop, Aravind Srinivasan |
| 2016 | ESA | New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. | Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu |
| 2016 | SODA | Partial Resampling to Approximate Covering Integer Programs. | Antares Chen, David G. Harris, Aravind Srinivasan |
| 2016 | SODA | Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. | David G. Harris, Aravind Srinivasan |
| 2016 | STOC | Lift-and-round to improve weighted completion time on unrelated machines. | Nikhil Bansal, Aravind Srinivasan, Ola Svensson |
| 2015 | ESA | An Improved Approximation Algorithm for Knapsack Median Using Sparsification. | Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh |
| 2015 | SODA | An Improved Approximation for | Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh |
| 2014 | KDD | 'Beating the news' with EMBERS: forecasting civil unrest using open source indicators. | 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 | SODA | Improved bounds and algorithms for graph cuts and network reliability. | David G. Harris, Aravind Srinivasan |
| 2014 | SODA | A constructive algorithm for the Lovsz Local Lemma on permutations. | David G. Harris, Aravind Srinivasan |
| 2014 | SPAA | On computing maximal independent sets of hypergraphs in parallel. | Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan |
| 2013 | FOCS | The Moser-Tardos Framework with Partial Resampling. | David G. Harris, Aravind Srinivasan |
| 2013 | ICALP | Efficient Computation of Balanced Structures. | David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan |
| 2013 | STOC | Constraint satisfaction, packet routing, and the lovasz local lemma. | David G. Harris, Aravind Srinivasan |
| 2013 | SECON | Enabling energy-aware collaborative mobile data offloading for smartphones. | Aaron Yi Ding, Bo Han, Yu Xiao, Pan Hui, Aravind Srinivasan, Markku Kojo, Sasu Tarkoma |
| 2012 | COMSNETS | Networking lessons: From computers to water. | Iyswarya Narayanan, Venkatesh Sarangan, Arunchandar Vasan, Aravind Srinivasan, Anand Sivasubramaniam |
| 2012 | ICNP | eDiscovery: Energy efficient device discovery for mobile opportunistic communications. | Bo Han, Aravind Srinivasan |
| 2012 | MOBIHOC | Your friends have more friends than you do: identifying influential mobile users through random walks. | Bo Han, Aravind Srinivasan |
| 2011 | INFOCOM | Approximation algorithms for throughput maximization in wireless networks with delay constraints. | Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthasarathy, Aravind Srinivasan |
| 2010 | FOCS | New Constructive Aspects of the Lovasz Local Lemma. | Bernhard Haeupler, Barna Saha, Aravind Srinivasan |
| 2010 | IPCO | On | Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan |
| 2010 | IPCO | Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. | Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy |
| 2010 | MOBICOM | Cellular traffic offloading through opportunistic communications: a case study. | Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marathe, Guanhong Pei, Aravind Srinivasan |
| 2009 | ICALP | Maximum Bipartite Flow in Networks with Adaptive Channel Width. | Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan |
| 2009 | INFOCOM | Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. | Bo Han, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan |
| 2008 | ICALP | The Randomized Coloring Procedure with Symmetry-Breaking. | Sriram V. Pemmaraju, Aravind Srinivasan |
| 2008 | INFOCOM | Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. | Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan |
| 2008 | INFOCOM | Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. | Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan |
| 2008 | SODA | Improved algorithmic versions of the Lovsz Local Lemma. | Aravind Srinivasan |
| 2007 | HCI | INT-MANUS: Interactive Production Control in a Distributed Environment. | Thomas Schlegel, Aravind Srinivasan, Maxim Foursa, Manfred Bogen, Rejin Narayanan, David d'Angelo, Gza Haidegger, Istvn Mezgr, Joseph Canou, Damien Sall, Fabrizio Meo, Jon Agirre Ibarbia, Anja Herrmann Praturlon |
| 2007 | HiPC | Distributed Ranked Search. | Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhattacharjee, Peter J. Keleher, Aravind Srinivasan |
| 2007 | MOBIHOC | Cross-layer latency minimization in wireless networks with SINR constraints. | Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan |
| 2007 | SODA | Approximation algorithms for stochastic and risk-averse optimization. | Aravind Srinivasan |
| 2006 | CEC | A Population-Based, Parent Centric Procedure for Constrained Real-Parameter Optimization. | Ankur Sinha, Aravind Srinivasan, Kalyanmoy Deb |
| 2006 | GECCO | Innovization: innovating design principles through optimization. | Kalyanmoy Deb, Aravind Srinivasan |
| 2006 | INFOCOM | A Client-Driven Approach for Channel Management in Wireless LANs. | Arunesh Mishra, Vladimir Brik, Suman Banerjee, Aravind Srinivasan, William A. Arbaugh |
| 2006 | ISAAC | Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
| 2005 | FOCS | Approximation Algorithms for Scheduling on Multiple Machines. | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan |
| 2005 | PODC | Efficient lookup on unstructured topologies. | Ruggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh |
| 2005 | SIGMETRICS | Algorithmic aspects of capacity in wireless networks. | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan |
| 2004 | NOSSDAV | Scalable resilient media streaming. | Suman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind Srinivasan |
| 2004 | SODA | Structural and algorithmic aspects of massive social networks. | Stephen G. Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang |
| 2004 | SODA | End-to-end packet-scheduling in wireless ad-hoc networks. | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan |
| 2003 | ICALP | An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan |
| 2003 | SODA | Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. | Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan |
| 2003 | SODA | Integrality ratio for group Steiner trees and directed steiner trees. | Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang |
| 2003 | SIGMETRICS | Resilient multicast using overlays. | Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan |
| 2002 | FOCS | Dependent Rounding in Bipartite Graphs. | Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan |
| 2002 | INFOCOM | Clustering and Server Selection using Passive Monitoring. | Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane |
| 2002 | SP | P5: A Protocol for Scalable Anonymous Communication. | Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan |
| 2001 | FOCS | Distributions on Level-Sets with Applications to Approximation Algorithms. | Aravind Srinivasan |
| 2001 | GLOBECOM | Efficient algorithms for location and sizing problems in network design. | Krishnan Kumaran, Aravind Srinivasan, Qiong Wang, Steven Lanning, K. G. Ramakrishnan |
| 2001 | ICALP | Approximation Algorithms for Partial Covering Problems. | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan |
| 2001 | SODA | New approaches to covering and packing problems. | Aravind Srinivasan |
| 2001 | SODA | Domatic partitions and the Lovsz local lemma. | Aravind Srinivasan |
| 2001 | SPAA | Finding large independent sets of hypergraphs in parallel. | Hadas Shachnai, Aravind Srinivasan |
| 2000 | INFOCOM | Optimal Design of Signaling Networks for Internet Telephony. | Aravind Srinivasan, K. G. Ramakrishnan, Krishnan Kumaran, Murali Aravamudan, Shamim A. Naqvi |
| 2000 | SODA | Improved bounds on the sample complexity of learning. | Yi Li, Philip M. Long, Aravind Srinivasan |
| 2000 | STOC | The value of strong inapproximability results for clique. | Aravind Srinivasan |
| 1999 | SODA | New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. | Frank Thomson Leighton, Satish Rao, Aravind Srinivasan |
| 1998 | FOCS | Improved Bounds and Algorithms for Hypergraph Two-Coloring. | Jaikumar Radhakrishnan, Aravind Srinivasan |
| 1998 | ICALP | Low-Bandwidth Routing and Electrical Power Networks. | Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann |
| 1997 | FOCS | Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems. | Aravind Srinivasan |
| 1997 | ICIS | Mechanism design for intellectual property rights protection. | P. S. Giridharan, Aravind Srinivasan |
| 1997 | SODA | Better Approximation Guarantees for Job-shop Scheduling. | Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk |
| 1997 | SODA | Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems. | Aravind Srinivasan |
| 1997 | STOC | Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets. | Peter Auer, Philip M. Long, Aravind Srinivasan |
| 1997 | STOC | A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria. | Aravind Srinivasan, Chung-Piaw Teo |
| 1996 | ICALP | Improved Parallel Approximation of a Class of Integer Programming Programming Problems. | Noga Alon, Aravind Srinivasan |
| 1996 | SODA | An Extension of the Lovsz Local Lemma, and its Applications to Integer Programming. | Aravind Srinivasan |
| 1995 | FOCS | Splitters and Near-Optimal Derandomization. | Moni Naor, Leonard J. Schulman, Aravind Srinivasan |
| 1995 | FOCS | Contention Resolution with Bounded Delay. | Mike Paterson, Aravind Srinivasan |
| 1995 | STOC | Explicit dispersers with polylog degree. | Michael E. Saks, Aravind Srinivasan, Shiyu Zhou |
| 1995 | STOC | Improved approximations of packing and covering problems. | Aravind Srinivasan |
| 1994 | FOCS | Computing with Very Weak Random Sources | Aravind Srinivasan, David Zuckerman |
| 1994 | STOC | Improved algorithms via approximations of probability distributions (extended abstract). | Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan |
| 1993 | SODA | Chernoff-Hoeffding Bounds for Applications with Limited Independence. | Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan |
| 1993 | STOC | Randomness-optimal unique element isolation, with applications to perfect matching and related problems. | Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan |
| 1992 | PODC | Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract). | Alessandro Panconesi, Aravind Srinivasan |
| 1992 | STOC | Improved Distributed Algorithms for Coloring and Network Decomposition Problems | Alessandro Panconesi, Aravind Srinivasan |