| Publication | Date of Publication | Type |
|---|
| Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks | 2024-04-09 | Paper |
| Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph | 2024-02-23 | Paper |
| An effective version of Schmüdgen's Positivstellensatz for the hypercube | 2023-03-24 | Paper |
| Sum-of-squares hierarchies for binary polynomial optimization | 2023-03-14 | Paper |
| Copositive matrices, sums of squares and the stability number of a graph | 2023-02-09 | Paper |
| On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices | 2022-07-26 | Paper |
| Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere | 2022-06-14 | Paper |
| Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets | 2022-06-14 | Paper |
| Bounding the separable rank via polynomial optimization | 2022-06-01 | Paper |
| Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph | 2022-04-29 | Paper |
| Sum-of-squares hierarchies for binary polynomial optimization | 2021-12-21 | Paper |
| Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling | 2021-09-24 | Paper |
| An effective version of Schm\"udgen's Positivstellensatz for the hypercube | 2021-09-20 | Paper |
| Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization | 2021-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116996 | 2020-08-19 | Paper |
| A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis | 2020-07-07 | Paper |
| Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube | 2020-04-30 | Paper |
| Perfect elimination orderings for symmetric matrices | 2020-04-27 | Paper |
| Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing | 2020-03-12 | Paper |
| Lower bounds on matrix factorization ranks via noncommutative polynomial optimization | 2019-10-17 | Paper |
| On the linear extension complexity of stable set polytopes for perfect graphs | 2019-07-10 | Paper |
| The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure | 2018-09-28 | Paper |
| A Lex-BFS-based recognition algorithm for Robinsonian matrices | 2018-09-25 | Paper |
| Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization | 2018-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4602276 | 2018-01-09 | Paper |
| On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings | 2017-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4589032 | 2017-11-06 | Paper |
| Bound-Constrained Polynomial Optimization Using Only Elementary Calculations | 2017-09-22 | Paper |
| Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition | 2017-08-31 | Paper |
| Lower bounds on matrix factorization ranks via noncommutative polynomial optimization | 2017-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5278025 | 2017-07-12 | Paper |
| A structural characterization for certifying Robinsonian matrices | 2017-05-18 | Paper |
| Entanglement-Assisted Zero-Error Source-Channel Coding | 2017-04-28 | Paper |
| On the convergence rate of grid search for polynomial optimization over the simplex | 2017-04-05 | Paper |
| Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization | 2017-03-23 | Paper |
| Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization | 2017-03-10 | Paper |
| Matrices with high completely positive semidefinite rank | 2016-11-25 | Paper |
| The Approach of Moments for Polynomial Equations | 2016-04-26 | Paper |
| Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone | 2015-12-11 | Paper |
| A Lex-BFS-based recognition algorithm for Robinsonian matrices | 2015-09-21 | Paper |
| An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution | 2015-08-18 | Paper |
| An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex | 2015-06-19 | Paper |
| Handelman's hierarchy for the maximum stable set problem | 2014-12-11 | Paper |
| Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope | 2014-09-04 | Paper |
| A new graph parameter related to bounded rank positive semidefinite matrix completions | 2014-06-27 | Paper |
| Entanglement-Assisted Zero-Error Source-Channel Coding | 2014-06-11 | Paper |
| Positive semidefinite matrix completion, universal rigidity and the strong Arnold property | 2014-06-04 | Paper |
| Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint | 2013-09-13 | Paper |
| Moment matrices, border bases and real radical computation | 2013-03-11 | Paper |
| The Gram Dimension of a Graph | 2012-11-02 | Paper |
| A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs | 2012-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2889301 | 2012-06-06 | Paper |
| Computing the Grothendieck constant of some graph classes | 2012-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113173 | 2012-02-08 | Paper |
| On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems | 2012-01-09 | Paper |
| Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube | 2011-03-21 | Paper |
| On Leonid Gurvits’s Proof for Permanents | 2011-01-25 | Paper |
| A generalized flat extension theorem for moment matrices | 2009-11-23 | Paper |
| Geometry of cuts and metrics | 2009-10-28 | Paper |
| Semidefinite characterization and computation of zero-dimensional real radical ideals | 2009-07-13 | Paper |
| A prolongation-projection algorithm for computing the finite real variety of an ideal | 2009-07-10 | Paper |
| The Operator $\Psi$ for the Chromatic Number of a Graph | 2009-05-27 | Paper |
| Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization | 2009-05-27 | Paper |
| Block-diagonal semidefinite programming hierarchies for 0/1 programming | 2009-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601989 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601990 | 2009-02-12 | Paper |
| Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials | 2007-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5292090 | 2007-06-19 | Paper |
| Semidefinite bounds for the stability number of a graph via sums of squares of polynomials | 2007-04-19 | Paper |
| Semidefinite representations for finite varieties | 2007-03-05 | Paper |
| Strengthened semidefinite programming bounds for codes | 2007-03-05 | Paper |
| A PTAS for the minimization of polynomials of fixed degree over the simplex | 2006-09-14 | Paper |
| Semidefinite Approximations for Global Unconstrained Polynomial Optimization | 2006-05-30 | Paper |
| A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming | 2005-11-11 | Paper |
| Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope | 2005-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465121 | 2005-08-22 | Paper |
| Revisiting two theorems of Curto and Fialkow on moment matrices | 2005-07-26 | Paper |
| On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex | 2005-06-24 | Paper |
| On the sparsity order of a graph and its deficiency in chordality | 2002-06-25 | Paper |
| Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure | 2002-04-23 | Paper |
| Embedding into rectilinear spaces | 2001-11-27 | Paper |
| Equilateral dimension of the rectilinear space | 2001-10-15 | Paper |
| Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems | 2001-03-19 | Paper |
| Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions | 2000-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400638 | 1999-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398372 | 1998-07-19 | Paper |
| Connection between semidefinite relaxations of the max-cut and stable set problems | 1998-06-08 | Paper |
| Cuts, matrix completions and graph rigidity | 1998-05-25 | Paper |
| A connection between positive semidefinite and Euclidean distance matrix completion problems | 1998-05-04 | Paper |
| Geometry of cuts and metrics | 1997-07-01 | Paper |
| A minor-monotone graph parameter based on oriented matroids | 1997-06-10 | Paper |
| The real positive semidefinite completion problem for series-parallel graphs | 1997-05-11 | Paper |
| On the Facial Structure of the Set of Correlation Matrices | 1997-02-04 | Paper |
| One-third-integrality in the max-cut problem | 1997-02-03 | Paper |
| Gap inequalities for the cut polytope | 1996-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894976 | 1996-10-09 | Paper |
| Graphic vertices of the metric polytope | 1996-07-03 | Paper |
| Hilbert bases of cuts | 1996-07-02 | Paper |
| On a minor-monotone graph invariant | 1996-06-05 | Paper |
| Some new classes of facets for the equicut polytope | 1996-05-30 | Paper |
| A characterization of box \(\frac 1d\)-integral binary clutters | 1996-04-08 | Paper |
| Delaunay transformations of a Delaunay polytope | 1996-02-12 | Paper |
| Hypercube embedding of generalized bipartite metrics | 1995-10-03 | Paper |
| On a positive semidefinite relaxation of the cut polytope | 1995-07-24 | Paper |
| Applications of cut polyhedra. II | 1995-07-05 | Paper |
| Application of cut polyhedra. I | 1995-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320817 | 1995-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840771 | 1995-01-01 | Paper |
| The inequicut cone | 1994-12-01 | Paper |
| The hypermetric cone is polyhedral | 1994-12-01 | Paper |
| Collapsing and lifting for the cut cone | 1994-05-05 | Paper |
| \(\ell_ 1\)-rigid graphs | 1994-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137180 | 1994-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137370 | 1994-01-09 | Paper |
| The even and odd cut polytopes | 1993-12-20 | Paper |
| \((s,r;\mu )\)-nets and alternating forms graphs | 1993-10-24 | Paper |
| The cut cone. III: On the role of triangle facets | 1993-08-11 | Paper |
| Clique-Web Facets for Multicut Polytopes | 1993-03-01 | Paper |
| The cut cone. III: On the role of triangle facets | 1993-01-16 | Paper |
| A characterization of knapsacks with the max-flow--min-cut property | 1993-01-16 | Paper |
| Extension operations for cuts | 1993-01-16 | Paper |
| Facets for the cut cone. I | 1993-01-16 | Paper |
| Facets for the cut cone. II: Clique-web inequalities | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3991000 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974968 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974969 | 1992-06-26 | Paper |
| Bouquets of geometric lattices: Some algebraic and topological aspects | 1992-06-25 | Paper |
| A generalization of antiwebs to independence systems and their canonical facets | 1989-01-01 | Paper |
| On the geometric structure of independence systems | 1989-01-01 | Paper |
| A characterization of matroidal systems of inequalities | 1988-01-01 | Paper |
| On the Facial Structure of Independence System Polyhedra | 1988-01-01 | Paper |
| Bouquets of maroids, d-injection geometries and diagrams | 1987-01-01 | Paper |
| Upper bounds for the cardinality of s-distances codes | 1986-01-01 | Paper |
| Semidefinite approximations for bicliques and biindependent pairs | N/A | Paper |
