| 2024 | IPCO | A Lower Bound for the Max Entropy Algorithm for TSP. | Billy Jin, Nathan Klein, David P. Williamson |
| 2023 | IPCO | A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP. | Billy Jin, Nathan Klein, David P. Williamson |
| 2023 | SIGCSE | GILP: An Interactive Tool for Visualizing the Simplex Algorithm. | Henry W. Robbins, Samuel C. Gutekunst, David B. Shmoys, David P. Williamson |
| 2022 | IPCO | The Two-Stripe Symmetric Circulant TSP is in P. | Samuel C. Gutekunst, Billy Jin, David P. Williamson |
| 2022 | IPCO | Graph Coloring and Semidefinite Rank. | Renee Mirka, Devin Smedira, David P. Williamson |
| 2020 | ICMLA | Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time. | Iddo Drori, Anant Kharkar, William R. Sickinger, Brandon Kates, Qiang Ma, Suwen Ge, Eden Dolev, Brenda Dietrich, David P. Williamson, Madeleine Udell |
| 2019 | ICALP | Tight Bounds for Online Weighted Tree Augmentation. | Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson |
| 2017 | ESA | Prize-Collecting TSP with a Budget Constraint. | Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson |
| 2016 | LATIN | Simple Approximation Algorithms for Balanced MAX 2SAT. | Alice Paul, Matthias Poloczek, David P. Williamson |
| 2015 | ESA | An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem. | Kyle Genova, David P. Williamson |
| 2014 | LATIN | The Online Connected Facility Location Problem. | Mrio Csar San Felice, David P. Williamson, Orlando Lee |
| 2014 | LATIN | On Some Recent Approximation Algorithms for MAX SAT. | Matthias Poloczek, David P. Williamson, Anke van Zuylen |
| 2013 | ESA | Maximizing a Submodular Function with Viability Constraints. | Wolfgang Dvork, Monika Henzinger, David P. Williamson |
| 2012 | ESA | A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems. | James M. Davis, David P. Williamson |
| 2012 | LATIN | On the Integrality Gap of the Subtour LP for the 1, 2-TSP. | Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen |
| 2012 | SODA | A proof of the Boyd-Carr conjecture. | Frans Schalekamp, David P. Williamson, Anke van Zuylen |
| 2011 | ICALP | An | Jiawei Qian, David P. Williamson |
| 2008 | IPCO | Offline and Online Facility Leasing. | Chandrashekhar Nagarajan, David P. Williamson |
| 2008 | WAOA | Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements. | Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson |
| 2007 | SODA | Approximation algorithms for prize collecting forest problems with submodular penalty functions. | Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson |
| 2007 | SODA | Deterministic pivoting algorithms for constrained ranking and clustering problems. | Anke van Zuylen, Rajneesh Hegde, Kamal Jain, David P. Williamson |
| 2007 | WAOA | Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems. | Anke van Zuylen, David P. Williamson |
| 2006 | SODA | A general approach for incremental approximation and hierarchical clustering. | Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson |
| 2006 | SODA | A simple GAP-canceling algorithm for the generalized maximum flow problem. | Mateo Restrepo, David P. Williamson |
| 2005 | SODA | Approximating the smallest | Harold N. Gabow, Michel X. Goemans, va Tardos, David P. Williamson |
| 2003 | WWW | Searching the workplace web. | Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson |
| 2003 | SODA | Faster approximation algorithms for the minimum latency problem. | Aaron Archer, David P. Williamson |
| 2002 | SODA | Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems. | R. Ravi, David P. Williamson |
| 2001 | FOCS | An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem. | Lisa Fleischer, Kamal Jain, David P. Williamson |
| 2001 | IPCO | Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. | Fabin A. Chudak, Tim Roughgarden, David P. Williamson |
| 2001 | STOC | Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. | Michel X. Goemans, David P. Williamson |
| 2000 | SODA | Improved approximation algorithms for MAX SAT. | Takao Asano, David P. Williamson |
| 1999 | IPCO | Improved Approximation Algorithms for Capacitated Facility Location Problems. | Fabin A. Chudak, David P. Williamson |
| 1999 | SODA | Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. | Michel X. Goemans, David P. Williamson |
| 1999 | SODA | A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem. | Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson |
| 1997 | STOC | A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction. | Sanjeev Khanna, Madhu Sudan, David P. Williamson |
| 1997 | WG | Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). | David P. Williamson |
| 1996 | FOCS | Gadgets, Approximation, and Linear Programming (extended abstract). | Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson |
| 1996 | IPCO | Primal-Dual Approximation Algorithms for Feedback Problems. | Michel X. Goemans, David P. Williamson |
| 1996 | STOC | Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. | Alok Aggarwal, Jon M. Kleinberg, David P. Williamson |
| 1996 | STOC | Adversarial Queueing Theory. | Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson |
| 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 |
| 1994 | SODA | Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances. | David P. Williamson, Michel X. Goemans |
| 1994 | STOC | .879-approximation algorithms for MAX CUT and MAX 2SAT. | Michel X. Goemans, David P. Williamson |
| 1993 | IPCO | An efficient approximation algorithm for the survivable network design problem. | Harold N. Gabow, Michel X. Goemans, David P. Williamson |
| 1993 | IPCO | A new \frac34-approximation algorithm for MAX SAT. | Michel X. Goemans, David P. Williamson |
| 1993 | STOC | A primal-dual approximation algorithm for generalized Steiner network problems. | David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani |
| 1992 | SODA | A General Approximation Technique for Constrained Forest Problems. | Michel X. Goemans, David P. Williamson |
| 1991 | FOCS | Scheduling Parallel Machines On-Line | David B. Shmoys, Joel Wein, David P. Williamson |