Sarah Morell

 

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

Office: MA 520
Telephone: +49 30 314 78656
Email: (lastname)@math.tu-berlin.de

0000-0002-1728-6936
Bibliography on dblp
Google Scholar

About me

I am currently a PhD student at TU Berlin under the supervision of Prof. Dr. Martin Skutella. My research interest lies in Combinatorial Optimization, more specifically in network flow problems and approximation algorithms.

Prior to that, I have received my M.Sc. in Mathematics (minor in Theoretical Computer Science) at EPFL in Switzerland. My master thesis about algorithms for diversity maximization was advised by Prof. Dr. Friedrich Eisenbrand.

In my personal life, I am married and I have one child. I am currently on maternity leave.

Workshops and Summer Schools

• 07/2022 Summer School and Workshop on "Modern Trends in Combinatorial Optimization" at EPFL, Switzerland.
• 12/2021 Workshop "Parametrized Complexity and Discrete Optimization" at HIM in Bonn, Germany.
• 11/2021 Workshop "Approximation and Relaxation" at HIM in Bonn, Germany.
• 11/2021 Workshop "Combinatorial Optimization" at MF Oberwolfach, Germany.
• 02/2020 Workshop "Scheduling" at Schloss Dagstuhl, Leipniz Center for Informatics, Germany.
• 01/2020 Workshop "Combinatorial Optimization" in Aussois, France.
• 05/2019 IPCO Summer School, University of Michigan in Ann Arbor, MI, USA.
• 12/2018 Reunion Workshop of the Trimester Program at Simons Institute, Berkeley, CA, USA.
• 11/2018 Workshop "Combinatorial Optimization" at MF Oberwolfach, Germany.
• 08/2017 - 12/2017 Trimester Program "Bridging Continuous and Discrete Optimization" at Simons Institute, Berkeley, CA, USA.

Research stays

• 02/2023 - 03/2023 Visiting Dr. Lars Rohwedder at Maastricht University, Netherlands.
• 03/2020 - 04/2020 Visiting Prof. Dr. Stefan Weltge at TU Munich, Germany.

Publications

2022

• Single source unsplittable flows with arc-wise lower and upper bounds (Sarah Morell and Martin Skutella)
  Math. Program., 192(1):477–496, 2022.
  Extended abstract appeared in Proc. of IPCO 2020
  DOI Bibtex
  @article{MorellSkutella2021,
  author = {Morell, Sarah and Skutella, Martin},
  journal = {Math. Program.},
  title = {Single source unsplittable flows with arc-wise lower and upper bounds},
  pages = {477--496},
  year = {2022},
  volume = {192},
  number = {1},
  doi = {10.1007/s10107-021-01704-4},
  }
  

2021

• Minimum-cost integer circulations in given homology classes (Sarah Morell, Ina Seidel and Stefan Weltge)
  SODA 2021 – Proc. 32nd ACM-SIAM Symposium on Discrete Algorithms, pp. 2725–2739.
  Bibtex
  @inproceedings{morell2021minimum,
  title = {Minimum-cost integer circulations in given homology classes},
  author = {Morell, Sarah and Seidel, Ina and Weltge, Stefan},
  booktitle = {SODA 2021 – Proc. 32nd ACM-SIAM Symposium on Discrete Algorithms},
  pages = {2725--2739},
  year = {2021},
  }
  

2020

• Single source unsplittable flows with arc-wise lower and upper bounds (Sarah Morell and Martin Skutella)
  IPCO 2020 – Proc. 21st Conference on Integer Programming and Combinatorial Optimization, pp. 294–306.
  Full paper appeared in Math. Program. 2021
  DOI Bibtex
  @inproceedings{MorellSkutella-IPCO2020,
  author = {Morell, Sarah and Skutella, Martin},
  booktitle = {IPCO 2020 – Proc. 21st Conference on Integer Programming and Combinatorial Optimization},
  doi = {10.1007/978-3-030-45771-6\_23},
  pages = {294--306},
  title = {Single source unsplittable flows with arc-wise lower and upper bounds},
  year = {2020},
  }
  

2018

• Diversity Maximization in Doubling Metrics (Alfonso Cevallos, Friedrich Eisenbrand and Sarah Morell)
  ISAAC 2018 – Proc. 29th International Symposium on Algorithms and Computation.
  Bibtex
  @inproceedings{cevallos2018diversity,
  title = {Diversity Maximization in Doubling Metrics},
  author = {Cevallos, Alfonso and Eisenbrand, Friedrich and Morell, Sarah},
  booktitle = {ISAAC 2018 – Proc. 29th International Symposium on Algorithms and Computation},
  year = {2018},
  }