direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Sven Jäger

Lupe [1]

Research assistant

Fakultät II - Mathematik und Naturwissenschaften
Institut für Mathematik, Sekr. MA 5-2

Technische Universität Berlin
Straße des 17. Juni 136
10623 Berlin
Germany

E-Mail: jaeger #at# math.tu-berlin.de [2]
Tel.: +49 (0)30 314-21095
Fax: +49 (0)30 314-25191
Room: MA 511
Consultation hours: Tuesday 5:00 pm. Please send me an email before Tuesday noon in order to get the zoom link.

Research interests

  • Apprroximation algorithms
  • Scheduling
  • Symmetric Chain Decompositions

Teaching

Assistances
Summer 2021
Computerorientierte Mathematik II [3] (theoretical exercises)
Winter 2020/21
Introduction to Linear and Combinatorial Optimization (ADM I)
Summer 2020
Discrete Optimization (ADM II) [4]
Winter 2019/20
Introduction to Linear and Combinatorial Optimization (ADM I) [5]
Summer 2019
Discrete Optimization (ADM II) [6]
Winter 2018/19
Introduction to Linear and Combinatorial Optimization (ADM I) [7]
Summer 2018
Computerorientierte Mathematik II [8] (programming exercises)
Winter 2017/18
Computerorientierte Mathematik I [9] (programming exercises)
Summer 2017
Computerorientierte Mathematik II [10] (theoretical exercises)
Winter 2016/17
Computerorientierte Mathematik I [11] (theoretical exercises)

Curriculum Vitae

Since July 2016
Doctoral student with Martin Skutella [12], Technische Universität Berlin
2013 - 2016:
Master studies in Mathematics and in Applied Computer Science at Georg-August-Universität Göttingen [13], Germany.
2010 - 2013:
Bachelor studies in Mathematics and in Applied Computer Science at Georg-August-Universität Göttingen [14], Germany.
2010:
Abitur at Hainberg-Gymnasium Göttingen [15]

Publications

Däubel, K., Jäger, S., Mütze, T. and Scheucher, M.
On orthogonal symmetric chain decompositions [16].
Electronic Journal of Combinatorics, Vol. 26, pp. P3.64, 2019. Full version.

Link to original publication [17]


Däubel, K., Jäger, S., Mütze, T. and Scheucher, M.
On orthogonal symmetric chain decompositions [18].
In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), pp. 611–618, 2019. extended abstract.

Link to original publication [19]


Jäger, S. and Schöbel, A.
The blockwise coordinate descent method for integer programs [20].
Mathematical Methods of Operations Research, Vol. 91, pp. 357–381, 2019.

Link to publication [21] Link to original publication [22]


Jäger, S.
Approximating Total Weighted Completion Time on Identical Parallel Machines with Precedence Constraints and Release Dates [23].
Operations Research Letters, Vol. 46, pp. 505–509, 2018.

Link to original publication [24]


Gregor, P., Jäger, S., Mütze, T., Sawada, J. and Wille, K.
Gray codes and symmetric chains [25].
In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), pp. 66:1–66:14, 2018.

Link to original publication [26]


Jäger, S. and Skutella, M.
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling [27].
In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), pp. 43:1–43:14, 2018.

Link to original publication [28]


Gültas, M., Düzgün, G., Herzog, S., Jäger, S., Meckbach, C., Wingender, E. and Waack, S..
Quantum coupled mutation finder: Predicting functionally or structurally important sites in proteins using quantum Jensen-Shannon divergence and CUDA programming [29].
BMC Bioinformatics, Vol. 15, pp. 1-17, 2014.

Link to publication [30] Link to original publication [31]


------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.
Copyright TU Berlin 2008