Volgen
Sven Polak
Sven Polak
Geverifieerd e-mailadres voor tilburguniversity.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Semidefinite bounds for nonbinary codes based on quadruples
B Litjens, S Polak, A Schrijver
Designs, Codes and Cryptography 84, 87-100, 2017
402017
New lower bound on the Shannon capacity of C7 from circular graphs
SC Polak, A Schrijver
Information Processing Letters 143, 37-40, 2019
252019
Semidefinite programming bounds for constant-weight codes
SC Polak
IEEE Transactions on Information Theory 65 (1), 28-38, 2018
142018
New methods in coding theory: Error-correcting codes and the Shannon capacity
S Polak
arXiv preprint arXiv:2005.02945, 2020
102020
Semidefinite programming bounds for Lee codes
SC Polak
Discrete Mathematics 342 (9), 2579-2589, 2019
102019
Algorithms for the network analysis of bilateral tax treaties
S Polak
MSc. thesis, University of Amsterdam, The Netherlands, 2014
92014
Symmetry reduction to optimize a graph-based polynomial from queueing theory
SC Polak
SIAM Journal on Applied Algebra and Geometry 6 (2), 243-266, 2022
72022
Mutually unbiased bases: polynomial optimization and symmetry
S Gribling, S Polak
Quantum 8, 1318, 2024
52024
Uniqueness of codes using semidefinite programming
AE Brouwer, SC Polak
Designs, Codes and Cryptography 87, 1881-1895, 2019
52019
On the chromatic number of a subgraph of the Kneser graph
B Litjens, S Polak, B Sevenster, L Vena
Electronic Notes in Discrete Mathematics 68, 227-232, 2018
52018
The maximum cardinality of trifferent codes with lengths 5 and 6
S Della Fiore, A Gnutti, S Polak
Examples and Counterexamples 2, 100051, 2022
42022
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
S Gribling, S Polak, L Slot
Proceedings of the 2023 International Symposium on Symbolic and Algebraic …, 2023
32023
On the circular chromatic number of a subgraph of the Kneser graph
B Litjens, S Polak, B Sevenster, L Vena
arXiv preprint arXiv:1803.04342, 2018
32018
Semidefinite Approximations for Bicliques and Bi-Independent Pairs
M Laurent, S Polak, LF Vargas
Mathematics of Operations Research, 2024
22024
New lower bounds on crossing numbers of from semidefinite programming
D Brosch, S C. Polak
Mathematical Programming, 1-23, 2023
2*2023
Sum-perfect graphs
B Litjens, S Polak, V Sivaraman
Discrete Applied Mathematics 259, 232-239, 2019
22019
New nonbinary code bounds based on divisibility arguments
SC Polak
Designs, Codes and Cryptography 86, 861-874, 2018
22018
Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node
R Brokkelkamp, S Polak, G Schäfer, Y Velaj
30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019
12019
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–18