default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven C. Polak
Person information
- affiliation: Tilburg University, The Netherlands
- affiliation (former): University of Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Daniel Brosch, Sven C. Polak
:
New lower bounds on crossing numbers of Km,n from semidefinite programming. Math. Program. 207(1): 693-715 (2024)- 2023
- [c2]Sander Gribling, Sven C. Polak, Lucas Slot:
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. ISSAC 2023: 280-288 - [i4]Sander Gribling, Sven C. Polak, Lucas Slot:
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. CoRR abs/2305.14944 (2023) - 2022
- [j9]Sven C. Polak:
Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory. SIAM J. Appl. Algebra Geom. 6(2): 243-266 (2022) - [i3]Stefano Della Fiore, Alessandro Gnutti, Sven C. Polak:
The maximum cardinality of trifferent codes with lengths 5 and 6. CoRR abs/2201.06846 (2022) - [i2]Daniel Brosch, Sven C. Polak:
New lower bounds on crossing numbers of Km, n from permutation modules and semidefinite programming. CoRR abs/2206.02755 (2022)
2010 – 2019
- 2019
- [j8]Bart Litjens, Sven C. Polak, Vaidy Sivaraman:
Sum-perfect graphs. Discret. Appl. Math. 259: 232-239 (2019) - [j7]Andries E. Brouwer, Sven C. Polak:
Uniqueness of codes using semidefinite programming. Des. Codes Cryptogr. 87(8): 1881-1895 (2019) - [j6]Sven C. Polak:
Semidefinite programming bounds for Lee codes. Discret. Math. 342(9): 2579-2589 (2019) - [j5]Sven C. Polak, Alexander Schrijver:
New lower bound on the Shannon capacity of C7 from circular graphs. Inf. Process. Lett. 143: 37-40 (2019) - [j4]Sven C. Polak:
Semidefinite Programming Bounds for Constant-Weight Codes. IEEE Trans. Inf. Theory 65(1): 28-38 (2019) - [c1]Ruben Brokkelkamp, Sven C. Polak, Guido Schäfer, Yllka Velaj:
Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. ISAAC 2019: 13:1-13:15 - 2018
- [j3]Sven C. Polak:
New nonbinary code bounds based on divisibility arguments. Des. Codes Cryptogr. 86(4): 861-874 (2018) - [j2]Bart Litjens, Sven C. Polak, Bart Sevenster, Lluís Vena:
On the chromatic number of a subgraph of the Kneser graph. Electron. Notes Discret. Math. 68: 227-232 (2018) - [i1]Sven C. Polak, Alexander Schrijver:
New lower bound on the Shannon capacity of C7 from circular graphs. CoRR abs/1808.07438 (2018) - 2017
- [j1]Bart Litjens, Sven C. Polak, Alexander Schrijver:
Semidefinite bounds for nonbinary codes based on quadruples. Des. Codes Cryptogr. 84(1-2): 87-100 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
