Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 9.

Journal Article

DeCorte, Evan, Filho, Fernando Mario de Oliveira and Vallentin, Frank . Complete positivity and distance-avoiding sets. Math. Program.. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1436-4646

Dobre, Cristian, Duer, Mirjam, Frerick, Leonhard and Vallentin, Frank (2016). A copositive formulation for the stability number of infinite graphs. Math. Program., 160 (1-2). S. 65 - 84. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1436-4646

Dostert, Maria ORCID: 0000-0002-0393-8286, Guzman, Cristobal ORCID: 0000-0002-1498-2055, de Oliveira Filho, Fernando Mario and Vallentin, Frank (2017). New Upper Bounds for the Density of Translative Packings of Three-Dimensional Convex Bodies with Tetrahedral Symmetry. Discret. Comput. Geom., 58 (2). S. 449 - 482. NEW YORK: SPRINGER. ISSN 1432-0444

Dostert, Maria and Vallentin, Frank (2020). New dense superball packings in three dimensions. Adv. Geom., 20 (4). S. 473 - 483. BERLIN: WALTER DE GRUYTER GMBH. ISSN 1615-7168

Peis, Britta, Schaudt, Oliver, Roeglin, Heiko, Randerath, Bert, Schrader, Rainer and Vallentin, Frank (2020). Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret Appl. Math., 272. S. 1 - 2. AMSTERDAM: ELSEVIER. ISSN 1872-6771

Sikiric, Mathieu Dutour, Schuermann, Achill and Vallentin, Frank (2017). Rational factorizations of completely positive matrices. Linear Alg. Appl., 523. S. 46 - 52. NEW YORK: ELSEVIER SCIENCE INC. ISSN 1873-1856

Sikiric, Mathieu Dutour, Schuermann, Achill and Vallentin, Frank . A simplex algorithm for rational cp-factorization. Math. Program.. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1436-4646

de Klerk, Etienne and Vallentin, Frank (2016). ON THE TURING MODEL COMPLEXITY OF INTERIOR POINT METHODS FOR SEMIDEFINITE PROGRAMMING. SIAM J. Optim., 26 (3). S. 1944 - 1962. PHILADELPHIA: SIAM PUBLICATIONS. ISSN 1095-7189

de Oliveira Filho, Fernando Mario and Vallentin, Frank (2019). A COUNTEREXAMPLE TO A CONJECTURE OF LARMAN AND ROGERS ON SETS AVOIDING DISTANCE 1. Mathematika, 65 (3). S. 785 - 788. LONDON: LONDON MATH SOC. ISSN 2041-7942

This list was generated on Thu Feb 25 01:58:41 2021 CET.