| Semidefinite bounds for nonbinary codes based on quadruples B Litjens, S Polak, A Schrijver Designs, Codes and Cryptography 84, 87-100, 2017 | 40 | 2017 |
| New lower bound on the Shannon capacity of C7 from circular graphs SC Polak, A Schrijver Information Processing Letters 143, 37-40, 2019 | 31 | 2019 |
| Semidefinite programming bounds for constant-weight codes SC Polak IEEE Transactions on Information Theory 65 (1), 28-38, 2018 | 17 | 2018 |
| Semidefinite programming bounds for Lee codes SC Polak Discrete Mathematics 342 (9), 2579-2589, 2019 | 10 | 2019 |
| Algorithms for the network analysis of bilateral tax treaties S Polak MSc. thesis, University of Amsterdam, The Netherlands, 2014 | 9 | 2014 |
| New methods in coding theory: Error-correcting codes and the Shannon capacity S Polak arXiv preprint arXiv:2005.02945, 2020 | 8 | 2020 |
| Mutually unbiased bases: polynomial optimization and symmetry S Gribling, S Polak Quantum 8, 1318, 2024 | 7 | 2024 |
| 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 | 7 | 2022 |
| The maximum cardinality of trifferent codes with lengths 5 and 6 S Della Fiore, A Gnutti, S Polak Examples and Counterexamples 2, 100051, 2022 | 6 | 2022 |
| Uniqueness of codes using semidefinite programming AE Brouwer, SC Polak Designs, Codes and Cryptography 87, 1881-1895, 2019 | 6 | 2019 |
| 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 | 6 | 2018 |
| 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 | 5 | 2023 |
| New nonbinary code bounds based on divisibility arguments SC Polak Designs, Codes and Cryptography 86, 861-874, 2018 | 3 | 2018 |
| 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 | 3 | 2018 |
| Semidefinite Approximations for Bicliques and Bi-Independent Pairs M Laurent, S Polak, LF Vargas Mathematics of Operations Research 50 (1), 537-572, 2025 | 2 | 2025 |
| Sum-perfect graphs B Litjens, S Polak, V Sivaraman Discrete Applied Mathematics 259, 232-239, 2019 | 2 | 2019 |
| New lower bounds on crossing numbers of from semidefinite programming D Brosch, S C. Polak Mathematical Programming 207 (1), 693-715, 2024 | 1* | 2024 |
| 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), 13 …, 2019 | 1 | 2019 |
| New methods in coding theory SC Polak | | |
Bart LitjensPhD MathematicsVerified email at uva.nl
