| Geometry of cuts and metrics MM Deza, M Laurent Springer-Verlag, Berlin, 588 pages., 1997 | 1506 | 1997 |
| Sums of squares, moment matrices and optimization over polynomials M Laurent Emerging applications of algebraic geometry, 157-270, 2009 | 1035 | 2009 |
| A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0–1 programming M Laurent Mathematics of Operations Research 28 (3), 470-496, 2003 | 458 | 2003 |
| Semidefinite programming and integer programming M Laurent, F Rendl Handbooks in Operations Research and Management Science 12, 393-514, 2005 | 230 | 2005 |
| On a Positive Semidefinite Relaxation of the Cut Polytope M Laurent, S Poljak | 183* | |
| Matrix Completion Problems. M Laurent Encyclopedia of Optimization 3, 221-229, 2009 | 155 | 2009 |
| Semidefinite characterization and computation of zero-dimensional real radical ideals JB Lasserre, M Laurent, P Rostalski Foundations of Computational Mathematics 8, 607-647, 2008 | 138 | 2008 |
| Revisiting two theorems of Curto and Fialkow on moment matrices M Laurent Proceedings of the American Mathematical Society 133 (10), 2965-2976, 2005 | 116 | 2005 |
| Semidefinite representations for finite varieties M Laurent Mathematical programming 109 (1), 1-26, 2007 | 113 | 2007 |
| A PTAS for the minimization of polynomials of fixed degree over the simplex E De Klerk, M Laurent, PA Parrilo Theoretical Computer Science 361 (2-3), 210-225, 2006 | 112 | 2006 |
| Facets for the cut cone I M Deza, M Laurent Mathematical programming 56, 121-160, 1992 | 110* | 1992 |
| On the facial structure of the set of correlation matrices M Laurent, S Poljak SIAM Journal on Matrix Analysis and Applications 17 (3), 530-547, 1996 | 91 | 1996 |
| Clique-web facets for multicut polytopes M Deza, M Grötschel, M Laurent Mathematics of Operations Research 17 (4), 981-1000, 1992 | 90 | 1992 |
| Applications of cut polyhedra—II M Deza, M Laurent Journal of Computational and Applied Mathematics 55 (2), 217-247, 1994 | 87 | 1994 |
| Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization N Gvozdenovic, M Laurent SIAM Journal on Optimization 19 (2), 592-615, 2008 | 86 | 2008 |
| Connections between semidefinite relaxations of the max-cut and stable set problems M Laurent, S Poljak, F Rendl Mathematical Programming 77, 225-246, 1997 | 78 | 1997 |
| New limits on fault-tolerant quantum computation H Buhrman, R Cleve, M Laurent, N Linden, A Schrijver, F Unger 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006 | 77 | 2006 |
| A generalized flat extension theorem for moment matrices M Laurent, B Mourrain Archiv der Mathematik 93 (1), 87-98, 2009 | 72 | 2009 |
| Strengthened semidefinite programming bounds for codes M Laurent Mathematical programming 109 (2), 239-261, 2007 | 71 | 2007 |
| A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems M Laurent Topics in semidefinite and interior-point methods, 51-76, 1998 | 71 | 1998 |
Michel DezaEcole Normale Superieure, ParisVerified email at ens.fr
