Dr. Torben Schürenberg
Research Assistant Research Training Group π3, WG Discrete OptimizationInformation: Email ends with @uni-bremen.de
Conferences und Workshops:
- WG 26
- Hamburg–Bremen Workshop 26
- Combinatorics, Algorithms, and Geometry, Kassel
- ADYN 25
- FRICO 25
- Hamburg–Bremen Workshop 25
- ALGOWIN 24
- FRICO 23 – “Best Talk Award” in Eindhoven
- Methods Week in Statistics: “Interpretable Machine Learning”
- 13th Day(s) on Computational Game Theory 2023 in Amsterdam
- 12th Day(s) on Computational Game Theory 2022 in Bremen
Teaching:
- SS 2026: Teaching support for the seminars: Online Algorithms, Graphs and Algorithms
- WS 2025-2026: Teaching support for the lecture Algorithmic Game Theory and the seminar Online Optimization
- 2023: Instructor for “Higher Mathematics” for HERE AHEAD Bremen
- 2023: Tutor for the “OMB+ Mathematics Preparatory Course” for HERE AHEAD Bremen
- SS 2023: Teaching support for the lecture Graph Theory
- WS 2022-2023: Teaching support for the lecture Algorithmic Game Theory
About me
I completed my Ph.D. in 2026 in the Discrete Optimization research group at the University of Bremen, under the supervision of Prof. Dr. Daniel Schmand, and have been working here as a postdoctoral researcher since then.Research Interests
Today’s world is more interconnected than it has ever been. Control of both digital, as well as physical traffic, and optimization of the underlying infrastructure is of central importance. Mathematical models for these infrastructures play a huge role in the optimization tasks. Solution concepts have to include strategic behavior of users and should cover additional mathematical properties. I aim for the development of realistic mathematical models for congested systems especially the identification of meaningful parameters for the users’ objective functions that highly influence the arising stable solutions. I am interested in both the techniques for the efficient calculation of solutions and the optimization of the infrastructure itself. I am also interested in intriguing puzzle-based problems that can be modeled using graphs. In particular, my research focuses on the analysis of search games on graphs.Courses (Selection)
- Übungen Algorithmic Game Theory (Wintersemester 2022/2023)
- Übungen Mathematik 1b für Produktionstechniker und Wirtschaftsingenieure (Sommersemester 2016)
- Übungen Mathematik 1a für Produktionstechniker und Wirtschaftsingenieure (Wintersemester 2015/2016)
Publications (Selection)
- T. Schürenberg, J. Schade, J. Althoetmar.
Complexity of Firefighting on Graphs.
WG: International Workshop on Graph-Theoretic Concepts in Computer Science.
- T. Schürenberg, S. Brenner, J. Dallant, L. Kleist, R. Lauff, T. Mütze.
Hamilton paths and cycles in flip graphs of (almost-)perfect matchings.
arxiv.
DOI: 10.48550/arxiv.2607.04687
online at: https://arxiv.org/abs/2607.04687 - T. Schürenberg, M. J. Stahlberg.
Blindfolded pursuit with delays of your choice.
arxiv.
DOI: 10.48550/arXiv.2608.27347
online at: https://arxiv.org/abs/2608.27347 - T. Schürenberg.
On the Complexity of Min-Max Star Partitioning and Firefighting, and the Impact of Selfish Behavior in Packet Routing.
Dissertationsschrift, Universität Bremen, 2026.DOI: 10.26092/elib/6018
- D. Schmand, T. Schürenberg, M. Strehler.
On the Price of Anarchy in Packet Routing Games with FIFO.
14th International Conference on Algorithms and Complexity (CIAC 2025).