Michel Goemans is a Professor of Applied Mathematics and a member of the Theory of Computation group at CSAIL. His research interests are in combinatorial optimization and algorithms. He has developed new techniques to design approximation algorithms for hard optimization problems. He has been on the program committee of several major theoretical computer science conferences, including as chair of the 2003 ACM Symposium on Theory of Computing.
- Brian Dean, Michel X. Goemans and Jan Vondrak, "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity", in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy, 2004.
- Michel X. Goemans, Li Li, Vahab S. Mirrokni and Marina Thottan, "Market Sharing Games Applied to Content Distribution in Ad-Hoc Networks", in Proceedings of Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Tokyo, Japan, 2004.
- Jose Correa and Michel X. Goemans, "An Approximate Koenig's Theorem for Edge-Coloring Weighted Bipartite Graphs", in Proceedings of the 36th ACM Symposium on Theory of Computing, Chicago, IL, 2004.
- Michel X. Goemans and Martin Skutella, "Cooperative Facility Location Games", Journal of Algorithms, 50, 194-214, 2004.
- Yefim Dinitz, Naveen Garg and Michel X. Goemans, "On the Single-Source Unsplittable Flow Problem", Combinatorica, 19, 17-41, 1999.
- Michel X. Goemans and David P. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming", J. ACM, 42, 1115-1145, 1995.
- ACM: Fellow (2009)
- John Simon Guggenheim Memorial Foundation: Fellow (2007)
- MIT School of Science: Dean's Educational and Student Advising Award (2004)
- AMS: Delbert Ray Fulkerson Prize (2000)
- IBM: Partnership Award (1999)
- SIAM: Activity Group on Optimization Prize (1999)
- SIAM: Activity Group on Optimization Prize (1996)
- NSF: Career Award (1996)
- Sloan Foundation: Research Fellowship (1995)