Sven C. Polak

Available identifiers

Publication	Date of Publication	Type
New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming	2024-09-19	Paper
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization	2023-11-03	Paper
Approximate pricing in networks: How to boost the betweenness and revenue of a node	2023-02-03	Paper
Symmetry reduction to optimize a graph-based polynomial from queueing theory	2022-06-08	Paper
The maximum cardinality of trifferent codes with lengths 5 and 6	2022-01-18	Paper
New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity	2020-05-06	Paper
Semidefinite programming bounds for Lee codes	2019-07-18	Paper
Uniqueness of codes using semidefinite programming	2019-06-27	Paper
Sum-perfect graphs	2019-03-28	Paper
New lower bound on the Shannon capacity of \(C_7\) from circular graphs	2019-01-18	Paper
Semidefinite Programming Bounds for Constant-Weight Codes	2019-01-18	Paper
On the chromatic number of a subgraph of the Kneser graph	2018-10-11	Paper
New nonbinary code bounds based on divisibility arguments	2018-04-10	Paper
Semidefinite bounds for nonbinary codes based on quadruples	2017-07-21	Paper
Improved upper bound on A(18,8)	2016-12-07	Paper
Semidefinite approximations for bicliques and biindependent pairs	N/A	Paper

This page was built for person: Sven C. Polak