Sven Polak

Full Name

S.C. Polak

Sven.Polak@cwi.nl

Department(s)

Networks and Optimization

Function(s)

Researcher - Unknown

Homepage

https://sites.google.com/site/svenpolak/

Biography

Sven Polak works as a postdoc with Monique Laurent in the Networks and Optimization (N&O)-group. He obtained his PhD in Mathematics at the University of Amsterdam in 2019, under supervision of prof. Lex Schrijver. After his PhD, he worked as an operations research engineer at ORTEC until August 2020. His master degree he obtained (cum laude) at the University of Amsterdam, after writing a master thesis at CWI under supervision of Guido Schäfer.

Brosch, D., & Polak, S. (2023). New lower bounds on crossing numbers of Km,n from semidefinite programming. Mathematical Programming Series A. doi:10.1007/s10107-023-02028-1
Polak, S. (2022). Symmetry reduction to optimize a graph-based polynomial from queueing theory. SIAM Journal on Applied Algebra and Geometry, 6(2), 243–266. doi:10.1137/21M1413298
Brokkelkamp, R., Polak, S., Schäfer, G., & Velaj, Y. (2019). Approximate pricing in networks: How to boost the betweenness and revenue of a node. In 30th International Symposium on Algorithms and Computation (pp. 13:1–13:15). doi:10.4230/LIPIcs.ISAAC.2019.13
Polak, S. (2019). Semidefinite programming bounds for Lee codes. Discrete Mathematics, 342(9), 2579–2589. doi:10.1016/j.disc.2019.05.019
Polak, S. (2019, September). New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity. Retrieved from http://hdl.handle.net/11245.1/393eb25b-c1ba-4c6f-89e8-c439a97358b6
Brouwer, A., & Polak, S. (2019). Uniqueness of codes using semidefinite programming. Designs, Codes and Cryptography, 87, 1881–1895. doi:10.1007/s10623-018-0589-8
Litjens, B., Polak, S., & Sivaraman, V. (2019). Sum-perfect graphs. Discrete Applied Mathematics, 259, 232–239. doi:10.1016/j.dam.2018.12.015
Polak, S., & Schrijver, L. (2019). New lower bound on the Shannon capacity of C7 from circular graphs. Information Processing Letters, 143, 37–40. doi:10.1016/j.ipl.2018.11.006
Polak, S. (2019). Semidefinite programming bounds for constant weight codes. IEEE Transactions on Information Theory, 65, 28–38. doi:10.1109/TIT.2018.2854800
Litjens, B., Polak, S., Sevenster, B., & Vena, L. (2018). On the chromatic number of a subgraph of the Kneser graph. Electronic Notes in Discrete Mathematics, 68, 227–232. doi:10.1016/j.endm.2018.06.039

Networks and Semidefinite Programming(21 Nov 2022 - 20 Feb 2023)

Sven Polak

Biography

Publications

Courses

Sven Polak

Biography

Publications

Courses

Cookies