Sander Borst

Dr. Sander Borst is a postdoctoral researcher in the Algorithms and Complexity group at the Max Planck Institute for Informatics in Saarbrücken, Germany. Previously, he completed his Ph.D. in the Networks & Optimization group at the Centrum Wiskunde & Informatica (CWI) in Amsterdam, advised by Daniel Dadush. He holds bachelor’s degrees in Mathematics and Computer Science and a master’s degree in Mathematics from Delft University of Technology.

• Current Role: Postdoctoral Researcher at Max Planck Institute for Informatics.
• Education: B.Sc. and M.Sc. in Mathematics and Computer Science from Delft University of Technology.

Sander's research focuses on the design and analysis of online algorithms, particularly in online network design, hypergraph matching, and graph exploration. His work bridges theoretical computer science with practical applications in optimization and algorithmic randomness. Recent projects include developing algorithms for explorable heap selection, constraint propagation in MIP solvers, and analyzing integrality gaps in integer programming under random data assumptions.

The trends in his publications (2020–2025) span online optimization, randomized algorithms, hypergraph theory, and integer programming. Key venues include SODA, IPCO, ITCS, and Algorithmica, with recurring themes in network design, combinatorial optimization, and theoretical guarantees for algorithmic solutions.

His technical expertise extends to software development and programming languages, ensuring practical implementation of theoretical models. He has collaborated with researchers such as Daniel Dadush, Neil Olver, and Ambros Gleixner.