| 2009 |
|---|
| 38 | EE | Monique Laurent:
Matrix Completion Problems.
Encyclopedia of Optimization 2009: 1967-1975 |
| 37 | EE | Nebojsa Gvozdenovic,
Monique Laurent,
Frank Vallentin:
Block-diagonal semidefinite programming hierarchies for 0/1 programming.
Oper. Res. Lett. 37(1): 27-31 (2009) |
| 2008 |
|---|
| 36 | EE | Jean B. Lasserre,
Monique Laurent,
Philipp Rostalski:
Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm.
SAC 2008: 1845-1846 |
| 35 | EE | Monique Laurent,
Bernard Mourrain:
A Sparse Flat Extension Theorem for Moment Matrices
CoRR abs/0812.2563: (2008) |
| 34 | EE | Jean B. Lasserre,
Monique Laurent,
Philipp Rostalski:
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals.
Foundations of Computational Mathematics 8(5): 607-647 (2008) |
| 2007 |
|---|
| 33 | EE | Monique Laurent:
Semidefinite representations for finite varieties.
Math. Program. 109(1): 1-26 (2007) |
| 32 | EE | Monique Laurent:
Strengthened semidefinite programming bounds for codes.
Math. Program. 109(2-3): 239-261 (2007) |
| 31 | EE | Nebojsa Gvozdenovic,
Monique Laurent:
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials.
Math. Program. 110(1): 145-173 (2007) |
| 2006 |
|---|
| 30 | EE | Harry Buhrman,
Richard Cleve,
Monique Laurent,
Noah Linden,
Alexander Schrijver,
Falk Unger:
New Limits on Fault-Tolerant Quantum Computation.
FOCS 2006: 411-419 |
| 29 | EE | Etienne de Klerk,
Monique Laurent,
Pablo A. Parrilo:
A PTAS for the minimization of polynomials of fixed degree over the simplex.
Theor. Comput. Sci. 361(2-3): 210-225 (2006) |
| 2005 |
|---|
| 28 | EE | Nebojsa Gvozdenovic,
Monique Laurent:
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials.
IPCO 2005: 136-151 |
| 2003 |
|---|
| 27 | EE | Monique Laurent:
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming.
Math. Oper. Res. 28(3): 470-496 (2003) |
| 26 | EE | Monique Laurent:
Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope.
Math. Oper. Res. 28(4): 871-883 (2003) |
| 2001 |
|---|
| 25 | EE | Monique Laurent:
On the Sparsity Order of a Graph and Its Deficiency in Chordality.
Combinatorica 21(4): 543-570 (2001) |
| 2000 |
|---|
| 24 | | Jack H. Koolen,
Monique Laurent,
Alexander Schrijver:
Equilateral Dimension of the Rectilinear Space.
Des. Codes Cryptography 21(1/3): 149-164 (2000) |
| 1999 |
|---|
| 23 | EE | Tamás Fleiner,
Winfried Hochstättler,
Monique Laurent,
Martin Loebl:
Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions.
J. Comb. Theory, Ser. B 77(1): 25-38 (1999) |
| 1998 |
|---|
| 22 | EE | Hans-Jürgen Bandelt,
Victor Chepoi,
Monique Laurent:
Embedding into Rectilinear Spaces.
Discrete & Computational Geometry 19(4): 595-604 (1998) |
| 1997 |
|---|
| 21 | EE | Jack Edmonds,
Monique Laurent,
Alexander Schrijver:
A minor-monotone graph parameter based on oriented matroids.
Discrete Mathematics 165-166: 219-226 (1997) |
| 20 | | Monique Laurent,
Svatopluk Poljak,
Franz Rendl:
Connections between semidefinite relaxations of the max-cut and stable set problems.
Math. Program. 77: 225-246 (1997) |
| 19 | | Monique Laurent:
Cuts, matrix completions and graph rigidity.
Math. Program. 79: 255-283 (1997) |
| 1996 |
|---|
| 18 | EE | Monique Laurent:
Hilbert bases of cuts.
Discrete Mathematics 150(1-3): 257-279 (1996) |
| 17 | EE | Monique Laurent:
Graphic vertices of the metric polytope.
Discrete Mathematics 151(1-3): 131-153 (1996) |
| 16 | EE | Monique Laurent,
Svatopluk Poljak:
Gap Inequalities for the Cut Polytope.
Eur. J. Comb. 17(2-3): 233-254 (1996) |
| 1995 |
|---|
| 15 | EE | Michel Deza,
Monique Laurent:
Hypercube Embedding of Generalized Bipartite Metrics.
Discrete Applied Mathematics 56(2-3): 215-230 (1995) |
| 14 | EE | A. M. H. Gerards,
Monique Laurent:
A Characterization of Box 1/d-Integral Binary Clutters.
J. Comb. Theory, Ser. B 65(2): 186-207 (1995) |
| 13 | EE | Hein Vanderholst,
Monique Laurent,
Alexander Schrijver:
On a Minor-Monotone Graph Invariant.
J. Comb. Theory, Ser. B 65(2): 291-304 (1995) |
| 12 | | Monique Laurent,
Svatopluk Poljak:
One-third-integrality in the max-cut problem.
Math. Program. 71: 29-50 (1995) |
| 1994 |
|---|
| 11 | EE | Caterina De Simone,
Michel Deza,
Monique Laurent:
Collapsing and lifting for the cut cone.
Discrete Mathematics 127(1-3): 105-130 (1994) |
| 1993 |
|---|
| 10 | | Michel Deza,
Viatcheslav P. Grishukhin,
Monique Laurent:
The hypermetric cone is polydedral.
Combinatorica 13(4): 397-411 (1993) |
| 9 | EE | Tayuan Huang,
Monique Laurent:
(s, r; mu)-nets and alternating forms graphs.
Discrete Mathematics 114(1-3): 237-252 (1993) |
| 8 | EE | Michel Deza,
Komei Fukuda,
Monique Laurent:
The inequicut cone.
Discrete Mathematics 119(1-3): 21-48 (1993) |
| 7 | EE | Michel Deza,
Monique Laurent:
The even and odd cut polytopes.
Discrete Mathematics 119(1-3): 49-66 (1993) |
| 1992 |
|---|
| 6 | | Monique Laurent,
Svatopluk Poljak:
The Metric Polytope.
IPCO 1992: 274-286 |
| 5 | EE | Michel Deza,
Monique Laurent:
Extension operations for cuts.
Discrete Mathematics 106-107: 163-179 (1992) |
| 4 | | Michel Deza,
Monique Laurent:
Facets for the cut cone I.
Math. Program. 56: 121-160 (1992) |
| 3 | | Michel Deza,
Monique Laurent:
Facets for the cut cone II: Clique-web inequalities.
Math. Program. 56: 161-188 (1992) |
| 1990 |
|---|
| 2 | | Michel Deza,
Monique Laurent:
New Results on Facets of the Cut Cone.
IPCO 1990: 171-184 |
| 1989 |
|---|
| 1 | EE | Monique Laurent,
Michel Deza:
Bouquets of geometric lattices: some algebraic and topological aspects.
Discrete Mathematics 75(1-3): 279-313 (1989) |
