Frank Vallentin

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