Hi, I am Sander Borst,

I am a mathematician, fascinated by solving hard problems. In particular, I am very interested in problems related to (theoretical) computer science and abstract mathematics. These problems span several subfields, including:

I also like software development and I have experience with a wide range of programming languages and techniques.

Currently I am working as a PhD candidate at the Centrum Wiskunde & Informatica in Amsterdam in the Networks & Optimization group on the project ‘Towards a Quantitative Theory of Integer Programming’, supervised by Daniel Dadush.

I have bachelor’s degrees in mathematics and computer science and a master’s degree in mathematics from the Delft University of Technology.

For more information, see my cv.


Online Matching on 3-Uniform Hypergraphs
Sander Borst, Danish Kashaev, Zhuan Khye Koh
Certified Constraint Propagation and Dual Proof Analysis in a Numerically Exact MIP Solver
Sander Borst, Leon Eifler, Ambros Gleixner
A nearly optimal randomized algorithm for explorable heap selection
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
Integrality Gaps for Random Integer Programs via Discrepancy
A multidimensional solution to additive homological equations
Aleksei Ber, Matthijs Borst, Sander Borst, Fedor Sukochev
On the Integrality Gap of Binary Integer Programs with Gaussian Data
Majorizing Measures for the Optimizer
New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees