| 2023 | SODA | Shrunk subspaces via operator Sinkhorn iteration. | Cole Franks, Tasuku Soma, Michel X. Goemans |
| 2017 | IPCO | Discrete Newton's Algorithm for Parametric Submodular Function Minimization. | Michel X. Goemans, Swati Gupta, Patrick Jaillet |
| 2014 | SODA | Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs. | Wang Chi Cheung, Michel X. Goemans, Sam Chiu-wai Wong |
| 2014 | SODA | Polynomiality for Bin Packing with a Constant Number of Item Types. | Michel X. Goemans, Thomas Rothvo |
| 2012 | STOC | Matroids and integrality gaps for hypergraphic steiner tree relaxations. | Michel X. Goemans, Neil Olver, Thomas Rothvo, Rico Zenklusen |
| 2010 | SODA | An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. | Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi |
| 2009 | SODA | Approximating submodular functions everywhere. | Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni |
| 2006 | ESA | Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data. | Brian C. Dean, Michel X. Goemans, Nicole Immorlica |
| 2006 | FOCS | Minimum Bounded Degree Spanning Trees. | Michel X. Goemans |
| 2006 | LATIN | Stochastic Covering and Adaptivity. | Michel X. Goemans, Jan Vondrk |
| 2006 | SODA | Tight approximation algorithms for maximum general assignment problems. | Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko |
| 2005 | FOCS | Sink Equilibria and Convergence. | Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta |
| 2005 | SODA | Adaptivity and approximation for stochastic packing problems. | Brian C. Dean, Michel X. Goemans, Jan Vondrk |
| 2005 | SODA | Approximating the smallest | Harold N. Gabow, Michel X. Goemans, va Tardos, David P. Williamson |
| 2004 | FOCS | On the Integrality Ratio for Asymmetric TSP. | Moses Charikar, Michel X. Goemans, Howard J. Karloff |
| 2004 | FOCS | Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. | Brian C. Dean, Michel X. Goemans, Jan Vondrk |
| 2004 | INFOCOM | Universal Bounds on Buffer Size for Packetizing Fluid Policies in Input Queued, Crossbar Switches. | Michael Rosenblum, Michel X. Goemans, Vahid Tarokh |
| 2004 | MOBIHOC | Market sharing games applied to content distribution in ad-hoc networks. | Michel X. Goemans, Li (Erran) Li, Vahab S. Mirrokni, Marina Thottan |
| 2004 | SODA | Covering minimum spanning trees of random subgraphs. | Michel X. Goemans, Jan Vondrk |
| 2004 | SODA | Trade-offs on the location of the core node in a network. | Jean-Franois Macq, Michel X. Goemans |
| 2004 | STOC | An approximate Knig's theorem for edge-coloring weighted bipartite graphs. | Jos R. Correa, Michel X. Goemans |
| 2003 | ICALP | Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. | Brian C. Dean, Michel X. Goemans |
| 2001 | STOC | Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. | Michel X. Goemans, David P. Williamson |
| 2000 | SODA | Cooperative facility location games. | Michel X. Goemans, Martin Skutella |
| 1999 | SODA | Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. | Michel X. Goemans, David P. Williamson |
| 1998 | FOCS | On the Single-Source Unsplittable Flow Problem. | Yefim Dinitz, Naveen Garg, Michel X. Goemans |
| 1997 | SODA | Improved Approximation Algorithms for Scheduling with Release Dates. | Michel X. Goemans |
| 1996 | COCOON | Improved Bounds for On-line Load Balancing. | Matthew Andrews, Michel X. Goemans, Lisa Zhang |
| 1996 | IPCO | A Supermodular Relaxation for Scheduling with Release Dates. | Michel X. Goemans |
| 1996 | IPCO | The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown. | Michel X. Goemans, Leslie A. Hall |
| 1996 | IPCO | Primal-Dual Approximation Algorithms for Feedback Problems. | Michel X. Goemans, David P. Williamson |
| 1996 | SODA | An Improved Approximation Ratio for the Minimum Latency Problem. | Michel X. Goemans, Jon M. Kleinberg |
| 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 | IPCO | Polyhedral Description of Trees and Arborescences. | Michel X. Goemans |
| 1992 | SODA | A General Approximation Technique for Constrained Forest Problems. | Michel X. Goemans, David P. Williamson |
| 1990 | SODA | On the Parsimonious Property of Connectivity Problems. | Michel X. Goemans, Dimitris Bertsimas |