Scholar
Sander Borst
Google Scholar ID: SbGadPMAAAAJ
Max Planck Institute for Informatics
Citations & Impact
Citations
56
H-index
4
i10-index
2
Publications
15
Co-authors
0
Publications
Resume (English only)
Academic Achievements
- Published multiple papers on topics such as online problems, randomized algorithms, and integer programming. Some publications are featured in top conferences like SODA and IPCO, as well as journals.
Research Experience
- Currently a postdoc in the Algorithms and Complexity group of the Max Planck Institute for Informatics in Saarbrücken.
Education
- Bachelor's degrees in mathematics and computer science, and a master’s degree in mathematics from Delft University of Technology; PhD candidate at the Networks & Optimization group of Centrum Wiskunde & Informatica in Amsterdam, advised by Daniel Dadush.
Background
- A mathematician working in theoretical computer science. Fascinated by solving hard problems, particularly interested in the design of online algorithms. Recent work focuses on online network design, online (hypergraph) matching, and online graph exploration. Also enjoys software development with experience in a wide range of programming languages and techniques.
Co-authors