default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Vallentin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Karla Leipold, Frank Vallentin:
Computing the EHZ capacity is NP-hard. CoRR abs/2402.09914 (2024)- 2023
- [j23]Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot, Frank Vallentin:
A Recursive Theta Body for Hypergraphs. Comb. 43(5): 909-938 (2023) - [c3]Frank Vallentin
, Philippe Moustrou:
Least distortion Euclidean embeddings of flat tori. ISSAC 2023: 13-23 - 2022
- [j22]Evan DeCorte, Fernando Mário de Oliveira Filho, Frank Vallentin:
Complete positivity and distance-avoiding sets. Math. Program. 191(2): 487-558 (2022) - [j21]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): 533-567 (2022) - 2021
- [j20]Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin:
A simplex algorithm for rational cp-factorization. Math. Program. 187(1): 25-45 (2021) - [j19]Arne Heimendahl, Felipe Montealegre-Mora, Frank Vallentin, David Gross:
Stabilizer extent is not multiplicative. Quantum 5: 400 (2021) - [j18]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): 2345-2356 (2021) - 2020
- [j17]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: 1 (2020) - [i10]S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin:
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices. CoRR abs/2004.07574 (2020)
2010 – 2019
- 2019
- [i9]Frank Vallentin:
Semidefinite programming bounds for error-correcting codes. CoRR abs/1902.01253 (2019) - 2018
- [i8]Fernando Mário de Oliveira Filho, Frank Vallentin:
On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension. CoRR abs/1808.02346 (2018) - 2017
- [j16]Maria Dostert, Cristóbal Guzmán, 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): 449-481 (2017) - [i7]Jan Hendrik Rolfes, Frank Vallentin:
Covering compact metric spaces greedily. CoRR abs/1710.06002 (2017) - 2016
- [j15]Cristian Dobre, Mirjam Dür, Leonhard Frerick, Frank Vallentin:
A copositive formulation for the stability number of infinite graphs. Math. Program. 160(1-2): 65-83 (2016) - [j14]Etienne de Klerk, Frank Vallentin:
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming. SIAM J. Optim. 26(3): 1944-1961 (2016) - 2015
- [j13]David de Laat, Frank Vallentin:
A semidefinite programming hierarchy for packing problems in discrete geometry. Math. Program. 151(2): 529-553 (2015) - [i6]Etienne de Klerk, Frank Vallentin:
On the Turing model complexity of interior point methods for semidefinite programming. CoRR abs/1507.03549 (2015) - 2014
- [j12]Evan DeCorte, David de Laat, Frank Vallentin:
Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs. Exp. Math. 23(2): 146-152 (2014) - [j11]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
Grothendieck Inequalities for Semidefinite Programs with Rank Constraint. Theory Comput. 10: 77-105 (2014) - 2013
- [j10]Christine Bachoc, Alberto Passuello, Frank Vallentin:
Bounds for projective codes from semidefinite programming. Adv. Math. Commun. 7(2): 127-145 (2013) - 2012
- [i5]Christine Bachoc, Frank Vallentin, Alberto Passuello:
Bounds for projective codes from semidefinite programming. CoRR abs/1205.6406 (2012) - 2010
- [j9]Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin:
The Contact Polytope of the Leech Lattice. Discret. Comput. Geom. 44(4): 904-911 (2010) - [j8]Hans D. Mittelmann, Frank Vallentin:
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers. Exp. Math. 19(2): 175-179 (2010) - [c2]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
The Positive Semidefinite Grothendieck Problem with Rank Constraint. ICALP (1) 2010: 31-42 - [i4]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
Grothendieck inequalities for semidefinite programs with rank constraint. CoRR abs/1011.1754 (2010)
2000 – 2009
- 2009
- [j7]Christine Bachoc, Frank Vallentin:
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps. Eur. J. Comb. 30(3): 625-637 (2009) - [j6]Christine Bachoc, Frank Vallentin:
Optimality and uniqueness of the (4, 10, 1/6) spherical code. J. Comb. Theory A 116(1): 195-204 (2009) - [j5]Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin:
Complexity and algorithms for computing Voronoi cells of lattices. Math. Comput. 78(267): 1713-1731 (2009) - [j4]Nebojsa Gvozdenovic, Monique Laurent, Frank Vallentin:
Block-diagonal semidefinite programming hierarchies for 0/1 programming. Oper. Res. Lett. 37(1): 27-31 (2009) - [i3]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
The positive semidefinite Grothendieck problem with rank constraint. CoRR abs/0910.5765 (2009) - 2008
- [j3]Frank Vallentin:
Optimal distortion embeddings of distance regular graphs into Euclidean spaces. J. Comb. Theory B 98(1): 95-104 (2008) - [i2]Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin:
Complexity and algorithms for computing Voronoi cells of lattices. CoRR abs/0804.0036 (2008) - 2007
- [j2]Francisco Santos, Achill Schürmann, Frank Vallentin:
Lattice Delone simplices with super-exponential volume. Eur. J. Comb. 28(3): 801-806 (2007) - [c1]Christine Bachoc, Frank Vallentin:
Semidefinite programming bounds for spherical codes. ISIT 2007: 1801-1805 - 2006
- [j1]Achill Schürmann, Frank Vallentin:
Computational Approaches to Lattice Packing and Covering Problems. Discret. Comput. Geom. 35(1): 73-116 (2006)
1990 – 1999
- 1998
- [i1]Boris Hemkemeier, Frank Vallentin:
On the decomposition of lattices. Electron. Colloquium Comput. Complex. TR98 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
