| Publication | Date of Publication | Type |
|---|
Semidefinite network games: multiplayer minimax and complementarity problems
Journal of Optimization Theory and Applications | 2026-03-03 | Paper |
The Lovász theta function for recovering planted clique covers and graph colorings
SIAM Journal on Optimization | 2025-09-10 | Paper |
Multiplicative updates for symmetric-cone factorizations
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
Graph isomorphism: physical resources, optimization models, and algebraic characterizations
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
Analysis of optimization algorithms via sum-of-squares
Journal of Optimization Theory and Applications | 2021-08-18 | Paper |
Correlation matrices, Clifford algebras, and completely positive semidefinite rank
Linear and Multilinear Algebra | 2021-01-21 | Paper |
Vector coloring the categorical product of graphs
Mathematical Programming. Series A. Series B | 2020-06-26 | Paper |
| Relaxations of graph isomorphism | 2020-05-27 | Paper |
Graph homomorphisms via vector colorings
European Journal of Combinatorics | 2019-06-18 | Paper |
Graph homomorphisms via vector colorings
European Journal of Combinatorics | 2019-06-18 | Paper |
Quantum and non-signalling graph isomorphisms
Journal of Combinatorial Theory. Series B | 2019-06-17 | Paper |
Quantum and non-signalling graph isomorphisms
Journal of Combinatorial Theory. Series B | 2019-06-17 | Paper |
Completely positive semidefinite rank
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
Universal completability, least eigenvalue frameworks, and vector colorings
Discrete & Computational Geometry | 2017-10-10 | Paper |
Linear conic formulations for two-party correlations and values of nonlocal games
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
The excluded minors for isometric realizability in the plane
SIAM Journal on Discrete Mathematics | 2017-03-16 | Paper |
| Graph cores via universal completability | 2016-10-14 | Paper |
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
Journal of Combinatorial Theory. Series B | 2014-09-04 | Paper |
A new graph parameter related to bounded rank positive semidefinite matrix completions
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
Linear Algebra and its Applications | 2014-06-04 | Paper |
Complexity of the positive semidefinite matrix completion problem with a rank constraint
Discrete Geometry and Optimization | 2013-09-13 | Paper |
Mixed volume and distance geometry techniques for counting Euclidean embeddings of rigid graphs
Distance Geometry | 2013-07-29 | Paper |
The Gram dimension of a graph
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Computing the Grothendieck constant of some graph classes
Operations Research Letters | 2012-04-05 | Paper |
Algebraic methods for counting Euclidean embeddings of rigid graphs
Graph Drawing | 2010-04-27 | Paper |
