| 2026 | ESA | Adaptive Sampling for Minimum-Norm k-Clustering. | Haripriya Pulyassary, Chaitanya Swamy |
| 2026 | IPCO | Stochastic Load Balancing with Machine Reservations. | David Alemn Espinosa, Naveen Garg, Sharat Ibrahimpur, Neil Olver, Chaitanya Swamy |
| 2025 | AAAI | Constant-Factor Distortion Mechanisms for k-Committee Election. | Haripriya Pulyassary, Chaitanya Swamy |
| 2025 | ESA | Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique. | Nikhil Kumar, J. J. Nan, Chaitanya Swamy |
| 2025 | FOCS | Almost Tight Additive Guarantees for k-Edge-Connectivity. | Nikhil Kumar, Chaitanya Swamy |
| 2022 | IPCO | Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. | Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy |
| 2021 | ICALP | Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. | Zachary Friggstad, Chaitanya Swamy |
| 2021 | ICALP | Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. | Sharat Ibrahimpur, Chaitanya Swamy |
| 2020 | ESA | A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. | Zachary Friggstad, Chaitanya Swamy |
| 2020 | FOCS | Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization. | Sharat Ibrahimpur, Chaitanya Swamy |
| 2019 | ESA | Simpler and Better Algorithms for Minimum-Norm Load Balancing. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2019 | IPCO | Approximate Multi-matroid Intersection via Iterative Refinement. | Andr Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen |
| 2019 | STOC | Approximation algorithms for minimum norm and ordered optimization problems. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2019 | STOC | Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. | Andr Linhares, Chaitanya Swamy |
| 2018 | ESA | Algorithms for Inverse Optimization Problems. | Sara Ahmadian, Umang Bhaskar, Laura Sanit, Chaitanya Swamy |
| 2018 | ICALP | Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2018 | WWW | Minimizing Latency in Online Ride and Delivery Services. | Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy |
| 2018 | WSDM | Orienteering Algorithms for Generating Travel Itineraries. | Zachary Friggstad, Sreenivas Gollapudi, Kostas Kollias, Tams Sarls, Chaitanya Swamy, Andrew Tomkins |
| 2017 | ICALP | Improved Algorithms for MST and Metric-TSP Interdiction. | Andr Linhares, Chaitanya Swamy |
| 2017 | IPCO | Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. | Zachary Friggstad, Chaitanya Swamy |
| 2017 | IPCO | Min-Max Theorems for Packing and Covering Odd (u, v)-trails. | Sharat Ibrahimpur, Chaitanya Swamy |
| 2016 | ICALP | Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. | Sara Ahmadian, Chaitanya Swamy |
| 2016 | IPCO | Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. | Andr Linhares, Chaitanya Swamy |
| 2015 | SODA | Improved Region-Growing and Combinatorial Algorithms for | Guru Guruganesh, Laura Sanit, Chaitanya Swamy |
| 2015 | SODA | Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract). | Ian Post, Chaitanya Swamy |
| 2015 | STOC | Learning Arbitrary Statistical Mixtures of Discrete Distributions. | Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
| 2014 | FOCS | Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. | Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy |
| 2014 | STOC | Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. | Zachary Friggstad, Chaitanya Swamy |
| 2013 | SODA | Local-Search based Approximation Algorithms for Mobile Facility Location Problems. | Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy |
| 2012 | SODA | Black-box reductions for cost-sharing mechanism design. | Konstantinos Georgiou, Chaitanya Swamy |
| 2012 | WAOA | Improved Approximation Guarantees for Lower-Bounded Facility Location. | Sara Ahmadian, Chaitanya Swamy |
| 2011 | IPCO | Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2011 | SODA | Risk-Averse Stochastic Optimization: Probabilistically-Constrained Models and Algorithms for Black-Box Distributions. | Chaitanya Swamy |
| 2010 | IPCO | Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. | Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy |
| 2009 | ISAAC | Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy |
| 2008 | FOCS | Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply. | Maurice Cheung, Chaitanya Swamy |
| 2008 | SODA | Approximation algorithms for labeling hierarchical taxonomies. | Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
| 2007 | SODA | Approximation algorithms for prize collecting forest problems with submodular penalty functions. | Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson |
| 2007 | SODA | The effectiveness of Stackelberg strategies and tolls for network congestion games. | Chaitanya Swamy |
| 2006 | FOCS | The Effectiveness of Lloyd-Type Methods for the k-Means Problem. | Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
| 2005 | FOCS | Truthful and Near-Optimal Mechanism Design via Linear Programming. | Ron Lavi, Chaitanya Swamy |
| 2005 | FOCS | Sampling-based Approximation Algorithms for Multi-stage Stochastic. | Chaitanya Swamy, David B. Shmoys |
| 2005 | SODA | Network design for information networks. | Ara Hayrapetyan, Chaitanya Swamy, va Tardos |
| 2004 | FOCS | Optimal Power-Down Strategies. | John Augustine, Sandy Irani, Chaitanya Swamy |
| 2004 | FOCS | Stochastic Optimization is (Almost) as easy as Deterministic Optimization. | David B. Shmoys, Chaitanya Swamy |
| 2004 | IPCO | LP-based Approximation Algorithms for Capacitated Facility Location. | Retsef Levi, David B. Shmoys, Chaitanya Swamy |
| 2004 | SODA | Facility location with Service Installation Costs. | David B. Shmoys, Chaitanya Swamy, Retsef Levi |
| 2004 | SODA | Correlation Clustering: maximizing agreements via semidefinite programming. | Chaitanya Swamy |
| 2003 | SODA | Fault-tolerant facility location. | Chaitanya Swamy, David B. Shmoys |