| Publication | Date of Publication | Type |
|---|
| Computing the EHZ capacity is \(\operatorname{NP}\)-hard | 2024-12-12 | Paper |
| A semidefinite programming hierarchy for covering problems in discrete geometry | 2023-12-18 | Paper |
| Least distortion Euclidean embeddings of flat tori | 2023-11-03 | Paper |
| A recursive theta body for hypergraphs | 2023-10-04 | Paper |
| Critical Even Unimodular Lattices in the Gaussian Core Model | 2023-04-05 | Paper |
| A semidefinite program for least distortion embeddings of flat tori into Hilbert spaces | 2022-10-21 | Paper |
| A recursive Lovász theta number for simplex-avoiding sets | 2022-08-23 | Paper |
| \(k\)-point semidefinite programming bounds for equiangular lines | 2022-06-29 | Paper |
| Complete positivity and distance-avoiding sets | 2022-03-22 | Paper |
| Coloring the Voronoi tessellation of lattices | 2021-12-16 | Paper |
| Semidefinite programming bounds for error-correcting codes | 2021-11-26 | Paper |
| A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices | 2021-11-04 | Paper |
| Critical even unimodular lattices in the Gaussian core model | 2021-05-17 | Paper |
| A simplex algorithm for rational cp-factorization | 2021-04-23 | Paper |
| New dense superball packings in three dimensions | 2021-04-19 | Paper |
| On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension | 2020-10-20 | Paper |
| A polynomial time algorithm for solving the closest vector problem in zonotopal lattices | 2020-04-16 | Paper |
| Computing upper bounds for the packing density of congruent copies of a convex body | 2019-06-12 | Paper |
| A COUNTEREXAMPLE TO A CONJECTURE OF LARMAN AND ROGERS ON SETS AVOIDING DISTANCE 1 | 2019-05-23 | Paper |
| Covering compact metric spaces greedily | 2018-07-23 | Paper |
| New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry | 2017-10-10 | Paper |
| Rational factorizations of completely positive matrices | 2017-08-28 | Paper |
| A Breakthrough in Sphere Packing: The Search for Magic Functions | 2017-05-18 | Paper |
| A copositive formulation for the stability number of infinite graphs | 2016-11-25 | Paper |
| On the Turing model complexity of interior point methods for semidefinite programming | 2016-09-23 | Paper |
| Invariant Semidefinite Programs | 2016-04-26 | Paper |
| A semidefinite programming hierarchy for packing problems in discrete geometry | 2015-06-19 | Paper |
| Upper bounds for packings of spheres of several radii | 2015-01-28 | Paper |
| Spectral bounds for the independence ratio and the chromatic number of an operator | 2014-10-24 | Paper |
| Grothendieck inequalities for semidefinite programs with rank constraint | 2014-10-06 | Paper |
| Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs | 2014-08-08 | Paper |
| Mathematical optimization for packing problems | 2014-03-05 | Paper |
| A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces | 2013-12-23 | Paper |
| Bounds for projective codes from semidefinite programming | 2013-05-06 | Paper |
| Inhomogeneous extreme forms | 2013-05-02 | Paper |
| Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\) | 2010-11-11 | Paper |
| The contact polytope of the Leech lattice | 2010-11-08 | Paper |
| Complexity and algorithms for computing Voronoi cells of lattices | 2010-11-07 | Paper |
| The Positive Semidefinite Grothendieck Problem with Rank Constraint | 2010-09-07 | Paper |
| High-Accuracy Semidefinite Programming Bounds for Kissing Numbers | 2010-08-13 | Paper |
| New upper bounds for kissing numbers from semidefinite programming | 2010-07-22 | Paper |
| Lower bounds for measurable chromatic numbers | 2010-01-04 | Paper |
| Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps | 2009-04-08 | Paper |
| Optimality and uniqueness of the \((4,10,1/6)\) spherical code | 2009-03-04 | Paper |
| Block-diagonal semidefinite programming hierarchies for 0/1 programming | 2009-02-23 | Paper |
| Symmetry in semidefinite programs | 2008-12-02 | Paper |
| The isodiametric problem with lattice-point constraints | 2008-11-25 | Paper |
| Lecture notes: Semidefinite programs and harmonic analysis | 2008-09-11 | Paper |
| A generalization of Voronoi's reduction theory and its application | 2008-04-10 | Paper |
| Optimal distortion embeddings of distance regular graphs into Euclidean spaces | 2007-12-10 | Paper |
| Classification of eight-dimensional perfect forms | 2007-04-13 | Paper |
| Lattice Delone simplices with super-exponential volume | 2007-03-27 | Paper |
| Incremental Algorithms for Lattice Problems | 2006-04-13 | Paper |
| Computational approaches to lattice packing and covering problems | 2006-03-21 | Paper |
| Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8 | 2006-01-03 | Paper |
| Methods in the Local Theory of Packing and Covering Lattices | 2004-12-16 | Paper |
| A Note on Space Tiling Zonotopes | 2004-02-04 | Paper |
| Computing the EHZ capacity is NP-hard | N/A | Paper |
