Frank Vallentin

According to our database1, Frank Vallentin authored at least 24 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017).
Discret. Appl. Math., 2020

A polynomial time algorithm for solving the closest vector problem in zonotopal lattices.
CoRR, 2020

2019
Semidefinite programming bounds for error-correcting codes.
CoRR, 2019

2018
On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension.
CoRR, 2018

2017
New Upper Bounds for the Density of Translative Packings of Three-Dimensional Convex Bodies with Tetrahedral Symmetry.
Discret. Comput. Geom., 2017

Covering compact metric spaces greedily.
CoRR, 2017

2016
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming.
SIAM J. Optim., 2016

A copositive formulation for the stability number of infinite graphs.
Math. Program., 2016

2015
A semidefinite programming hierarchy for packing problems in discrete geometry.
Math. Program., 2015

2014
Grothendieck Inequalities for Semidefinite Programs with Rank Constraint.
Theory Comput., 2014

Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs.
Exp. Math., 2014

2013
Bounds for projective codes from semidefinite programming.
Adv. Math. Commun., 2013

2010
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers.
Exp. Math., 2010

The Contact Polytope of the Leech Lattice.
Discret. Comput. Geom., 2010

The Positive Semidefinite Grothendieck Problem with Rank Constraint.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Block-diagonal semidefinite programming hierarchies for 0/1 programming.
Oper. Res. Lett., 2009

Complexity and algorithms for computing Voronoi cells of lattices.
Math. Comput., 2009

Optimality and uniqueness of the (4, 10, 1/6) spherical code.
J. Comb. Theory, Ser. A, 2009

Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps.
Eur. J. Comb., 2009

2008
Optimal distortion embeddings of distance regular graphs into Euclidean spaces.
J. Comb. Theory, Ser. B, 2008

2007
Lattice Delone simplices with super-exponential volume.
Eur. J. Comb., 2007

Semidefinite programming bounds for spherical codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Computational Approaches to Lattice Packing and Covering Problems.
Discret. Comput. Geom., 2006

1998
On the decomposition of lattices
Electron. Colloquium Comput. Complex., 1998


  Loading...