Semidefinite bounds for nonbinary codes based on quadruples. - Bart Litjens; Sven C. Polak; Alexander Schrijver (Des. Codes Cryptogr., 2017)

New lower bound on the Shannon capacity of C7 from circular graphs. - Sven C. Polak; Alexander Schrijver (CoRR, 2018)

New nonbinary code bounds based on divisibility arguments. - Sven C. Polak (Des. Codes Cryptogr., 2018)

On the chromatic number of a subgraph of the Kneser graph. - Bart Litjens; Sven C. Polak; Bart Sevenster; Lluís Vena (Electron. Notes Discret. Math., 2018)

Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. - Ruben Brokkelkamp; Sven C. Polak; Guido Schäfer; Yllka Velaj (ISAAC, 2019)

Sum-perfect graphs. - Bart Litjens; Sven C. Polak; Vaidy Sivaraman (Discret. Appl. Math., 2019)

Uniqueness of codes using semidefinite programming. - Andries E. Brouwer; Sven C. Polak (Des. Codes Cryptogr., 2019)

Semidefinite programming bounds for Lee codes. - Sven C. Polak (Discret. Math., 2019)

New lower bound on the Shannon capacity of C7 from circular graphs. - Sven C. Polak; Alexander Schrijver (Inf. Process. Lett., 2019)

Semidefinite Programming Bounds for Constant-Weight Codes. - Sven C. Polak (IEEE Trans. Inf. Theory, 2019)

The maximum cardinality of trifferent codes with lengths 5 and 6. - Stefano Della Fiore; Alessandro Gnutti; Sven C. Polak (CoRR, 2022)

New lower bounds on crossing numbers of Km, n from permutation modules and semidefinite programming. - Daniel Brosch; Sven C. Polak (CoRR, 2022)

Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory. - Sven C. Polak (SIAM J. Appl. Algebra Geom., 2022)

A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. - Sander Gribling; Sven C. Polak; Lucas Slot (ISSAC, 2023)

Mutually unbiased bases: polynomial optimization and symmetry. - Sander Gribling; Sven C. Polak (Quantum, 2024)

New lower bounds on crossing numbers of Km,n from semidefinite programming. - Daniel Brosch; Sven C. Polak (Math. Program., 2024)

Semidefinite Approximations for Bicliques and Bi-Independent Pairs. - Monique Laurent; Sven C. Polak; Luis Felipe Vargas (Math. Oper. Res., 2025)

Semidefinite lower bounds for covering codes. - Dion Gijswijt; Sven C. Polak (CoRR, 2025)