Photo

Sven Jäger

I am a permanent teaching and research assistant at the Institute of Mathematics at TU Berlin. My research is mainly concerned with approximation and online algorithms, in particular for scheduling problems, as well as game-theoretic methods in public transport applications.

In the winter semester 2026/27, I teach the programming classes for Computerorientierte Mathematik I and the exercise sessions for Introduction to Linear and Combinatorial Optimization (ADM I).

Publications

Sven Jäger

My coauthors

Talks

Slides
∙
Wie lange soll ich es probieren? Zeitplanung bei unbekannten Aufgabenlängen

Tag der Mathematik 2026, 

Slides
∙
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs

Slides
Delay Management on a Path

Operations Research (OR) 2023, 

Slides
∙
Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling

Highlights of Algorithms (HALG) 2023, 

Slides
Modelling multi-modal transport planning

Hot Topic workshop “Integrated Planning in Public Transport”, 

No slides available
∙
Scheduling Unrelated Parallel Machines with Attribute-Dependent Setup Times: a Case Study

Operations Resarch (OR) 2022, 

Slides
∙
Approximation in Deterministic and Stochastic Machine Scheduling

PhD Defense, 

Slides
∙
Scheduling Stochastic Jobs with Release Dates on a Single Machine

Dagstuhl Seminar 20081 Scheduling, 

Slides
∙
On orthogonal symmetric chain decompositions

European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB) 2019, 

Slides
∙
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling

Slides
∙
Approximating Total Weighted Completion Time on Identical Parallel Machines with Precedence Constraints and Release Dates

Workshop on Models and Algorithms for Planning and Scheduling (MAPSP) 2019, 

Slides
∙
Gray codes and symmetric chains

45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), 

Plain Academic