A Randomized Algorithm for Flow Shop Scheduling. - Naveen Garg 001; Sachin Jain; Chaitanya Swamy (FSTTCS, 1999)

Stochastic Optimization is (Almost) as easy as Deterministic Optimization. - David B. Shmoys; Chaitanya Swamy (FOCS, 2004)

Facility location with Service Installation Costs. - David B. Shmoys; Chaitanya Swamy; Retsef Levi (SODA, 2004)

Correlation Clustering: maximizing agreements via semidefinite programming. - Chaitanya Swamy (SODA, 2004)

Primal-Dual Algorithms for Connected Facility Location Problems. - Chaitanya Swamy; Amit Kumar 001 (Algorithmica, 2004)

Approximation Algorithms for Clustering Problems. - Chaitanya Swamy (2004)

Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. - Chaitanya Swamy; David B. Shmoys (Algorithms for Optimization with Incomplete Information, 2005)

Sampling-based Approximation Algorithms for Multi-stage Stochastic. - Chaitanya Swamy; David B. Shmoys (FOCS, 2005)

Network design for information networks. - Ara Hayrapetyan; Chaitanya Swamy; Éva Tardos (SODA, 2005)

Approximation Algorithms for Graph Homomorphism Problems. - Michael Langberg; Yuval Rabani; Chaitanya Swamy (APPROX-RANDOM, 2006)

An approximation scheme for stochastic linear programming and its application to stochastic integer programs. - David B. Shmoys; Chaitanya Swamy (J. ACM, 2006)

Approximation algorithms for 2-stage stochastic optimization problems. - Chaitanya Swamy; David B. Shmoys (SIGACT News, 2006)

Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. - Chaitanya Swamy; David B. Shmoys (Probabilistic Methods in the Design and Analysis of Algorithms, 2007)

Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. - Ron Lavi; Chaitanya Swamy (EC, 2007)

Approximation algorithms for prize collecting forest problems with submodular penalty functions. - Yogeshwer Sharma; Chaitanya Swamy; David P. Williamson (SODA, 2007)

Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply. - Maurice Cheung; Chaitanya Swamy (FOCS, 2008)

Approximation algorithms for labeling hierarchical taxonomies. - Yuval Rabani; Leonard J. Schulman; Chaitanya Swamy (SODA, 2008)

Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions - Chaitanya Swamy (CoRR, 2008)

Optimal Power-Down Strategies. - John Augustine; Sandy Irani; Chaitanya Swamy (SIAM J. Comput., 2008)

Approximation Algorithms for Data Placement Problems. - Ivan D. Baev; Rajmohan Rajaraman; Chaitanya Swamy (SIAM J. Comput., 2008)

Fault-tolerant facility location. - Chaitanya Swamy; David B. Shmoys (ACM Trans. Algorithms, 2008)

Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. - Elliot Anshelevich; Deeparnab Chakrabarty; Ameya Hate; Chaitanya Swamy (ISAAC, 2009)

Truthful mechanism design for multidimensional scheduling via cycle monotonicity. - Ron Lavi; Chaitanya Swamy (Games Econ. Behav., 2009)

Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. - Jaroslaw Byrka; Aravind Srinivasan; Chaitanya Swamy (IPCO, 2010)

Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply. - Khaled M. Elbassioni; Mahmoud Fouz; Chaitanya Swamy (WINE, 2010)

Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. - Deeparnab Chakrabarty; Chaitanya Swamy (IPCO, 2011)

Risk-Averse Stochastic Optimization: Probabilistically-Constrained Models and Algorithms for Black-Box Distributions. - Chaitanya Swamy (SODA, 2011)

Truthful and Near-Optimal Mechanism Design via Linear Programming. - Ron Lavi; Chaitanya Swamy (J. ACM, 2011)

Improved Approximation Guarantees for Lower-Bounded Facility Location. - Sara Ahmadian; Chaitanya Swamy (WAOA, 2012)

Truthful Mechanism Design for Multidimensional Covering Problems. - Hadi Minooei; Chaitanya Swamy (WINE, 2012)

Approximability of the Firefighter Problem - Computing Cuts over Time. - Elliot Anshelevich; Deeparnab Chakrabarty; Ameya Hate; Chaitanya Swamy (Algorithmica, 2012)

The effectiveness of lloyd-type methods for the k-means problem. - Rafail Ostrovsky; Yuval Rabani; Leonard J. Schulman; Chaitanya Swamy (J. ACM, 2012)

LP-based approximation algorithms for capacitated facility location. - Retsef Levi; David B. Shmoys; Chaitanya Swamy (Math. Program., 2012)

Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization. - Chaitanya Swamy; David B. Shmoys (SIAM J. Comput., 2012)

The effectiveness of stackelberg strategies and tolls for network congestion games. - Chaitanya Swamy (ACM Trans. Algorithms, 2012)

Local-Search based Approximation Algorithms for Mobile Facility Location Problems. - Sara Ahmadian; Zachary Friggstad; Chaitanya Swamy (SODA, 2013)

Approximation Algorithms for Minimum-Load k-Facility Location. - Sara Ahmadian; Babak Behsaz; Zachary Friggstad; Amin Jorati; Mohammad R. Salavatipour; Chaitanya Swamy (APPROX-RANDOM, 2014)

Welfare maximization and truthfulness in mechanism design with ordinal preferences. - Deeparnab Chakrabarty; Chaitanya Swamy (ITCS, 2014)

Learning mixtures of arbitrary distributions over large discrete domains. - Yuval Rabani; Leonard J. Schulman; Chaitanya Swamy (ITCS, 2014)

Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. - Zachary Friggstad; Chaitanya Swamy (STOC, 2014)

Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems. - Guru Guruganesh; Laura Sanità; Chaitanya Swamy (CoRR, 2014)

Linear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems. - Ian Post; Chaitanya Swamy (CoRR, 2014)

Improved Region-Growing and Combinatorial Algorithms for k-Route Cut Problems (Extended Abstract). - Guru Guruganesh; Laura Sanità; Chaitanya Swamy (SODA, 2015)

Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract). - Ian Post; Chaitanya Swamy (SODA, 2015)

Learning Arbitrary Statistical Mixtures of Discrete Distributions. - Jian Li 015; Yuval Rabani; Leonard J. Schulman; Chaitanya Swamy (STOC, 2015)

Computing Optimal Tolls in Routing Games without Knowing the Latency Functions. - Siddharth Barman; Umang Bhaskar; Chaitanya Swamy (CoRR, 2015)

Near-Optimal Hardness Results for Signaling in Bayesian Games. - Umang Bhaskar; Yu Cheng 002; Young Kun-Ko; Chaitanya Swamy (CoRR, 2015)

Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players. - Hadi Minooei; Chaitanya Swamy (ACM Trans. Economics and Comput., 2015)

Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. - Sara Ahmadian; Chaitanya Swamy (ICALP, 2016)

Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games. - Umang Bhaskar; Yu Cheng 002; Young Kun-Ko; Chaitanya Swamy (EC, 2016)

Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems. - Deeparnab Chakrabarty; Chaitanya Swamy (Math. Oper. Res., 2016)

Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications. - Chaitanya Swamy (ACM Trans. Algorithms, 2016)

On the Integrality Gap of the Prize-Collecting Steiner Forest LP. - Jochen Könemann; Neil Olver; Kanstantsin Pashkovich; R. Ravi 001; Chaitanya Swamy; Jens Vygen (APPROX-RANDOM, 2017)

Improved Algorithms for MST and Metric-TSP Interdiction. - André Linhares; Chaitanya Swamy (ICALP, 2017)

Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. - Zachary Friggstad; Chaitanya Swamy (IPCO, 2017)

Min-Max Theorems for Packing and Covering Odd (u, v)-trails. - Sharat Ibrahimpur; Chaitanya Swamy (IPCO, 2017)

Algorithms for Inverse Optimization Problems. - Sara Ahmadian; Umang Bhaskar; Laura Sanità; Chaitanya Swamy (ESA, 2018)

Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. - Deeparnab Chakrabarty; Chaitanya Swamy (ICALP, 2018)

Orienteering Algorithms for Generating Travel Itineraries. - Zachary Friggstad; Sreenivas Gollapudi; Kostas Kollias; Tamás Sarlós; Chaitanya Swamy; Andrew Tomkins (WSDM, 2018)

Minimizing Latency in Online Ride and Delivery Services. - Abhimanyu Das; Sreenivas Gollapudi; Anthony Kim; Debmalya Panigrahi; Chaitanya Swamy (WWW, 2018)

Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. - André Linhares; Chaitanya Swamy (Math. Program., 2018)

Approximation Algorithms for Minimum-Load k-Facility Location. - Sara Ahmadian; Babak Behsaz; Zachary Friggstad; Amin Jorati; Mohammad R. Salavatipour; Chaitanya Swamy (ACM Trans. Algorithms, 2018)

Simpler and Better Algorithms for Minimum-Norm Load Balancing. - Deeparnab Chakrabarty; Chaitanya Swamy (ESA, 2019)

Approximation algorithms for minimum norm and ordered optimization problems. - Deeparnab Chakrabarty; Chaitanya Swamy (STOC, 2019)

Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. - André Linhares; Chaitanya Swamy (STOC, 2019)

Achieving target equilibria in network routing games without knowing the latency functions. - Umang Bhaskar; Katrina Ligett; Leonard J. Schulman; Chaitanya Swamy (Games Econ. Behav., 2019)

Black-box reductions for cost-sharing mechanism design. - Konstantinos Georgiou; Chaitanya Swamy (Games Econ. Behav., 2019)

Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization. - Sharat Ibrahimpur; Chaitanya Swamy (FOCS, 2020)

Approximate multi-matroid intersection via iterative refinement. - André Linhares; Neil Olver; Chaitanya Swamy; Rico Zenklusen (Math. Program., 2020)

Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017). - Valentine Kabanets; Sofya Raskhodnikova; Chaitanya Swamy (SIAM J. Comput., 2020)

Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. - Zachary Friggstad; Chaitanya Swamy (ICALP, 2021)

Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. - Sharat Ibrahimpur; Chaitanya Swamy (ICALP, 2021)

On the Randomized Metric Distortion Conjecture. - Haripriya Pulyassary; Chaitanya Swamy (CoRR, 2021)

Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. - Sina Dezfuli; Zachary Friggstad; Ian Post; Chaitanya Swamy (IPCO, 2022)

A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. - Sharat Ibrahimpur; Chaitanya Swamy (SOSA, 2022)

A constant-factor approximation for directed latency in quasi-polynomial time. - Zachary Friggstad; Chaitanya Swamy (J. Comput. Syst. Sci., 2022)

Approximation Algorithms for Correlated Knapsack Orienteering. - David Alemán Espinosa; Chaitanya Swamy (APPROX/RANDOM, 2024)

Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints. - Rian Neogi; Kanstantsin Pashkovich; Chaitanya Swamy (ITCS, 2024)

Constant-Factor Distortion Mechanisms for k-Committee Election. - Haripriya Pulyassary; Chaitanya Swamy (AAAI, 2025)

An O(log log n)-approximate budget feasible mechanism for subadditive valuations. - Rian Neogi; Kanstantsin Pashkovich; Chaitanya Swamy (EC, 2025)

Constant-Factor Distortion Mechanisms for k-Committee Election. - Haripriya Pulyassary; Chaitanya Swamy (CoRR, 2025)

An O(log log n)-approximate budget feasible mechanism for subadditive valuations. - Rian Neogi; Kanstantsin Pashkovich; Chaitanya Swamy (CoRR, 2025)

Almost Tight Additive Guarantees for k-Edge-Connectivity. - Nikhil Kumar; Chaitanya Swamy (CoRR, 2025)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique. - Nikhil Kumar; JJ Nan; Chaitanya Swamy (CoRR, 2025)

Multidimensional Budget-Feasible Mechanism Design. - Rian Neogi; Kanstantsin Pashkovich; Chaitanya Swamy (CoRR, 2025)