| Publication | Date of Publication | Type |
|---|
Computing the EHZ capacity is \(\operatorname{NP}\)-hard
Proceedings of the American Mathematical Society. Series B | 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
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
A recursive theta body for hypergraphs
Combinatorica | 2023-10-04 | Paper |
Critical Even Unimodular Lattices in the Gaussian Core Model
IMRN. International Mathematics Research Notices | 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
Proceedings of the American Mathematical Society | 2022-08-23 | Paper |
\(k\)-point semidefinite programming bounds for equiangular lines
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
Complete positivity and distance-avoiding sets
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Coloring the Voronoi tessellation of lattices
Journal of the London Mathematical Society | 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
SIAM Journal on Discrete Mathematics | 2021-11-04 | Paper |
Critical even unimodular lattices in the Gaussian core model
| 2021-05-17 | Paper |
A simplex algorithm for rational cp-factorization
Mathematical Programming. Series A. Series B | 2021-04-23 | Paper |
New dense superball packings in three dimensions
advg | 2021-04-19 | Paper |
On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension
discrete Analysis | 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
Mathematika | 2019-05-23 | Paper |
Covering compact metric spaces greedily
Acta Mathematica Hungarica | 2018-07-23 | Paper |
New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
Discrete & Computational Geometry | 2017-10-10 | Paper |
Rational factorizations of completely positive matrices
Linear Algebra and its Applications | 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
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
On the Turing model complexity of interior point methods for semidefinite programming
SIAM Journal on Optimization | 2016-09-23 | Paper |
Invariant Semidefinite Programs
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
A semidefinite programming hierarchy for packing problems in discrete geometry
Mathematical Programming. Series A. Series B | 2015-06-19 | Paper |
Upper bounds for packings of spheres of several radii
Forum of Mathematics, Sigma | 2015-01-28 | Paper |
Spectral bounds for the independence ratio and the chromatic number of an operator
Israel Journal of Mathematics | 2014-10-24 | Paper |
Grothendieck inequalities for semidefinite programs with rank constraint
Theory of Computing | 2014-10-06 | Paper |
Fourier analysis on finite groups and the Lovász \(\vartheta\)-number of Cayley graphs
Experimental Mathematics | 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
Geometriae Dedicata | 2013-12-23 | Paper |
Bounds for projective codes from semidefinite programming
Advances in Mathematics of Communications | 2013-05-06 | Paper |
Inhomogeneous extreme forms
Annales de l’institut Fourier | 2013-05-02 | Paper |
Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
Journal of the European Mathematical Society (JEMS) | 2010-11-11 | Paper |
The contact polytope of the Leech lattice
Discrete & Computational Geometry | 2010-11-08 | Paper |
Complexity and algorithms for computing Voronoi cells of lattices
Mathematics of Computation | 2010-11-07 | Paper |
The positive semidefinite Grothendieck problem with rank constraint
Automata, Languages and Programming | 2010-09-07 | Paper |
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
Experimental Mathematics | 2010-08-13 | Paper |
New upper bounds for kissing numbers from semidefinite programming
Journal of the American Mathematical Society | 2010-07-22 | Paper |
Lower bounds for measurable chromatic numbers
Geometric and Functional Analysis. GAFA | 2010-01-04 | Paper |
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
European Journal of Combinatorics | 2009-04-08 | Paper |
Optimality and uniqueness of the \((4,10,1/6)\) spherical code
Journal of Combinatorial Theory. Series A | 2009-03-04 | Paper |
Block-diagonal semidefinite programming hierarchies for 0/1 programming
Operations Research Letters | 2009-02-23 | Paper |
Symmetry in semidefinite programs
Linear Algebra and its Applications | 2008-12-02 | Paper |
The isodiametric problem with lattice-point constraints
Monatshefte für Mathematik | 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
Duke Mathematical Journal | 2008-04-10 | Paper |
Optimal distortion embeddings of distance regular graphs into Euclidean spaces
Journal of Combinatorial Theory. Series B | 2007-12-10 | Paper |
Classification of eight-dimensional perfect forms
Electronic Research Announcements of the American Mathematical Society | 2007-04-13 | Paper |
Lattice Delone simplices with super-exponential volume
European Journal of Combinatorics | 2007-03-27 | Paper |
Incremental Algorithms for Lattice Problems
| 2006-04-13 | Paper |
Computational approaches to lattice packing and covering problems
Discrete & Computational Geometry | 2006-03-21 | Paper |
Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8
IMRN. International Mathematics Research Notices | 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 |
