114 citations · 264 across the 42 of their papers we have counts for
6 papers · 1 filter
Semidefinite approximations for bicliques and biindependent pairs
Monique Laurent, Sven Polak, Luis Felipe Vargas
We investigate some graph parameters dealing with biindependent pairs in a bipartite graph , i.e., pairs where , …
On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs
Hao Hu, Monique Laurent
We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfec…
Perfect Elimination Orderings for Symmetric Matrices
Monique Laurent, Shin-ichi Tanigawa
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common f…
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
Marianna Eisenberg-Nagy, Monique Laurent, Antonios Varvitsiotis
We study a new geometric graph parameter $\egd(G)$, defined as the smallest integer for which any partial symmetric matrix which is completable to a correlation matrix and…
The Gram dimension of a graph
Monique Laurent, Antonios Varvitsiotis
The Gram dimension $\gd(G)$ of a graph is the smallest integer such that, for every assignment of unit vectors to the nodes of the graph, there exists another assignment…
Computing the Grothendieck constant of some graph classes
Monique Laurent, Antonios Varvitsiotis
Given a graph and , consider the integer program and its canonical semidefinite programming relaxatio…