Possible DNA modification in GC dinucleotides of Trypanosoma brucei telomeric sequences; relationship with antigen gene transcription. - Etienne Pays; Marie-France Delauw; Monique Laurent; Maurice Steinert (Nucleic Acids Res., 1984)

Upper Bounds for the Cardinality of s-Distances Codes. - Monique Laurent (Eur. J. Comb., 1986)

A characterization of matroidal systems of inequalities. - Michele Conforti; Monique Laurent (Discret. Math., 1988)

On the Facial Structure of Independence System Polyhedra. - Michele Conforti; Monique Laurent (Math. Oper. Res., 1988)

Bouquets of geometric lattices: some algebraic and topological aspects. - Monique Laurent; Michel Deza (Discret. Math., 1989)

On the geometric structure of independence systems. - Michele Conforti; Monique Laurent (Math. Program., 1989)

A generalization of antiwebs to independence systems and their canonical facets. - Monique Laurent (Math. Program., 1989)

The Symmetries of the Cut Polytope and of Some Relatives. - Michel Deza; Viatcheslav P. Grishukhin; Monique Laurent (Applied Geometry And Discrete Mathematics, 1990)

Complete Descriptions of Small Multicut Polytopes. - Michel Deza; Martin Grötschel; Monique Laurent (Applied Geometry And Discrete Mathematics, 1990)

New Results on Facets of the Cut Cone. - Michel Deza; Monique Laurent (IPCO, 1990)

The Metric Polytope. - Monique Laurent; Svatopluk Poljak (IPCO, 1992)

Extension operations for cuts. - Michel Deza; Monique Laurent (Discret. Math., 1992)

Clique-Web Facets for Multicut Polytopes. - Michel Deza; Martin Grötschel; Monique Laurent (Math. Oper. Res., 1992)

Facets for the cut cone I. - Michel Deza; Monique Laurent (Math. Program., 1992)

Facets for the cut cone II: Clique-web inequalities. - Michel Deza; Monique Laurent (Math. Program., 1992)

A characterization of knapsacks with the max-flow- - min-cut property. - Monique Laurent; Antonio Sassano (Oper. Res. Lett., 1992)

Hypermetrics in geometry of numbers. - Michel Deza; Viatcheslav P. Grishukhin; Monique Laurent (Combinatorial Optimization, 1993)

The hypermetric cone is polydedral. - Michel Deza; Viatcheslav P. Grishukhin; Monique Laurent (Comb., 1993)

The inequicut cone. - Michel Deza; Komei Fukuda; Monique Laurent (Discret. Math., 1993)

The even and odd cut polytopes. - Michel Deza; Monique Laurent (Discret. Math., 1993)

(s, r; mu)-nets and alternating forms graphs. - Tayuan Huang; Monique Laurent (Discret. Math., 1993)

The cut cone III: On the role of triangle facets. - Michel Deza; Monique Laurent; Svatopluk Poljak (Graphs Comb., 1993)

Collapsing and lifting for the cut cone. - Caterina De Simone; Michel Deza; Monique Laurent (Discret. Math., 1994)

Hypercube Embedding of Generalized Bipartite Metrics. - Michel Deza; Monique Laurent (Discret. Appl. Math., 1995)

Some New Classes of Facets for the Equicut Polytope. - Cid C. de Souza; Monique Laurent (Discret. Appl. Math., 1995)

A Characterization of Box 1/d-Integral Binary Clutters. - A. M. H. Gerards; Monique Laurent (J. Comb. Theory B, 1995)

On a Minor-Monotone Graph Invariant. - Hein Vanderholst; Monique Laurent; Alexander Schrijver (J. Comb. Theory B, 1995)

One-third-integrality in the max-cut problem. - Monique Laurent; Svatopluk Poljak (Math. Program., 1995)

Hilbert bases of cuts. - Monique Laurent (Discret. Math., 1996)

Graphic vertices of the metric polytope. - Monique Laurent (Discret. Math., 1996)

Gap Inequalities for the Cut Polytope. - Monique Laurent; Svatopluk Poljak (Eur. J. Comb., 1996)

On the Facial Structure of the Set of Correlation Matrices. - Monique Laurent; Svatopluk Poljak (SIAM J. Matrix Anal. Appl., 1996)

Geometry of cuts and metrics. - Michel Marie Deza; Monique Laurent (Springer, 1997)

A minor-monotone graph parameter based on oriented matroids. - Jack Edmonds 001; Monique Laurent; Alexander Schrijver (Discret. Math., 1997)

Cuts, matrix completions and graph rigidity. - Monique Laurent (Math. Program., 1997)

Connections between semidefinite relaxations of the max-cut and stable set problems. - Monique Laurent; Svatopluk Poljak; Franz Rendl (Math. Program., 1997)

Embedding into Rectilinear Spaces. - Hans-Jürgen Bandelt; Victor Chepoi; Monique Laurent (Discret. Comput. Geom., 1998)

Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions. - Tamás Fleiner; Winfried Hochstättler; Monique Laurent; Martin Loebl (J. Comb. Theory B, 1999)

Equilateral Dimension of the Rectilinear Space. - Jack H. Koolen; Monique Laurent; Alexander Schrijver (Des. Codes Cryptogr., 2000)

On the Sparsity Order of a Graph and Its Deficiency in Chordality. - Monique Laurent (Comb., 2001)

Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems. - Monique Laurent (SIAM J. Matrix Anal. Appl., 2001)

Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lov[a-acute]sz–Schrijver Lift-and-Project Procedure. - Monique Laurent (SIAM J. Optim., 2002)

A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming. - Monique Laurent (Math. Oper. Res., 2003)

Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope. - Monique Laurent (Math. Oper. Res., 2003)

Semidefinite Relaxations for Max-Cut. - Monique Laurent (The Sharpest Cut, 2004)

Semidefinite Approximations for Global Unconstrained Polynomial Optimization. - Dorina Jibetean; Monique Laurent (SIAM J. Optim., 2005)

New Limits on Fault-Tolerant Quantum Computation. - Harry Buhrman; Richard Cleve; Monique Laurent; Noah Linden; Alexander Schrijver; Falk Unger (FOCS, 2006)

A PTAS for the minimization of polynomials of fixed degree over the simplex. - Etienne de Klerk; Monique Laurent; Pablo A. Parrilo (Theor. Comput. Sci., 2006)

Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. - Nebojsa Gvozdenovic; Monique Laurent (Math. Program., 2007)

Semidefinite representations for finite varieties. - Monique Laurent (Math. Program., 2007)

Strengthened semidefinite programming bounds for codes. - Monique Laurent (Math. Program., 2007)

Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm. - Jean B. Lasserre; Monique Laurent; Philipp Rostalski (SAC, 2008)

A Sparse Flat Extension Theorem for Moment Matrices - Monique Laurent; Bernard Mourrain (CoRR, 2008)

Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals. - Jean B. Lasserre; Monique Laurent; Philipp Rostalski (Found. Comput. Math., 2008)

The Operator Psi for the Chromatic Number of a Graph. - Nebojsa Gvozdenovic; Monique Laurent (SIAM J. Optim., 2008)

Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization. - Nebojsa Gvozdenovic; Monique Laurent (SIAM J. Optim., 2008)

Block-diagonal semidefinite programming hierarchies for 0/1 programming. - Nebojsa Gvozdenovic; Monique Laurent; Frank Vallentin (Oper. Res. Lett., 2009)

A prolongation-projection algorithm for computing the finite real variety of an ideal. - Jean B. Lasserre; Monique Laurent; Philipp Rostalski (Theor. Comput. Sci., 2009)

Matrix Completion Problems. - Monique Laurent (Encyclopedia of Optimization, 2009)

Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube. - Etienne de Klerk; Monique Laurent (SIAM J. Optim., 2010)

On Leonid Gurvits's Proof for Permanents. - Monique Laurent; Alexander Schrijver (Am. Math. Mon., 2010)

Computing the Grothendieck constant of some graph classes. - Monique Laurent; Antonios Varvitsiotis (Oper. Res. Lett., 2011)

On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems. - Etienne de Klerk; Monique Laurent (SIAM J. Optim., 2011)

The Gram Dimension of a Graph. - Monique Laurent; Antonios Varvitsiotis (ISCO, 2012)

On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices - Marianna Eisenberg-Nagy; Monique Laurent; Antonios Varvitsiotis (CoRR, 2012)

A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs. - João Gouveia; Monique Laurent; Pablo A. Parrilo; Rekha R. Thomas (Math. Program., 2012)

Moment matrices, border bases and real radical computation. - Jean-Bernard Lasserre; Monique Laurent; Bernard Mourrain; Philipp Rostalski; Philippe Trebuchet (J. Symb. Comput., 2013)

The Quadratic Assignment Problem is easy for Robinsonian Matrices. - Monique Laurent; Matteo Seminaroti (CoRR, 2014)

Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope. - Marianna Eisenberg-Nagy; Monique Laurent; Antonios Varvitsiotis (J. Comb. Theory B, 2014)

Handelman's hierarchy for the maximum stable set problem. - Monique Laurent; Zhao Sun (J. Glob. Optim., 2014)

A new graph parameter related to bounded rank positive semidefinite matrix completions. - Monique Laurent; Antonios Varvitsiotis (Math. Program., 2014)

On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings. - Sabine Burgdorf; Monique Laurent; Teresa Piovesan (TQC, 2015)

An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex. - Etienne de Klerk; Monique Laurent; Zhao Sun (Math. Program., 2015)

The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure. - Monique Laurent; Matteo Seminaroti (Oper. Res. Lett., 2015)

An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution. - Etienne de Klerk; Monique Laurent; Zhao Sun (SIAM J. Optim., 2015)

Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone. - Monique Laurent; Teresa Piovesan (SIAM J. Optim., 2015)

Entanglement-Assisted Zero-Error Source-Channel Coding. - Jop Briët; Harry Buhrman; Monique Laurent; Teresa Piovesan; Giannicola Scarpa (IEEE Trans. Inf. Theory, 2015)

A Structural Characterization for Certifying Robinsonian Matrices. - Monique Laurent; Matteo Seminaroti; Shin-ichi Tanigawa (Electron. J. Comb., 2017)

A Lex-BFS-based recognition algorithm for Robinsonian matrices. - Monique Laurent; Matteo Seminaroti (Discret. Appl. Math., 2017)

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. - Etienne de Klerk; Jean B. Lasserre; Monique Laurent; Zhao Sun (Math. Oper. Res., 2017)

Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization. - Etienne de Klerk; Monique Laurent; Zhao Sun (Math. Program., 2017)

On the convergence rate of grid search for polynomial optimization over the simplex. - Etienne de Klerk; Monique Laurent; Zhao Sun; Juan C. Vera 001 (Optim. Lett., 2017)

Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition. - Monique Laurent; Matteo Seminaroti (SIAM J. Discret. Math., 2017)

Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization. - Etienne de Klerk; Roxana Hess; Monique Laurent (SIAM J. Optim., 2017)

Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing. - Etienne de Klerk; Monique Laurent (Math. Oper. Res., 2018)

Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. - Sander Gribling; David de Laat; Monique Laurent (Math. Program., 2018)

On the linear extension complexity of stable set polytopes for perfect graphs. - Hao Hu; Monique Laurent (Eur. J. Comb., 2019)

Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization. - Sander Gribling; David de Laat; Monique Laurent (Found. Comput. Math., 2019)

Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube. - Etienne de Klerk; Monique Laurent (Math. Oper. Res., 2020)

Perfect elimination orderings for symmetric matrices. - Monique Laurent; Shin-ichi Tanigawa (Optim. Lett., 2020)

Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization. - Lucas Slot; Monique Laurent (Math. Program., 2021)

Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling. - Daniel Brosch; Monique Laurent; Andries Steenkamp (SIAM J. Optim., 2021)

Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. - Etienne de Klerk; Monique Laurent (Math. Program., 2022)

Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets. - Lucas Slot; Monique Laurent (Math. Program., 2022)

Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph. - Monique Laurent; Luis Felipe Vargas (SIAM J. Optim., 2022)

Sum-of-squares hierarchies for binary polynomial optimization. - Lucas Slot; Monique Laurent (Math. Program., 2023)

An effective version of Schmüdgen's Positivstellensatz for the hypercube. - Monique Laurent; Lucas Slot (Optim. Lett., 2023)

Exactness of Parrilo's Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph. - Monique Laurent; Luis Felipe Vargas (Math. Oper. Res., 2023)

Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks. - Milan Korda; Monique Laurent; Victor Magron; Andries Steenkamp (Math. Program., 2024)

Semidefinite Approximations for Bicliques and Bi-Independent Pairs. - Monique Laurent; Sven C. Polak; Luis Felipe Vargas (Math. Oper. Res., 2025)