Overview Research Education Contact
Since December 2019 I am affiliated with the Discrete Mathematics and Mathematical Programming group here at the University of Twente. Previously, I have had postdoc positions at Universität Bremen and Universidad de Chile . At the former, I was part of the group of Prof. Nicole Megow . At the latter, I spend a year at the Department of Industrial Engineering and a year at the Center for Mathematical Modeling .
As an applied mathematics researcher, I have a broad interest in Discrete Mathematics, Algorithmic Game Theory, Scheduling, Combinatorial Optimization, Complexity, Operations Research, and many related topics both of theoretical and applied nature.
Currently, I focus specifically on optimization under uncertainty, where we try to optimize our decisions even if part of the input data has some form of uncertainty.
Expertise Computer Science Algorithms Polynomial Time Scheduling Mathematics Algorithm Hyperplane Approximation Bounds Upper Bound Organisations Publications Stochastic Minimum Spanning Trees with a Single Sample (2024) [Working paper › Preprint]. ArXiv.org. Hoeksma, R. , Speek, G. & Uetz, M. https://doi.org/10.48550/arXiv.2409.16119 Price of Anarchy for Graphic Matroid Congestion Games (2024) In Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings (pp. 371-388) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 15156 LNCS). Springer. Fokkema, W., Hoeksma, R. & Uetz, M. https://doi.org/10.1007/978-3-031-71033-9_21 Optimizing Parcel Transportation of PostNL (2023) [Working paper › Working paper]. European Consortium for Mathematics in Industry (ECMI). Hoeksma, R. , Hojny, C., van Ommeren, J. C. W. & Walter, M. https://doi.org/10.33774/miir-2023-7dh5p Speed-robust scheduling: sand, bricks, and rocks (2023) Mathematical programming, 197 (2), 1009–1048. Eberle, F., Hoeksma, R. , Megow, N., Nölke, L., Schewior, K. & Simon, B.https://doi.org/10.1007/s10107-022-01829-0 Paging with Succinct Predictions (2023) Proceedings of Machine Learning Research, 202 , 952-968. Antoniadis, A., Boyar, J., Eliáš, M., Favrholdt, L. M., Hoeksma, R. , Larsen, K. S., Polak, A. & Simon, B.Paging with Succinct Predictions (2022) [Working paper › Preprint]. ArXiv.org. Antoniadis, A., Boyar, J., Eliáš, M., Favrholdt, L. M., Hoeksma, R. , Larsen, K. S., Polak, A. & Simon, B. Online search for a hyperplane in high-dimensional Euclidean space (2022) Information processing letters, 177 . Article 106262. Antoniadis, A., Hoeksma, R. , Kisfaludi-Bak, S. & Schewior, K.https://doi.org/10.1016/j.ipl.2022.106262 On Hop-Constrained Steiner Trees in Tree-Like Metrics (2022) SIAM journal on discrete mathematics, 36 (2), 1249-1273. Böhm, M., Hoeksma, R. , Megow, N., Nölke, L. & Simon, B.https://doi.org/10.1137/21M1425487 Speed Robust Scheduling Supplemental Material (2021) [Non-textual form › Software]. 4TU.Centre for Research Data. Eberle, F., Hoeksma, R. , Megow, N., Nölke, L., Schewior, K. & Simon, B. https://doi.org/10.4121/17159216 Speed Robust Scheduling Supplemental Material (2021) [Dataset Types › Dataset]. 4TU.Centre for Research Data. Eberle, F., Hoeksma, R. , Megow, N., Nölke, L., Schewior, K. & Simon, B. https://doi.org/10.4121/17159216.v1 Research profiles Courses academic year 2024/2025 Courses in the current academic year are added at the moment they are finalised in the Osiris system. Therefore it is possible that the list is not yet complete for the whole academic year.
Courses academic year 2023/2024 
Scan the QR code or