Frank Vallentin

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 16

Top Topics

Fourier Analysis

Interior Point Methods

Top Venues

Discret. Comput. Geom.

Publications

Karla Leipold, Frank Vallentin
Computing the EHZ capacity is NP-hard. CoRR (2024)
Frank Vallentin, Philippe Moustrou
Least distortion Euclidean embeddings of flat tori. ISSAC (2023)
Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot, Frank Vallentin
A Recursive Theta Body for Hypergraphs. Comb. 43 (5) (2023)
Evan DeCorte, Fernando Mário de Oliveira Filho, Frank Vallentin
Complete positivity and distance-avoiding sets. Math. Program. 191 (2) (2022)
David de Laat, Fabrício Caluza Machado, Fernando Mário de Oliveira Filho, Frank Vallentin
k-Point semidefinite programming bounds for equiangular lines. Math. Program. 194 (1) (2022)
Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin
A simplex algorithm for rational cp-factorization. Math. Program. 187 (1) (2021)
Arne Heimendahl, Felipe Montealegre-Mora, Frank Vallentin, David Gross
Stabilizer extent is not multiplicative. Quantum 5 (2021)
S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices. SIAM J. Discret. Math. 35 (4) (2021)
S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices. CoRR (2020)
Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. 272 (2020)
Frank Vallentin
Semidefinite programming bounds for error-correcting codes. CoRR (2019)
Fernando Mário de Oliveira Filho, Frank Vallentin
On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension. CoRR (2018)
Jan Hendrik Rolfes, Frank Vallentin
Covering compact metric spaces greedily. CoRR (2017)
Maria Dostert, Cristobal Guzman, Fernando Mário de Oliveira Filho, Frank Vallentin
New Upper Bounds for the Density of Translative Packings of Three-Dimensional Convex Bodies with Tetrahedral Symmetry. Discret. Comput. Geom. 58 (2) (2017)
Cristian Dobre, Mirjam Dür, Leonhard Frerick, Frank Vallentin
A copositive formulation for the stability number of infinite graphs. Math. Program. 160 (1-2) (2016)
Etienne de Klerk, Frank Vallentin
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming. SIAM J. Optim. 26 (3) (2016)
David de Laat, Frank Vallentin
A semidefinite programming hierarchy for packing problems in discrete geometry. Math. Program. 151 (2) (2015)
Etienne de Klerk, Frank Vallentin
On the Turing model complexity of interior point methods for semidefinite programming. CoRR (2015)
Evan DeCorte, David de Laat, Frank Vallentin
Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs. Exp. Math. 23 (2) (2014)
Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin
Grothendieck Inequalities for Semidefinite Programs with Rank Constraint. Theory Comput. 10 (2014)
Christine Bachoc, Alberto Passuello, Frank Vallentin
Bounds for projective codes from semidefinite programming. Adv. Math. Commun. 7 (2) (2013)
Christine Bachoc, Frank Vallentin, Alberto Passuello
Bounds for projective codes from semidefinite programming CoRR (2012)
Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin
Grothendieck inequalities for semidefinite programs with rank constraint CoRR (2010)
Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin
The Positive Semidefinite Grothendieck Problem with Rank Constraint. ICALP (1) (2010)
Hans D. Mittelmann, Frank Vallentin
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers. Exp. Math. 19 (2) (2010)
Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin
The Contact Polytope of the Leech Lattice. Discret. Comput. Geom. 44 (4) (2010)
Nebojsa Gvozdenovic, Monique Laurent, Frank Vallentin
Block-diagonal semidefinite programming hierarchies for 0/1 programming. Oper. Res. Lett. 37 (1) (2009)
Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin
Complexity and algorithms for computing Voronoi cells of lattices. Math. Comput. 78 (267) (2009)
Christine Bachoc, Frank Vallentin
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps. Eur. J. Comb. 30 (3) (2009)
Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin
The positive semidefinite Grothendieck problem with rank constraint. CoRR (2009)
Christine Bachoc, Frank Vallentin
Optimality and uniqueness of the (4, 10, 1/6) spherical code. J. Comb. Theory, Ser. A 116 (1) (2009)
Frank Vallentin
Optimal distortion embeddings of distance regular graphs into Euclidean spaces. J. Comb. Theory, Ser. B 98 (1) (2008)
Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin
Complexity and algorithms for computing Voronoi cells of lattices CoRR (2008)
Christine Bachoc, Frank Vallentin
Semidefinite programming bounds for spherical codes. ISIT (2007)
Francisco Santos, Achill Schürmann, Frank Vallentin
Lattice Delone simplices with super-exponential volume. Eur. J. Comb. 28 (3) (2007)
Achill Schürmann, Frank Vallentin
Computational Approaches to Lattice Packing and Covering Problems. Discret. Comput. Geom. 35 (1) (2006)
Boris Hemkemeier, Frank Vallentin
On the decomposition of lattices Electron. Colloquium Comput. Complex. 5 (52) (1998)