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:
- integer programming
- algorithms for combinatorial optimization
- online algorithms
- approximation algorithms
- randomized algorithms
- discrepancy theory
- data structures
- cyber security and penetration testing
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.