| 2026 | SODA | Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General. | David B. Shmoys, Varun Suriyanarayana, Seeun William Umboh |
| 2026 | SIGCOMM | OptCCL: Scalable Synthesis of Optimal Collective Communication Algorithms. | Richard Shapley, Rachit Agarwal, David B. Shmoys |
| 2025 | CPAIOR | Reducing Income Variability in Natural Resource Portfolios via Integer Programming. | Laura Greenstreet, Qinru Shi, Marc Grimson, Franz W. Simon, Suresh Andrew Sethi, Carla P. Gomes, Andrea Lodi, David B. Shmoys |
| 2024 | IPCO | Network Flow Problems with Electric Vehicles. | Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu |
| 2024 | NSDI | Harmony: A Congestion-free Datacenter Architecture. | Saksham Agarwal, Qizhe Cai, Rachit Agarwal, David B. Shmoys, Amin Vahdat |
| 2024 | SODA | Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints. | Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David B. Shmoys |
| 2024 | WAOA | Bounding the Price-of-Fair-Sharing Using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery Algorithms. | Sander Aarts, Jacob Dentes, Manxi Wu, David B. Shmoys |
| 2024 | WAOA | Small Additive Error for Unsplittable Multicommodity Flow in Outerplanar Graphs. | Richard Shapley, David B. Shmoys |
| 2023 | SIGCSE | GILP: An Interactive Tool for Visualizing the Simplex Algorithm. | Henry W. Robbins, Samuel C. Gutekunst, David B. Shmoys, David P. Williamson |
| 2023 | WAOA | Hitting Sets when the Shallow Cell Complexity is Small. | Sander Aarts, David B. Shmoys |
| 2022 | PODC | From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good. | Rachit Agarwal, Shijin Rajakrishnan, David B. Shmoys |
| 2022 | WAOA | Scheduling Appointments Online: The Power of Deferred Decision-Making. | Devin Smedira, David B. Shmoys |
| 2021 | IPCO | On the Power of Static Assignment Policies for Robust Facility Location Problems. | Omar El Housni, Vineet Goyal, David B. Shmoys |
| 2018 | SIGCOMM | Sincronia: near-optimal network design for coflows. | Saksham Agarwal, Shijin Rajakrishnan, Akshay Narayan, Rachit Agarwal, David B. Shmoys, Amin Vahdat |
| 2017 | ESA | Prize-Collecting TSP with a Budget Constraint. | Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson |
| 2017 | IPCO | Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. | Daniel Freund, Shane G. Henderson, David B. Shmoys |
| 2017 | WAOA | A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems. | Soroush Alamdari, David B. Shmoys |
| 2015 | AAAI | Data Analysis and Optimization for (Citi)Bike Sharing. | Eoin O'Mahony, David B. Shmoys |
| 2015 | AAAI | Predicting Bike Usage for New York City's Bike Sharing System. | Divya Singhvi, Somya Singhvi, Peter I. Frazier, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys, Dawn B. Woodard |
| 2012 | STOC | Improving christofides' algorithm for the s-t path TSP. | Hyung-Chan An, Robert Kleinberg, David B. Shmoys |
| 2011 | WAOA | Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat. | David B. Shmoys, Gwen Spencer |
| 2010 | UAI | Maximizing the Spread of Cascades Using Network Design. | Daniel Sheldon, Bistra Dilkina, Adam N. Elmachtoub, Ryan Finseth, Ashish Sabharwal, Jon Conrad, Carla P. Gomes, David B. Shmoys, William Allen, Ole Amundsen, William Vaughan |
| 2008 | IPCO | Primal-Dual Schema for Capacitated Covering Problems. | Tim Carnes, David B. Shmoys |
| 2008 | IPCO | A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. | David B. Shmoys, Kunal Talwar |
| 2007 | IPCO | Approximation Algorithms for 2-Stage Stochastic Scheduling Problems. | David B. Shmoys, Mauro Sozio |
| 2006 | STOC | Provably near-optimal sampling-based algorithms for Stochastic inventory control models. | Retsef Levi, Robin Roundy, David B. Shmoys |
| 2005 | FOCS | Sampling-based Approximation Algorithms for Multi-stage Stochastic. | Chaitanya Swamy, David B. Shmoys |
| 2005 | IPCO | Inventory and Facility Location Models with Market Selection. | Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys |
| 2005 | IPCO | Approximation Algorithms for Stochastic Inventory Control Models. | Retsef Levi, Martin Pl, Robin Roundy, David B. Shmoys |
| 2005 | SODA | A constant approximation algorithm for the one-warehouse multi-retailer problem. | Retsef Levi, Robin Roundy, David B. Shmoys |
| 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 | STOC | Primal-dual algorithms for deterministic inventory problems. | Retsef Levi, Robin Roundy, David B. Shmoys |
| 2003 | ESA | Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. | Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys |
| 2003 | SODA | An improved approximation algorithm for the partial latin square extension problem. | Carla P. Gomes, Rommel G. Regis, David B. Shmoys |
| 2003 | SODA | Fault-tolerant facility location. | Chaitanya Swamy, David B. Shmoys |
| 1999 | COLT | Approximation Algorithms for Clustering Problems. | David B. Shmoys |
| 1999 | SODA | Improved Approximation Algorithms for a Capacitated Facility Location Problem. | Fabin A. Chudak, David B. Shmoys |
| 1999 | STOC | A Constant-Factor Approximation Algorithm for the | Moses Charikar, Sudipto Guha, va Tardos, David B. Shmoys |
| 1997 | SODA | Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract). | Fabin A. Chudak, David B. Shmoys |
| 1997 | STOC | Approximation Algorithms for Facility Location Problems (Extended Abstract). | David B. Shmoys, va Tardos, Karen I. Aardal |
| 1996 | ICALP | Improved Scheduling Algorithms for Minsum Criteria. | Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein |
| 1996 | IPCO | A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. | Paul Martin, David B. Shmoys |
| 1996 | SODA | Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms. | Leslie A. Hall, David B. Shmoys, Joel Wein |
| 1994 | SODA | Improved Approximation Algorithms for Network Design Problems. | Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, va Tardos, David P. Williamson |
| 1993 | SODA | Scheduling Unrelated Machines with Costs. | David B. Shmoys, va Tardos |
| 1991 | FOCS | Fast Approximation Algorithms for Fractional Packing and Covering Problems | Serge A. Plotkin, David B. Shmoys, va Tardos |
| 1991 | FOCS | Scheduling Parallel Machines On-Line | David B. Shmoys, Joel Wein, David P. Williamson |
| 1991 | SODA | Improved Approximation Algorithms for Shop Scheduling Problems. | David B. Shmoys, Clifford Stein, Joel Wein |
| 1990 | IPCO | Near-Optimal Sequencing with Precedence Constraints. | Leslie A. Hall, David B. Shmoys |
| 1989 | FOCS | Interior-Point Methods in Parallel Computation | Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, va Tardos |
| 1989 | FOCS | Approximation Schemes for Constrained Scheduling Problems | Leslie A. Hall, David B. Shmoys |
| 1987 | FOCS | Approximation Algorithms for Scheduling Unrelated Parallel Machines | Jan Karel Lenstra, David B. Shmoys, va Tardos |
| 1986 | FOCS | Flipping Persuasively in Constant Expected Time (Preliminary Version) | Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer |
| 1985 | FOCS | Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results | Dorit S. Hochbaum, David B. Shmoys |
| 1985 | PODC | Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). | Benny Chor, Michael Merritt, David B. Shmoys |
| 1984 | STOC | Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems | Dorit S. Hochbaum, David B. Shmoys |