TU Berlin

Combinatorial Optimization & Graph Algorithms group (COGA)Sarah Morell

COGA 5-Wheel

Page Content

to Navigation

Sarah Morell


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

Tel.: +49 (0)30 314-21095
Room: MA 511
Office Hour: Friday, 14h30 to 15h30

Office Hours are cancelled until further notice.

Research interests

  • Approximation algorithms
  • Network flows

Curriculum Vitae

Since 09/18  
TU Berlin, DE
Doctoral student with Martin Skutella
15 - 18
EPFL, Lausanne, CH
Master studies in Mathematics (minor in TCS)
Master Thesis: "Algorithms for diversity maximization"
Advisor: Prof. Friedrich Eisenbrand

Workshops and Conferences

IPCO Conference, London, UK (online)
Talk "Unsplittable flows respecting upper & lower bounds"
Schloss Dagstuhl, Leipniz Center for Informatics, DE
Workshop "Scheduling"
Combinatorial Optimization Workshop, Aussois, FR
Talk "Unsplittable flows respecting upper & lower bounds"
HALG, Copenhagen, DK
Poster "Diversity maximization in doubling metrics"
IPCO Summer School/Conference, Ann Arbor, MI, USA
Poster "Single source unsplittable flows"
ISAAC, Jiaoxi, TW
Talk "Diversity maximization in doubling metrics"
MF Oberwolfach, DE
Workshop "Combinatorial Optimization"
08/17 - 12/17
Simons Institute, Berkeley, CA, USA
Program "Bridging Continuous and Discrete Optimization"

Teaching at TU Berlin

Summer 2020
Computerorientierte Mathematik II
Winter 19/20
Computerorientierte Mathematik I
Summer 2019
Computerorientierte Mathematik II
Winter 18/19
Linear Algebra for Engineering Sciences                


Morell, S. and Skutella, M..
Single source unsplittable flows with arc-wise lower and upper bounds.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, Springer, 2020.

Cevallos, A., Eisenbrand, F. and Morell, S..
Diversity maximization in doubling metrics.
29th International Symposium on Algorithms and Computation (ISAAC 2018), Vol. 123, pp. 33, 2018.

Link to publication


Quick Access

Schnellnavigation zur Seite über Nummerneingabe