| 2026 | COLT | Online Convex Optimization with Sublinear Noisy Probes. | Simone Di Gregorio, Anupam Gupta, Stefano Leonardi, Matteo Russo |
| 2026 | IPCO | Bayesian Probing on Graphs. | Anupam Gupta, Benjamin Moseley, Rudy Zhou |
| 2026 | SODA | Learning Packing and Covering from Samples. | Anupam Gupta, Marco Molinaro |
| 2026 | SODA | An Optimal Online Algorithm for Robust Flow Time Scheduling. | Anupam Gupta, Amit Kumar, Debmalya Panigrahi, Zhaozi Wang |
| 2026 | STOC | Combinatorial Optimization using Comparison Oracles. | Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Guru Guruganesh, Euiwoong Lee, Renato Paes Leme, Debmalya Panigrahi, Madhusudhan Reddy Pittu, Jon Schneider, David P. Woodruff |
| 2026 | STOC | Steiner Forest: A Simplified Better-Than-2 Approximation. | Anupam Gupta, Vera Traub |
| 2025 | FOCS | A Little Clairvoyance Is All You Need. | Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlter, Sorrachai Yingchareonthawornchai |
| 2025 | ICALP | Online Algorithm Design Beyond the Worst Case (Invited Talk). | Anupam Gupta |
| 2025 | WWW | Multi-Platform Autobidding with and without Predictions. | Gagan Aggarwal, Anupam Gupta, Xizhi Tan, Mingfei Zhao |
| 2025 | STOC | Tight Results for Online Convex Paging. | Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2024 | ICLR | NIRo: A Metric to capture non-iid robustness for Federated Learning Algorithms. | Anupam Gupta, Pabitra Mitra |
| 2024 | ICPR | Stagger-Cache MITM: A Privacy-Preserving Hierarchical Model Aggregation Framework. | Anupam Gupta, Pabitra Mitra, Sudip Misra |
| 2024 | IPCO | Pairwise-Independent Contention Resolution. | Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin |
| 2024 | WWW | HBIAS FedAvg: Smooth Federated Learning Transition for In-use Edge Models. | Anupam Gupta, Pabitra Mitra, Sudip Misra |
| 2024 | SODA | Maintaining Matroid Intersections Online. | Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar |
| 2024 | SODA | Set Covering with Our Eyes Wide Shut. | Anupam Gupta, Gregory Kehne, Roie Levin |
| 2024 | SODA | Poly-logarithmic Competitiveness for the | Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2023 | FOCS | The Price of Explainability for Clustering. | Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan |
| 2023 | IPCO | Configuration Balancing for Stochastic Requests. | Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou |
| 2023 | SODA | Minimizing Completion Times for Stochastic Jobs via Batched Free Times. | Anupam Gupta, Benjamin Moseley, Rudy Zhou |
| 2022 | IPCO | Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. | Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan |
| 2022 | IPCO | Matroid-Based TSP Rounding for Half-Integral Solutions. | Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar |
| 2022 | SODA | Robust Secretary and Prophet Algorithms for Packing Integer Programs. | C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla |
| 2022 | SODA | An Improved Local Search Algorithm for k-Median. | Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic |
| 2022 | SODA | Online Discrepancy with Recourse for Vectors and Graphs. | Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla |
| 2021 | FOCS | A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. | Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2021 | FOCS | Random Order Online Set Cover is as Easy as Offline. | Anupam Gupta, Gregory Kehne, Roie Levin |
| 2021 | ICALP | Structural Iterative Rounding for Generalized k-Median Problems. | Anupam Gupta, Benjamin Moseley, Rudy Zhou |
| 2021 | ICML | The Power of Adaptivity for Stochastic Submodular Cover. | Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan |
| 2021 | SODA | The Connectivity Threshold for Dense Graphs. | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2021 | STOC | Chasing convex bodies with linear competitive ratio (invited paper). | C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang |
| 2021 | STOC | A quasipolynomial (2 + | Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li |
| 2020 | COLT | Dimension-Free Bounds for Chasing Convex Functions. | C. J. Argue, Anupam Gupta, Guru Guruganesh |
| 2020 | FOCS | Fully-Dynamic Submodular Cover with Bounded Recourse. | Anupam Gupta, Roie Levin |
| 2020 | IPCO | Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). | Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen |
| 2020 | SODA | Chasing Convex Bodies with Linear Competitive Ratio. | C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang |
| 2020 | SODA | The Online Submodular Cover Problem. | Anupam Gupta, Roie Levin |
| 2020 | STOC | Caching with time windows. | Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2020 | STOC | The Karger-Stein algorithm is optimal for k-cut. | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2019 | COLT | Better Algorithms for Stochastic Bandits with Adversarial Corruptions. | Anupam Gupta, Tomer Koren, Kunal Talwar |
| 2019 | ICALP | Non-Clairvoyant Precedence Constrained Scheduling. | Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla |
| 2019 | ICALP | Tight FPT Approximations for k-Median and k-Means. | Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li |
| 2019 | ICALP | Stochastic Online Metric Matching. | Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc |
| 2019 | IPCO | The Markovian Price of Information. | Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla |
| 2019 | SODA | A Nearly-Linear Bound for Chasing Nested Convex Bodies. | C. J. Argue, Sbastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee |
| 2019 | SODA | k-Servers with a Smile: Online Algorithms via Projections. | Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor |
| 2019 | SODA | Elastic Caching. | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi |
| 2019 | SODA | Losing Treewidth by Separating Subsets. | Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk |
| 2019 | STOC | The number of minimum | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2018 | ASSETS | Interactively Modeling and Visualizing Neighborhood Accessibility at Scale: An Initial Study of Washington DC. | Anthony Li, Manaswi Saha, Anupam Gupta, Jon E. Froehlich |
| 2018 | FOCS | Faster Exact and Approximate Algorithms for k-Cut. | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2018 | ICALP | Fully-Dynamic Bin Packing with Little Repacking. | Bjrn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sren Riechers, David Wajc |
| 2018 | ICALP | Non-Preemptive Flow-Time Minimization via Rejections. | Anupam Gupta, Amit Kumar, Jason Li |
| 2018 | ICALP | Maximizing Profit with Convex Costs in the Random-order Model. | Anupam Gupta, Ruta Mehta, Marco Molinaro |
| 2018 | SODA | Stochastic Load Balancing on Unrelated Machines. | Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen |
| 2018 | SODA | An FPT Algorithm Beating 2-Approximation for | Anupam Gupta, Euiwoong Lee, Jason Li |
| 2018 | STOC | Metric embedding via shortest path decompositions. | Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman |
| 2017 | COLT | Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. | Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang |
| 2017 | SODA | LAST but not Least: Online Spanners for Buy-at-Bulk. | Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh |
| 2017 | SODA | Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. | Anupam Gupta, Viswanath Nagarajan, Sahil Singla |
| 2017 | STOC | Online and dynamic algorithms for set cover. | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi |
| 2016 | COLT | Pure Exploration of Multi-armed Bandit Under Matroid Constraints. | Lijie Chen, Anupam Gupta, Jian Li |
| 2016 | FOCS | Online Algorithms for Covering and Packing Problems with Convex Objectives. | Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi |
| 2016 | ICALP | Approximation Algorithms for Aversion k-Clustering via Local k-Median. | Anupam Gupta, Guru Guruganesh, Melanie Schmidt |
| 2016 | SODA | Algorithms and Adaptivity Gaps for Stochastic Probing. | Anupam Gupta, Viswanath Nagarajan, Sahil Singla |
| 2015 | STOC | On the Lovsz Theta function for Independent Sets in Sparse Graphs. | Nikhil Bansal, Anupam Gupta, Guru Guruganesh |
| 2015 | STOC | Greedy Algorithms for Steiner Forest. | Anupam Gupta, Amit Kumar |
| 2014 | COMSNETS | Novel approach for security in Wireless Sensor Network using bio-inspirations. | Heena Rathore, Venkataramana Badarla, Sushmita Jha, Anupam Gupta |
| 2014 | ESA | How Experts Can Solve LPs Online. | Anupam Gupta, Marco Molinaro |
| 2014 | ICALP | Changing Bases: Multistage Optimization for Matroids and Matchings. | Anupam Gupta, Kunal Talwar, Udi Wieder |
| 2014 | SODA | Towards (1 + | Alexandr Andoni, Anupam Gupta, Robert Krauthgamer |
| 2014 | SODA | Online Steiner Tree with Deletions. | Anupam Gupta, Amit Kumar |
| 2014 | SODA | Maintaining Assignments Online: Matching, Scheduling, and Flows. | Anupam Gupta, Amit Kumar, Cliff Stein |
| 2014 | SODA | Minimum | Anupam Gupta, Anastasios Sidiropoulos |
| 2014 | STOC | Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. | Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar |
| 2013 | ICALP | Algorithms for Hub Label Optimization. | Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan |
| 2013 | IPCO | Packing Interdiction and Partial Covering Problems. | Michael Dinitz, Anupam Gupta |
| 2013 | IPCO | An Improved Integrality Gap for Asymmetric TSP Paths. | Zachary Friggstad, Anupam Gupta, Mohit Singh |
| 2013 | IPCO | A Stochastic Probing Problem with Applications. | Anupam Gupta, Viswanath Nagarajan |
| 2013 | IPCO | Thrifty Algorithms for Multistage Robust Optimization. | Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani |
| 2013 | STOC | The power of deferral: maintaining a constant-competitive steiner tree online. | Albert Gu, Anupam Gupta, Amit Kumar |
| 2013 | STOC | Sparsest cut on bounded treewidth graphs: algorithms and hardness results. | Anupam Gupta, Kunal Talwar, David Witmer |
| 2012 | ICALP | The Online Metric Matching Problem for Doubling Metrics. | Anupam Gupta, Kevin Lewi |
| 2012 | ICALP | Approximating Sparse Covering Integer Programs Online. | Anupam Gupta, Viswanath Nagarajan |
| 2012 | SODA | Scheduling heterogeneous processors isn't as easy as you think. | Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs |
| 2012 | SODA | Approximation algorithms for stochastic orienteering. | Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi |
| 2012 | SPAA | Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. | Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan |
| 2012 | TCC | Iterative Constructions and Private Data Release. | Anupam Gupta, Aaron Roth, Jonathan R. Ullman |
| 2012 | WAOA | Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. | Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs |
| 2011 | FOCS | Welfare and Profit Maximization with Production Costs. | Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma |
| 2011 | FOCS | Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. | Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi |
| 2011 | STOC | Privately releasing conjunctions and the statistical query barrier. | Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan R. Ullman |
| 2011 | SPAA | Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. | Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan |
| 2010 | COLT | Forest Density Estimation. | Anupam Gupta, John D. Lafferty, Han Liu, Larry A. Wasserman, Min Xu |
| 2010 | COMSNETS | Coordinated sampling sans Origin-Destination identifiers: Algorithms and analysis. | Vyas Sekar, Anupam Gupta, Mike K. Reiter, Hui Zhang |
| 2010 | CoNEXT | Network-wide deployment of intrusion detection and prevention systems. | Vyas Sekar, Ravishankar Krishnaswamy, Anupam Gupta, Michael K. Reiter |
| 2010 | ESA | When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). | Nikhil Bansal, Anupam Gupta, Jian Li, Julin Mestre, Viswanath Nagarajan, Atri Rudra |
| 2010 | ICALP | Scalably Scheduling Power-Heterogeneous Processors. | Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs |
| 2010 | ICALP | Thresholded Covering Algorithms for Robust and Max-min Optimization. | Anupam Gupta, Viswanath Nagarajan, R. Ravi |
| 2010 | ICALP | Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. | Anupam Gupta, Viswanath Nagarajan, R. Ravi |
| 2010 | SODA | A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. | Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy |
| 2010 | SODA | Tree Embeddings for Two-Edge-Connected Network Design. | Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi |
| 2010 | SODA | Differentially Private Combinatorial Optimization. | Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar |
| 2010 | SPAA | Scheduling jobs with varying parallelizability to reduce variance. | Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs |
| 2009 | SODA | Secretary problems: weights and discounts. | Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar |
| 2009 | SODA | Approximate clustering without the approximation. | Maria-Florina Balcan, Avrim Blum, Anupam Gupta |
| 2009 | STOC | A constant-factor approximation for stochastic Steiner forest. | Anupam Gupta, Amit Kumar |
| 2009 | STOC | Online and stochastic survivable network design. | Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi |
| 2008 | FOCS | Set Covering with our Eyes Closed. | Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh |
| 2008 | LATIN | How to Complete a Doubling Metric. | Anupam Gupta, Kunal Talwar |
| 2008 | SODA | A plant location guide for the unsure. | Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan |
| 2008 | SODA | Approximating TSP on metrics with bounded global growth. | T.-H. Hubert Chan, Anupam Gupta |
| 2008 | SODA | Ultra-low-dimensional embeddings for doubling metrics. | T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar |
| 2008 | SODA | Set connectivity problems in undirected graphs and the directed Steiner network problem. | Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev |
| 2008 | SODA | Stochastic analyses for online combinatorial optimization problems. | Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski |
| 2007 | ESA | An | Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor |
| 2007 | ESA | Pricing Tree Access Networks with Connected Backbones. | Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi |
| 2007 | ESA | Dial a Ride from | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi |
| 2007 | IPCO | Infrastructure Leasing Problems. | Barbara M. Anthony, Anupam Gupta |
| 2007 | SODA | An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. | Anupam Gupta, Jochen Knemann, Stefano Leonardi, R. Ravi, Guido Schfer |
| 2006 | ESA | Spanners with Slack. | T.-H. Hubert Chan, Michael Dinitz, Anupam Gupta |
| 2006 | PODC | Quorum placement in networks: minimizing network congestion. | Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter |
| 2006 | SODA | Small hop-diameter sparse spanners for doubling metrics. | T.-H. Hubert Chan, Anupam Gupta |
| 2006 | SODA | Improved embeddings of graph metrics into random trees. | Kedar Dhamdhere, Anupam Gupta, Harald Rcke |
| 2006 | SODA | Oblivious network design. | Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Rcke |
| 2006 | SODA | Approximating unique games. | Anupam Gupta, Kunal Talwar |
| 2005 | FOCS | Metric Embeddings with Relaxed Guarantees. | Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins |
| 2005 | ICALP | Stochastic Steiner Trees Without a Root. | Anupam Gupta, Martin Pl |
| 2005 | PODC | Quorum placement in networks to minimize access delays. | Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter |
| 2005 | SODA | Approximation algorithms for low-distortion embeddings into low-dimensional spaces. | Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Rcke, R. Ravi, Anastasios Sidiropoulos |
| 2005 | SODA | On hierarchical routing in doubling metrics. | Hubert Tsz-Hong Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou |
| 2005 | SODA | Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. | Shuchi Chawla, Anupam Gupta, Harald Rcke |
| 2005 | SODA | On the approximability of some network design problems. | Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha |
| 2004 | FOCS | An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. | Anupam Gupta, R. Ravi, Amitabh Sinha |
| 2004 | STOC | Boosted sampling: approximation algorithms for stochastic optimization. | Anupam Gupta, Martin Pl, R. Ravi, Amitabh Sinha |
| 2004 | STACS | Approximation Algorithms for Minimizing Average Distortion. | Kedar Dhamdhere, Anupam Gupta, R. Ravi |
| 2003 | FOCS | Bounded Geometries, Fractals, and Low-Distortion Embeddings. | Anupam Gupta, Robert Krauthgamer, James R. Lee |
| 2003 | FOCS | Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. | Anupam Gupta, Amit Kumar, Martin Pl, Tim Roughgarden |
| 2003 | INFOCOM | Exploring the trade-off between label size and stack depth in MPLS Routing. | Anupam Gupta, Amit Kumar, Rajeev Rastogi |
| 2003 | SODA | Lower bounds for embedding edit distance into normed spaces. | Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova |
| 2003 | SODA | Embedding k-outerplanar graphs into l1. | Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair |
| 2003 | SODA | Improved results for directed multicut. | Anupam Gupta |
| 2003 | SODA | Counting inversions in lists. | Anupam Gupta, Francis Zane |
| 2003 | STOC | Simpler and better approximation algorithms for network design. | Anupam Gupta, Amit Kumar, Tim Roughgarden |
| 2003 | SPAA | Tree based MPLS routing. | Anupam Gupta, Amit Kumar, Mikkel Thorup |
| 2002 | FOCS | A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. | Amit Kumar, Anupam Gupta, Tim Roughgarden |
| 2002 | IPCO | Building Edge-Failure Resilient Networks. | Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz |
| 2001 | FOCS | Sorting and Selection with Structured Costs. | Anupam Gupta, Amit Kumar |
| 2001 | FOCS | Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). | Anupam Gupta, Amit Kumar, Rajeev Rastogi |
| 2001 | SODA | Steiner points in tree metrics don't (really) help. | Anupam Gupta |
| 2001 | STOC | Provisioning a virtual private network: a network design problem for multicommodity flow. | Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Blent Yener |
| 2000 | SODA | Improved bandwidth approximation for trees. | Anupam Gupta |
| 2000 | STOC | A constant factor approximation algorithm for a class of classification problems. | Anupam Gupta, va Tardos |
| 1999 | FOCS | Cuts, Trees and l | Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair |
| 1999 | STOC | Embedding Tree Metrics Into Low Dimensional Euclidean Spaces. | Anupam Gupta |