Monique Laurent
#40,954
Most Influential Person Now
French computer scientist and mathematician
Monique Laurent's AcademicInfluence.com Rankings
Monique Laurentcomputer-science Degrees
Computer Science
#3399
World Rank
#3565
Historical Rank
Theoretical Computer Science
#101
World Rank
#101
Historical Rank
Monique Laurentmathematics Degrees
Mathematics
#2574
World Rank
#3949
Historical Rank
Graph Theory
#96
World Rank
#104
Historical Rank
Measure Theory
#2090
World Rank
#2529
Historical Rank
Download Badge
Computer Science Mathematics
Monique Laurent's Degrees
- PhD Mathematics Paris-Saclay University
- Masters Computer Science Paris-Saclay University
Similar Degrees You Can Earn
Why Is Monique Laurent Influential?
(Suggest an Edit or Addition)According to Wikipedia, Monique Laurent is a French computer scientist and mathematician who is an expert in mathematical optimization. She is a researcher at the Centrum Wiskunde & Informatica in Amsterdam where she is also a member of the Management Team. Laurent also holds a part-time position as a professor of econometrics and operations research at Tilburg University.
Monique Laurent's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Geometry of cuts and metrics (2009) (1077)
- Sums of Squares, Moment Matrices and Optimization Over Polynomials (2009) (834)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming (2001) (452)
- Semidefinite Optimization (2019) (236)
- Semidefinite programming and integer programming (2002) (177)
- SIAM Journal on Optimization (2012) (152)
- Matrix Completion Problems (2009) (128)
- On a positive semidefinite relaxation of the cut polytope (1995) (126)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (2006) (110)
- Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals (2006) (109)
- Semidefinite representations for finite varieties (2007) (108)
- Revisiting two theorems of Curto and Fialkow on moment matrices (2005) (89)
- On the Facial Structure of the Set of Correlation Matrices (1996) (74)
- Facets for the cut cone I (1992) (70)
- Connections between semidefinite relaxations of the max-cut and stable set problems (1997) (68)
- THE OPERATOR FOR THE CHROMATIC NUMBER OF AGRAPH (2008) (65)
- Clique-Web Facets for Multicut Polytopes (1992) (63)
- Applications of cut polyhedra—II (1994) (62)
- New Limits on Fault-Tolerant Quantum Computation (2006) (61)
- A generalized flat extension theorem for moment matrices (2009) (59)
- Applications of cut polyhedra (1992) (59)
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone (2013) (57)
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope (2003) (54)
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube (2010) (53)
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization (2005) (53)
- Strengthened semidefinite programming bounds for codes (2007) (52)
- A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems (1998) (51)
- Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems (2000) (49)
- A connection between positive semidefinite and euclidean distance matrix completion problems (1998) (49)
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems (2011) (48)
- A generalization of antiwebs to independence systems and their canonical facets (1989) (48)
- The real positive semidefinite completion problem for series-parallel graphs (1997) (47)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (2012) (47)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (2005) (47)
- Facets for the cut cone II: Clique-web inequalities (1992) (45)
- Semidefinite characterization and computation of real radical ideals (2006) (44)
- Cuts, matrix completions and graph rigidity (1997) (43)
- Extreme hypermetrics and L-polytopes (1992) (42)
- On the equivalence of algebraic approaches to the minimization of forms on the simplex (2005) (41)
- The hypermetric cone is polyhedral (1993) (40)
- Embedding into Rectilinear Spaces (1998) (38)
- Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization (2014) (36)
- Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property (2013) (36)
- The Symmetries of the Cut Polytope and of Some Relatives (1990) (36)
- The Operator Psi for the Chromatic Number of a Graph (2008) (34)
- Moment matrices, border bases and real radical computation (2011) (32)
- On a Minor-Monotone Graph Invariant (1995) (32)
- Equilateral Dimension of the Rectilinear Space (2000) (31)
- On Leonid Gurvits’s Proof for Permanents (2010) (30)
- A prolongation-projection algorithm for computing the finite real variety of an ideal (2008) (30)
- Gap Inequalities for the Cut Polytope (1996) (30)
- Optimization over polynomials: Selected topics (2014) (30)
- Hypermetric graphs (1993) (29)
- Complete Descriptions of Small Multicut Polytopes (1990) (28)
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (2019) (28)
- Semidefinite Relaxations for Max-Cut (2004) (28)
- Criteria of algebraic independence with multiplicities and approximation by hypersurfaces (2001) (27)
- Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lov[a-acute]sz--Schrijver Lift-and-Project Procedure (2002) (27)
- On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings (2015) (26)
- A characterization of knapsacks with the max-flow- - min-cut property (1992) (26)
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization (2008) (26)
- Bound-Constrained Polynomial Optimization Using Only Elementary Calculations (2015) (25)
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (2014) (25)
- The approach of moments for polynomial equations (2010) (25)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (2007) (25)
- The Metric Polytope (1992) (23)
- Graphic vertices of the metric polytope (1996) (23)
- Matrices With High Completely Positive Semidefinite Rank (2016) (23)
- ℓ1-Rigid Graphs (1994) (23)
- Hypermetrics in geometry of numbers (1993) (23)
- The cut cone III: On the role of triangle facets (1992) (23)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (2009) (22)
- Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube (2018) (22)
- Entanglement-Assisted Zero-Error Source-Channel Coding (2013) (22)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (2013) (21)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (2018) (21)
- Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (2017) (21)
- Collapsing and lifting for the cut cone (1994) (21)
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization (2016) (21)
- Some New Classes of Facets for the Equicut Polytope (1995) (20)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (2016) (20)
- Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization (2017) (20)
- On the Sparsity Order of a Graph and Its Deficiency in Chordality (2001) (20)
- Complexity of the positive semidefinite matrix completion problem with a rank constraint (2012) (19)
- Improved convergence analysis of Lasserre’s measure-based upper bounds for polynomial minimization on compact sets (2019) (19)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (2015) (18)
- On the Facial Structure of Independence System Polyhedra (1988) (18)
- The Gram Dimension of a Graph (2011) (17)
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (2014) (17)
- The inequicut cone (1993) (16)
- A unified approach to computing real and complex zeros of zero-dimensional ideals (2009) (16)
- New Results on Facets of the Cut Cone (1990) (16)
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (2017) (16)
- One-third-integrality in the max-cut problem (1995) (15)
- The even and odd cut polytopes (1993) (13)
- Variety of hypercube embeddings of the equidistant metric and designs (1993) (13)
- Hidden Convexity in Partially Separable Optimization (2011) (13)
- Extension operations for cuts (1992) (13)
- An effective version of Schmüdgen’s Positivstellensatz for the hypercube (2021) (12)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (2012) (12)
- Zero-error source-channel coding with entanglement. (2013) (12)
- Sum-of-squares hierarchies for binary polynomial optimization (2020) (11)
- Bouquets of matroids, d-injection geometries and diagrams (1987) (11)
- A Structural Characterization for Certifying Robinsonian Matrices (2017) (10)
- One-third-integrality in the metric polytope (1992) (9)
- Max-cut problem (1997) (9)
- Semidefinite Programming in Combinatorial and Polynomial Optimization (2008) (9)
- The cut cone III: On the role of triangle facets (1993) (9)
- A Sparse Flat Extension Theorem for Moment Matrices (2008) (8)
- A Characterization of Box 1/d-Integral Binary Clutters (1995) (8)
- Near-optimal analysis of Lasserre’s univariate measure-based bounds for multivariate polynomial optimization (2020) (8)
- Algebraic moments real root finding and related topics (2009) (8)
- Handelman’s hierarchy for the maximum stable set problem (2013) (7)
- On the convergence rate of grid search for polynomial optimization over the simplex (2015) (7)
- Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph (2021) (7)
- Near-optimal analysis of univariate moment bounds for polynomial optimization (2020) (6)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (2021) (6)
- Computing the Grothendieck constant of some graph classes (2011) (6)
- Semidefinite programming formulations for the completely bounded norm of a tensor (2019) (6)
- (s, R; Mu)-nets and Alternating Forms Graphs (1993) (5)
- On the geometric structure of independence systems (1989) (5)
- L 1 -rigid Graphs (1994) (5)
- Isometric Embeddings of Graphs into Hypercubes (1997) (5)
- Upper Bounds for the Cardinality of s-Distances Codes (1986) (5)
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling (2020) (4)
- Hypercube embedding of distances with few values (1994) (4)
- Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm (2008) (4)
- Hypercube Embedding of Generalized Bipartite Metrics (1995) (4)
- On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices (2012) (3)
- The Hilbert Basis of the Cut Cone overthe Complete Graph on Six VerticesFran (1995) (3)
- THE FIBONACCI AND PARACHUTE INEQUALITIES FOR ^ -METRICS (1990) (3)
- Bounding the separable rank via polynomial optimization (2021) (3)
- Moment matrices, border bases and radical computation (2011) (3)
- Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization (2016) (3)
- A new semidefinite programming relaxation for cycles in binary matroids and cuts in graphs (2012) (3)
- Measure Aspects of Cut Polyhedra: ` 1 -embeddability and Probability (1993) (3)
- On the exactness of sum-of-squares approximations for the cone of 5 × 5 copositive matrices (2022) (3)
- A minor-monotone graph parameter based on oriented matroids (1997) (3)
- Hilbert bases of cuts (1996) (3)
- Converging Semidefinite Bounds for Global Unconstrained Polynomial Optimization (2007) (3)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (2022) (2)
- Review of "Jean Bernard Lasserre: An introduction to polynomial and semi-algebraic optimization" (2017) (2)
- On the order of a graph and its deficiency in chordality (1998) (2)
- Copositive vs. moment hierarchies for stable sets (2012) (2)
- Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions (1999) (2)
- A characterization of matroidal systems of inequalities (1988) (1)
- Discussion column - Copositive vs. moment hierarchies for stable sets (2012) (1)
- Bouquets of geometric lattices: some algebraic and topological aspects (1989) (1)
- The Cut Cone and ℓ 1 -Metrics (1997) (1)
- Perfect elimination orderings for symmetric matrices (2017) (1)
- On the Extension Complexity of Stable Set Polytopes for Perfect Graphs (2015) (1)
- LNMB PhD Course Networks and Semidefinite Programming 2012/2013 (2012) (1)
- Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization (2019) (1)
- Delaunay Transformations of a Delaunay Polytope (1996) (1)
- Clique-Web Inequalities (1997) (1)
- Semidefinite approximations for bicliques and biindependent pairs (2023) (0)
- Patrick Fuentes received the Plaquette Centenaire de Camille Flammarion of the Société Astronomique de France. (1997) (0)
- Combinatoriële algoritmen in de bioinformatica (2004) (0)
- Metric Transforms of L 1 -Spaces (1997) (0)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (2010) (0)
- Similarity-First Search (SFS) (2016) (0)
- Preliminaries on Lattices (1997) (0)
- Notes on the Decomposition Result of Karlin Et Al. [2] for the Hierarchy of Lasserre (2012) (0)
- On the Exactness of Sum-of-Squares Approximations for the Cone of $5\times 5$ Copositive Matrices (2022) (0)
- Examples of the Use of the L 1 -Metric (1997) (0)
- Improved convergence analysis of Lasserre’s measure-based upper bounds for polynomial minimization on compact sets (2020) (0)
- Applications of Cut Polyhedra Applications of Cut Polyhedra Contents 1. Introduction 2. Objects 2.1 Cut and Intersection Vectors 2.2 Inequalities (1992) (0)
- Tilburg University On the closure of the completely positive semidefinite cone and linear approximations to quantum (2017) (0)
- A UNIFIED METHODOLOGY FOR REAL AND COMPLEX ZEROS OF ZERO-DIMENSIONAL IDEALS (2007) (0)
- Operations on Valid Inequalities and Facets (1997) (0)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (2013) (0)
- Preliminaries for Squashed Geometries and Diagrams A) Preliminaries for Squashed Geometries. Definition 1.1. Let X Be a Finite Set, F Be a Clutter of Subsets of X And (1987) (0)
- Combinatorial algorithms in bioinformatics (2004) (0)
- Preliminaries on Distances (1997) (0)
- completion problem with a rank constraint (2012) (0)
- Semidenite Programming Characterization and Computation of Real Radical Ideals MEGA 2011 (2011) (0)
- Hypercube Embeddings of the Equidistant Metric (1997) (0)
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (2020) (0)
- Semidefinite Programming in Polynomial Optimization (2005) (0)
- Perfect elimination orderings for symmetric matrices (2017) (0)
- Embeddings of Graphs Embeddings of Graphs (1994) (0)
- Oscar Jespers : sculptures, dessins (1977) (0)
- A real algebraic and symbolic-numeric algorithm (2008) (0)
- The Correlation Cone and {0,1}-Covariances (1997) (0)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (2014) (0)
- Handelman’s hierarchy for the maximum stable set problem (2013) (0)
- Real solving polynomial equations with semidefinite programming (2008) (0)
- Networks and logic - optimization and programming (PNA1) (2002) (0)
- On the convergence rate of grid search for polynomial optimization over the simplex (2016) (0)
- Chapter 2 The Approach of Moments for Polynomial Equations (2017) (0)
- Intensive Convergence Encryption for Secure Deduplication in Cloud (2016) (0)
- Conditions for L 1 -Embeddability (1997) (0)
- Isometric Embeddings of Graphs into Cartesian Products (1997) (0)
- Hypercube Embedding of Distances with Few Values Hypercube Embedding of Distances with Few Values (1993) (0)
- The Rodin Museum guide : In the Hotel Biron/ Monique Laurent ; Photographs by Bruno Jarret (1994) (0)
- Course Networks and Semidefinite Programming 2014 / 2015 (2012) (0)
- Boundson entanglement dimensions and quantum graph parameters via noncommutativepolynomial optimization (0)
- Recognition of Hypercube Embeddable Metrics (1997) (0)
- Recognition of Hypercube Embeddable Metrics (1997) (0)
- Rigidity of the Equidistant Metric (1997) (0)
- Convergence analysis of hierarchies for polynomial optimization (2015) (0)
- Similarity-First Search (2016) (0)
- Copositive matrices, sums of squares and the stability number of a graph (2023) (0)
- Preliminaries on Graphs (1997) (0)
- Semidefinite programming characterization and computation of real radical ideals (2011) (0)
- Semidefinite programming approximations for stable sets, colouring, and cuts in graphs (2009) (0)
- Hilbert Bases of Cuts Hilbert Bases of Cuts (1993) (0)
- Hypercube Embeddings and Designs Hypercube Embeddings and Designs (1994) (0)
- Hypercube Embeddings and Designs Hypercube Embeddings and Designs (1994) (0)
- ℓ 1 -Graphs (1997) (0)
- L 1 -Metrics from Lattices, Semigroups and Normed Spaces (1997) (0)
- On the linear extension complexity of stable set polytopes for perfect graphs (2017) (0)
- O C ] 2 6 O ct 2 01 6 MATRICES WITH HIGH COMPLETELY POSITIVE SEMIDEFINITE RANK (0)
- Delaunay Polytopes: Rank and Hypermetric Faces (1997) (0)
- The Rodin Museum (1984) (0)
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (2018) (0)
- Extreme Delaunay Polytopes (1997) (0)
- Cut Lattices, Quasi h -Distances and Hilbert Bases (1997) (0)
- Algorithms, Combinatorics and Optimization (2003) (0)
- Approximation Algorithms, Quantum Information and Semidefinite Optimization (2015) (0)
- Dimensionality Questions for ℓ 1 -Embeddings (1997) (0)
- Delaunay transformations of a Delaunay polytope (1996) (0)
- Hypermetrics and Delaunay Polytopes (1997) (0)
- A leisurely traveling salesman tour through several facets of cuts (2011) (0)
- Geometry and Optimization in Quantum Information (2022) (0)
- UvA-DARE (Digital Academic Repository) Entanglement-assisted zero-error source-channel coding (2015) (0)
- Other Valid Inequalities and Facets (1997) (0)
- Outline of the Book (1997) (0)
This paper list is powered by the following services:
Other Resources About Monique Laurent
What Schools Are Affiliated With Monique Laurent?
Monique Laurent is affiliated with the following schools:
