On the decomposition of lattices - Boris Hemkemeier; Frank Vallentin (Electron. Colloquium Comput. Complex., 1998)

Computational Approaches to Lattice Packing and Covering Problems. - Achill Schürmann; Frank Vallentin (Discret. Comput. Geom., 2006)

Semidefinite programming bounds for spherical codes. - Christine Bachoc; Frank Vallentin (ISIT, 2007)

Lattice Delone simplices with super-exponential volume. - Francisco Santos; Achill Schürmann; Frank Vallentin (Eur. J. Comb., 2007)

Optimal distortion embeddings of distance regular graphs into Euclidean spaces. - Frank Vallentin (J. Comb. Theory B, 2008)

Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps. - Christine Bachoc; Frank Vallentin (Eur. J. Comb., 2009)

Optimality and uniqueness of the (4, 10, 1/6) spherical code. - Christine Bachoc; Frank Vallentin (J. Comb. Theory A, 2009)

Complexity and algorithms for computing Voronoi cells of lattices. - Mathieu Dutour Sikiric; Achill Schürmann; Frank Vallentin (Math. Comput., 2009)

Block-diagonal semidefinite programming hierarchies for 0/1 programming. - Nebojsa Gvozdenovic; Monique Laurent; Frank Vallentin (Oper. Res. Lett., 2009)

The Positive Semidefinite Grothendieck Problem with Rank Constraint. - Jop Briët; Fernando Mário de Oliveira Filho; Frank Vallentin (ICALP (1), 2010)

The Contact Polytope of the Leech Lattice. - Mathieu Dutour Sikiric; Achill Schürmann; Frank Vallentin (Discret. Comput. Geom., 2010)

High-Accuracy Semidefinite Programming Bounds for Kissing Numbers. - Hans D. Mittelmann; Frank Vallentin (Exp. Math., 2010)

Bounds for projective codes from semidefinite programming. - Christine Bachoc; Alberto Passuello; Frank Vallentin (Adv. Math. Commun., 2013)

Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs. - Evan DeCorte; David de Laat; Frank Vallentin (Exp. Math., 2014)

Grothendieck Inequalities for Semidefinite Programs with Rank Constraint. - Jop Briët; Fernando Mário de Oliveira Filho; Frank Vallentin (Theory Comput., 2014)

A semidefinite programming hierarchy for packing problems in discrete geometry. - David de Laat; Frank Vallentin (Math. Program., 2015)

A copositive formulation for the stability number of infinite graphs. - Cristian Dobre; Mirjam Dür; Leonhard Frerick; Frank Vallentin (Math. Program., 2016)

On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming. - Etienne de Klerk; Frank Vallentin (SIAM J. Optim., 2016)

Covering compact metric spaces greedily. - Jan Hendrik Rolfes; Frank Vallentin (CoRR, 2017)

New Upper Bounds for the Density of Translative Packings of Three-Dimensional Convex Bodies with Tetrahedral Symmetry. - Maria Dostert; Cristóbal Guzmán; Fernando Mário de Oliveira Filho; Frank Vallentin (Discret. Comput. Geom., 2017)

On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension. - Fernando Mário de Oliveira Filho; Frank Vallentin (CoRR, 2018)

Semidefinite programming bounds for error-correcting codes. - Frank Vallentin (CoRR, 2019)

Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). - Britta Peis; Oliver Schaudt; Heiko Röglin; Bert Randerath; Rainer Schrader; Frank Vallentin (Discret. Appl. Math., 2020)

A simplex algorithm for rational cp-factorization. - Mathieu Dutour Sikiric; Achill Schürmann; Frank Vallentin (Math. Program., 2021)

Stabilizer extent is not multiplicative. - Arne Heimendahl; Felipe Montealegre-Mora; Frank Vallentin; David Gross 003 (Quantum, 2021)

A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices. - S. Thomas McCormick; Britta Peis; Robert Scheidweiler; Frank Vallentin (SIAM J. Discret. Math., 2021)

Complete positivity and distance-avoiding sets. - Evan DeCorte; Fernando Mário de Oliveira Filho; Frank Vallentin (Math. Program., 2022)

k-Point semidefinite programming bounds for equiangular lines. - David de Laat; Fabrício Caluza Machado; Fernando Mário de Oliveira Filho; Frank Vallentin (Math. Program., 2022)

Least distortion Euclidean embeddings of flat tori. - Frank Vallentin; Philippe Moustrou (ISSAC, 2023)

A Recursive Theta Body for Hypergraphs. - Davi Castro-Silva; Fernando Mário de Oliveira Filho; Lucas Slot; Frank Vallentin (Comb., 2023)

Computing the EHZ capacity is NP-hard. - Karla Leipold; Frank Vallentin (CoRR, 2024)