default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMonique Laurent
Person information
- affiliation: Tilburg University, The Netherlands
- affiliation: Centrum Wiskunde & Informatica
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j85]Milan Korda, Monique Laurent
, Victor Magron, Andries Steenkamp:
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks. Math. Program. 205(1): 703-744 (2024)- 2023
- [j84]Monique Laurent, Luis Felipe Vargas:
Exactness of Parrilo's Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph. Math. Oper. Res. 48(2): 1017-1043 (2023) - [j83]Lucas Slot, Monique Laurent:
Sum-of-squares hierarchies for binary polynomial optimization. Math. Program. 197(2): 621-660 (2023) - [j82]Monique Laurent, Lucas Slot:
An effective version of Schmüdgen's Positivstellensatz for the hypercube. Optim. Lett. 17(3): 515-530 (2023) - 2022
- [j81]Etienne de Klerk, Monique Laurent:
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Math. Program. 193(2): 665-685 (2022) - [j80]Lucas Slot, Monique Laurent:
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets. Math. Program. 193(2): 831-871 (2022) - [j79]Monique Laurent, Luis Felipe Vargas:
Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph. SIAM J. Optim. 32(2): 491-518 (2022) - 2021
- [j78]Lucas Slot, Monique Laurent:
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization. Math. Program. 188(2): 443-460 (2021) - [j77]Daniel Brosch, Monique Laurent, Andries Steenkamp:
Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling. SIAM J. Optim. 31(3): 2227-2254 (2021) - [c13]Lucas Slot, Monique Laurent:
Sum-of-Squares Hierarchies for Binary Polynomial Optimization. IPCO 2021: 43-57 - 2020
- [j76]Etienne de Klerk, Monique Laurent:
Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube. Math. Oper. Res. 45(1): 86-98 (2020) - [j75]Monique Laurent, Shin-ichi Tanigawa:
Perfect elimination orderings for symmetric matrices. Optim. Lett. 14(2): 339-353 (2020)
2010 – 2019
- 2019
- [j74]Hao Hu, Monique Laurent:
On the linear extension complexity of stable set polytopes for perfect graphs. Eur. J. Comb. 80: 247-260 (2019) - [j73]Sander Gribling, David de Laat, Monique Laurent:
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization. Found. Comput. Math. 19(5): 1013-1070 (2019) - 2018
- [j72]Etienne de Klerk, Monique Laurent:
Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing. Math. Oper. Res. 43(4): 1317-1325 (2018) - [j71]Sander Gribling, David de Laat, Monique Laurent:
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Math. Program. 170(1): 5-42 (2018) - 2017
- [j70]Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa:
A Structural Characterization for Certifying Robinsonian Matrices. Electron. J. Comb. 24(2): 2 (2017) - [j69]Monique Laurent, Matteo Seminaroti:
A Lex-BFS-based recognition algorithm for Robinsonian matrices. Discret. Appl. Math. 222: 151-165 (2017) - [j68]Etienne de Klerk, Jean B. Lasserre, Monique Laurent, Zhao Sun:
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. Math. Oper. Res. 42(3): 834-853 (2017) - [j67]Etienne de Klerk, Monique Laurent, Zhao Sun:
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization. Math. Program. 162(1-2): 363-392 (2017) - [j66]Etienne de Klerk, Monique Laurent, Zhao Sun, Juan C. Vera:
On the convergence rate of grid search for polynomial optimization over the simplex. Optim. Lett. 11(3): 597-608 (2017) - [j65]Monique Laurent, Matteo Seminaroti:
Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition. SIAM J. Discret. Math. 31(3): 1765-1800 (2017) - [j64]Etienne de Klerk, Roxana Hess, Monique Laurent:
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization. SIAM J. Optim. 27(1): 347-367 (2017) - [i8]Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa:
A Structural Characterization for Certifying Robinsonian Matrices. CoRR abs/1701.00806 (2017) - 2016
- [i7]Monique Laurent, Matteo Seminaroti:
Similarity-First Search: a new algorithm with application to Robinsonian matrix recognition. CoRR abs/1601.03521 (2016) - 2015
- [j63]Etienne de Klerk, Monique Laurent, Zhao Sun:
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex. Math. Program. 151(2): 433-457 (2015) - [j62]Monique Laurent, Matteo Seminaroti:
The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure. Oper. Res. Lett. 43(1): 103-109 (2015) - [j61]Etienne de Klerk, Monique Laurent, Zhao Sun:
An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution. SIAM J. Optim. 25(3): 1498-1514 (2015) - [j60]Monique Laurent, Teresa Piovesan:
Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone. SIAM J. Optim. 25(4): 2461-2493 (2015) - [j59]Jop Briët, Harry Buhrman, Monique Laurent, Teresa Piovesan, Giannicola Scarpa:
Entanglement-Assisted Zero-Error Source-Channel Coding. IEEE Trans. Inf. Theory 61(2): 1124-1138 (2015) - [c12]Monique Laurent, Matteo Seminaroti:
A Lex-BFS-Based Recognition Algorithm for Robinsonian Matrices. CIAC 2015: 325-338 - [c11]Sabine Burgdorf, Monique Laurent, Teresa Piovesan:
On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings. TQC 2015: 127-146 - [i6]Monique Laurent, Matteo Seminaroti:
A Lex-BFS-based recognition algorithm for Robinsonian matrices. CoRR abs/1504.06586 (2015) - 2014
- [j58]Marianna Eisenberg-Nagy, Monique Laurent, Antonios Varvitsiotis:
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope. J. Comb. Theory B 108: 40-80 (2014) - [j57]Monique Laurent, Zhao Sun:
Handelman's hierarchy for the maximum stable set problem. J. Glob. Optim. 60(3): 393-423 (2014) - [j56]Monique Laurent, Antonios Varvitsiotis:
A new graph parameter related to bounded rank positive semidefinite matrix completions. Math. Program. 145(1-2): 291-325 (2014) - [i5]Monique Laurent, Matteo Seminaroti:
The Quadratic Assignment Problem is easy for Robinsonian Matrices. CoRR abs/1407.2801 (2014) - 2013
- [j55]Jean-Bernard Lasserre, Monique Laurent, Bernard Mourrain, Philipp Rostalski, Philippe Trebuchet:
Moment matrices, border bases and real radical computation. J. Symb. Comput. 51: 63-85 (2013) - [i4]Monique Laurent, Zhao Sun:
Handelman's hierarchy for the maximum stable set problem. CTW 2013: 155-158 - 2012
- [j54]João Gouveia, Monique Laurent, Pablo A. Parrilo, Rekha R. Thomas:
A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs. Math. Program. 133(1-2): 203-225 (2012) - [c10]Monique Laurent, Antonios Varvitsiotis:
The Gram Dimension of a Graph. ISCO 2012: 356-367 - [i3]Monique Laurent, Antonios Varvitsiotis:
A new graph parameter related to bounded rank positive semidefinite matrix completions. CoRR abs/1204.0734 (2012) - [i2]Marianna Eisenberg-Nagy, Monique Laurent, Antonios Varvitsiotis:
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices. CoRR abs/1205.2040 (2012) - 2011
- [j53]Monique Laurent, Antonios Varvitsiotis:
Computing the Grothendieck constant of some graph classes. Oper. Res. Lett. 39(6): 452-456 (2011) - [j52]Etienne de Klerk, Monique Laurent:
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems. SIAM J. Optim. 21(3): 824-832 (2011) - [c9]Monique Laurent, Antonios Varvitsiotis:
Computing the Grothendieck constant of some graph classes. CTW 2011: 184-188 - 2010
- [j51]Etienne de Klerk, Monique Laurent:
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube. SIAM J. Optim. 20(6): 3104-3120 (2010) - [j50]Monique Laurent, Alexander Schrijver:
On Leonid Gurvits's Proof for Permanents. Am. Math. Mon. 117(10): 903-911 (2010)
2000 – 2009
- 2009
- [j49]Nebojsa Gvozdenovic, Monique Laurent, Frank Vallentin:
Block-diagonal semidefinite programming hierarchies for 0/1 programming. Oper. Res. Lett. 37(1): 27-31 (2009) - [j48]Jean B. Lasserre, Monique Laurent, Philipp Rostalski:
A prolongation-projection algorithm for computing the finite real variety of an ideal. Theor. Comput. Sci. 410(27-29): 2685-2700 (2009) - [r1]Monique Laurent:
Matrix Completion Problems. Encyclopedia of Optimization 2009: 1967-1975 - 2008
- [j47]Jean B. Lasserre, Monique Laurent, Philipp Rostalski:
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals. Found. Comput. Math. 8(5): 607-647 (2008) - [j46]Nebojsa Gvozdenovic, Monique Laurent:
The Operator Psi for the Chromatic Number of a Graph. SIAM J. Optim. 19(2): 572-591 (2008) - [j45]Nebojsa Gvozdenovic, Monique Laurent:
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization. SIAM J. Optim. 19(2): 592-615 (2008) - [c8]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 - [i1]Monique Laurent, Bernard Mourrain:
A Sparse Flat Extension Theorem for Moment Matrices. CoRR abs/0812.2563 (2008) - 2007
- [j44]Monique Laurent:
Semidefinite representations for finite varieties. Math. Program. 109(1): 1-26 (2007) - [j43]Monique Laurent:
Strengthened semidefinite programming bounds for codes. Math. Program. 109(2-3): 239-261 (2007) - [j42]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
- [j41]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) - [c7]Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger:
New Limits on Fault-Tolerant Quantum Computation. FOCS 2006: 411-419 - 2005
- [j40]Dorina Jibetean, Monique Laurent:
Semidefinite Approximations for Global Unconstrained Polynomial Optimization. SIAM J. Optim. 16(2): 490-514 (2005) - [c6]Nebojsa Gvozdenovic, Monique Laurent:
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials. IPCO 2005: 136-151 - 2004
- [p1]Monique Laurent:
Semidefinite Relaxations for Max-Cut. The Sharpest Cut 2004: 257-290 - 2003
- [j39]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) - [j38]Monique Laurent:
Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope. Math. Oper. Res. 28(4): 871-883 (2003) - 2002
- [j37]Monique Laurent:
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lov[a-acute]sz--Schrijver Lift-and-Project Procedure. SIAM J. Optim. 12(2): 345-375 (2002) - 2001
- [j36]Monique Laurent:
On the Sparsity Order of a Graph and Its Deficiency in Chordality. Comb. 21(4): 543-570 (2001) - [j35]Monique Laurent:
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems. SIAM J. Matrix Anal. Appl. 22(3): 874-894 (2001) - 2000
- [j34]Jack H. Koolen, Monique Laurent, Alexander Schrijver:
Equilateral Dimension of the Rectilinear Space. Des. Codes Cryptogr. 21(1/3): 149-164 (2000)
1990 – 1999
- 1999
- [j33]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 B 77(1): 25-38 (1999) - 1998
- [j32]Hans-Jürgen Bandelt, Victor Chepoi, Monique Laurent:
Embedding into Rectilinear Spaces. Discret. Comput. Geom. 19(4): 595-604 (1998) - 1997
- [b1]Michel Marie Deza, Monique Laurent:
Geometry of cuts and metrics. Algorithms and combinatorics 15, Springer 1997, ISBN 978-3-540-61611-5, pp. I-XII, 1-587 - [j31]Jack Edmonds, Monique Laurent, Alexander Schrijver:
A minor-monotone graph parameter based on oriented matroids. Discret. Math. 165-166: 219-226 (1997) - [j30]Monique Laurent, Svatopluk Poljak, Franz Rendl:
Connections between semidefinite relaxations of the max-cut and stable set problems. Math. Program. 77: 225-246 (1997) - [j29]Monique Laurent:
Cuts, matrix completions and graph rigidity. Math. Program. 79: 255-283 (1997) - 1996
- [j28]Monique Laurent:
Hilbert bases of cuts. Discret. Math. 150(1-3): 257-279 (1996) - [j27]Monique Laurent:
Graphic vertices of the metric polytope. Discret. Math. 151(1-3): 131-153 (1996) - [j26]Monique Laurent, Svatopluk Poljak:
Gap Inequalities for the Cut Polytope. Eur. J. Comb. 17(2-3): 233-254 (1996) - [j25]Monique Laurent, Svatopluk Poljak:
On the Facial Structure of the Set of Correlation Matrices. SIAM J. Matrix Anal. Appl. 17(3): 530-547 (1996) - 1995
- [j24]Michel Deza, Monique Laurent:
Hypercube Embedding of Generalized Bipartite Metrics. Discret. Appl. Math. 56(2-3): 215-230 (1995) - [j23]Cid C. de Souza, Monique Laurent:
Some New Classes of Facets for the Equicut Polytope. Discret. Appl. Math. 62(1-3): 167-191 (1995) - [j22]A. M. H. Gerards, Monique Laurent:
A Characterization of Box 1/d-Integral Binary Clutters. J. Comb. Theory B 65(2): 186-207 (1995) - [j21]Hein Vanderholst, Monique Laurent, Alexander Schrijver:
On a Minor-Monotone Graph Invariant. J. Comb. Theory B 65(2): 291-304 (1995) - [j20]Monique Laurent, Svatopluk Poljak:
One-third-integrality in the max-cut problem. Math. Program. 71: 29-50 (1995) - 1994
- [j19]Caterina De Simone, Michel Deza, Monique Laurent:
Collapsing and lifting for the cut cone. Discret. Math. 127(1-3): 105-130 (1994) - 1993
- [j18]Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent:
The hypermetric cone is polydedral. Comb. 13(4): 397-411 (1993) - [j17]Tayuan Huang, Monique Laurent:
(s, r; mu)-nets and alternating forms graphs. Discret. Math. 114(1-3): 237-252 (1993) - [j16]Michel Deza, Komei Fukuda, Monique Laurent:
The inequicut cone. Discret. Math. 119(1-3): 21-48 (1993) - [j15]Michel Deza, Monique Laurent:
The even and odd cut polytopes. Discret. Math. 119(1-3): 49-66 (1993) - [j14]Michel Deza, Monique Laurent, Svatopluk Poljak:
The cut cone III: On the role of triangle facets. Graphs Comb. 9(2-4): 135-152 (1993) - [c5]Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent:
Hypermetrics in geometry of numbers. Combinatorial Optimization 1993: 1-109 - 1992
- [j13]Michel Deza, Monique Laurent:
Extension operations for cuts. Discret. Math. 106-107: 163-179 (1992) - [j12]Michel Deza, Monique Laurent, Svatopluk Poljak:
The cut cone III: On the role of triangle facets. Graphs Comb. 8(2): 125-142 (1992) - [j11]Michel Deza, Martin Grötschel, Monique Laurent:
Clique-Web Facets for Multicut Polytopes. Math. Oper. Res. 17(4): 981-1000 (1992) - [j10]Michel Deza, Monique Laurent:
Facets for the cut cone I. Math. Program. 56: 121-160 (1992) - [j9]Michel Deza, Monique Laurent:
Facets for the cut cone II: Clique-web inequalities. Math. Program. 56: 161-188 (1992) - [j8]Monique Laurent, Antonio Sassano:
A characterization of knapsacks with the max-flow- - min-cut property. Oper. Res. Lett. 11(2): 105-110 (1992) - [c4]Monique Laurent, Svatopluk Poljak:
The Metric Polytope. IPCO 1992: 274-286 - 1990
- [c3]Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent:
The Symmetries of the Cut Polytope and of Some Relatives. Applied Geometry And Discrete Mathematics 1990: 205-220 - [c2]Michel Deza, Martin Grötschel, Monique Laurent:
Complete Descriptions of Small Multicut Polytopes. Applied Geometry And Discrete Mathematics 1990: 221-252 - [c1]Michel Deza, Monique Laurent:
New Results on Facets of the Cut Cone. IPCO 1990: 171-184
1980 – 1989
- 1989
- [j7]Monique Laurent, Michel Deza:
Bouquets of geometric lattices: some algebraic and topological aspects. Discret. Math. 75(1-3): 279-313 (1989) - [j6]Monique Laurent:
A generalization of antiwebs to independence systems and their canonical facets. Math. Program. 45(1-3): 97-108 (1989) - [j5]Michele Conforti, Monique Laurent:
On the geometric structure of independence systems. Math. Program. 45(1-3): 255-277 (1989) - 1988
- [j4]Michele Conforti, Monique Laurent:
A characterization of matroidal systems of inequalities. Discret. Math. 69(2): 165-171 (1988) - [j3]Michele Conforti, Monique Laurent:
On the Facial Structure of Independence System Polyhedra. Math. Oper. Res. 13(4): 543-555 (1988) - 1986
- [j2]Monique Laurent:
Upper Bounds for the Cardinality of s-Distances Codes. Eur. J. Comb. 7(1): 27-41 (1986) - 1984
- [j1]Etienne Pays, Marie-France Delauw, Monique Laurent, Maurice Steinert:
Possible DNA modification in GC dinucleotides of Trypanosoma brucei telomeric sequences; relationship with antigen gene transcription. Nucleic Acids Res. 12(13): 5235-5247 (1984)
Coauthor Index
Michel Deza
aka: Michel Marie Deza
aka: Michel Marie Deza
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
