Sven C. Polak

Orcid: 0000-0002-4287-6479

Affiliations:
  • Tilburg University, The Netherlands
  • University of Amsterdam, The Netherlands (former)


According to our database1, Sven C. Polak authored at least 15 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New lower bounds on crossing numbers of K<sub>m,n</sub> from semidefinite programming.
Math. Program., September, 2024

2023
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

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

New lower bounds on crossing numbers of K<sub>m, n</sub> from permutation modules and semidefinite programming.
CoRR, 2022

The maximum cardinality of trifferent codes with lengths 5 and 6.
CoRR, 2022

2019
Semidefinite Programming Bounds for Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2019

New lower bound on the Shannon capacity of <i>C</i><sub>7</sub> from circular graphs.
Inf. Process. Lett., 2019

Semidefinite programming bounds for Lee codes.
Discret. Math., 2019

Uniqueness of codes using semidefinite programming.
Des. Codes Cryptogr., 2019

Sum-perfect graphs.
Discret. Appl. Math., 2019

Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
On the chromatic number of a subgraph of the Kneser graph.
Electron. Notes Discret. Math., 2018

New nonbinary code bounds based on divisibility arguments.
Des. Codes Cryptogr., 2018

New lower bound on the Shannon capacity of C7 from circular graphs.
CoRR, 2018

2017
Semidefinite bounds for nonbinary codes based on quadruples.
Des. Codes Cryptogr., 2017


  Loading...