Majorizing Measures for the Optimizer. - Sander Borst; Daniel Dadush; Neil Olver; Makrand Sinha (ITCS, 2021)

New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees. - Sander Borst; Leo van Iersel; Mark Jones 001; Steven Kelk (Algorithmica, 2022)

Integrality Gaps for Random Integer Programs via Discrepancy. - Sander Borst; Daniel Dadush; Dan Mikulincer (SODA, 2023)

On the integrality gap of binary integer programs with Gaussian data. - Sander Borst; Daniel Dadush; Sophie Huiberts; Samarth Tiwari (Math. Program., 2023)

Online Matching on 3-Uniform Hypergraphs. - Sander Borst; Danish Kashaev; Zhuan Khye Koh (IPCO, 2025)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems. - Sander Borst; Marek Eliás 001; Moritz Venzin (SODA, 2025)

A nearly optimal randomized algorithm for explorable heap selection. - Sander Borst; Daniel Dadush; Sophie Huiberts; Danish Kashaev (Math. Program., 2025)

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs. - Sander Borst; Moritz Venzin (CoRR, 2025)