Sven Polak
20172024

Research activity per year

Filter
Conference contribution

Search results

  • 2023

    A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization

    Gribling, S., Polak, S. C. & Slot, L., 24 Jul 2023, ISSAC 2023 - Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation. Jeronimo, G. (ed.). Tromso: ACM Digital Library, p. 280-288 9 p. (ACM International Conference Proceeding Series).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    1 Citation (Scopus)
  • 2019

    Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node

    Brokkelkamp, R., Polak, S. C., Schäfer, G. & Velaj, Y., 2019, ISAAC 2019. p. 13:1-13:15 15 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    File
    12 Downloads (Pure)
  • 2018

    On the chromatic number of a subgraph of the Kneser graph

    Litjens, B., Polak, S. C., Sevenster, B. & Vena, L., 2018, Electronic Notes in Discrete Mathematics: Discrete Mathematics Days 2018. Garijo, D., Marquez, A. & Serra, O. (eds.). Elsevier, Vol. 68. p. 227-232 6 p. (Electronic Notes in Discrete Mathematics; vol. 68).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    File
    30 Downloads (Pure)