Sander Borst

Orcid: 0000-0003-4001-6675

According to our database1, Sander Borst authored at least 11 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
To Buy or Not to Buy: Online Rent-Or-Buy on Node-Weighted Graphs.
Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025
Improved Online Load Balancing in the Two-Norm.
CoRR, November, 2025

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs.
CoRR, July, 2025

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Online Matching on 3-Uniform Hypergraphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2025

2024
Branch-and-bound trees, integrality gaps and online optimization: A tale of algorithms and randomness.
PhD thesis, 2024

2023
Integrality Gaps for Random Integer Programs via Discrepancy.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

A Nearly Optimal Randomized Algorithm for Explorable Heap Selection.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees.
Algorithmica, 2022

2021
On the Integrality Gap of Binary Integer Programs with Gaussian Data.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021

Majorizing Measures for the Optimizer.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021


  Loading...