Prof. Dr. Nicole Megow

Universit?t Bremen
FB3: Mathematik/Informatik
Bibliothekstr. 5
28359 Bremen
Germany
Office: MZH 3310
Phone: +49 (421) 218-63581
Email
Office hours: by appointment

Bio

Nicole Megow studied Mathematics at TU Berlin and the Massachusetts Institute of Technology, USA. She received her PhD from TU Berlin in 2006 under the supervision of Rolf M?hring. She was postdoc and senior researcher at the Max Planck Institute for Informatics, Saarbrücken, held n interim professorship in Discrete Optimization at TU Darmstadt (2011-12), and led an Emmy Noether Research Group at TU Berlin starting in 2012. Subsequently, she was an assistant professor for Discrete Mathematics at TU Munich. Since 2016, she has held the Chair of Combinatorial Optimization in the Faculty of Mathematics and Computer Science at the University of Bremen.

Her research has been recognized with several awards, including the Dissertation Award of the German Operations Research Society (2007) and the Berlin Science Award for Young Researchers (2013). In the same year, she received the Heinz Maier-Leibnitz Prize, the most prestigious German award for early-career researchers, jointly presented by the German Research Foundation (DFG) and the Federal Ministry of Education and Research (BMBF). She was an elected member of the Elisabeth-Schiemann-Kolleg of the Max Planck Society (2013–2016) and was twice listed among Germany’s "Top 40 Under 40" (Capital, 2014, 2015). Since 2020, she has been an elected member of the DFG review board for Theoretical Computer Science.

Nicole Megow's research focuses on mathematical optimization and the design and analysis of algorithms, with an emphasis on decision-making under uncertainty and learning-augmented algorithms. She is a member of Cluster of Excellence The Martian Mindset and contributes actively to the high profile area Minds, Media, Machines, the research cluster Dynamics in Logistics and the Data Science Center.

Research Interests

  • Combinatorial optimization, discrete optimization
  • Efficient algorithms, approximation algorithms
  • Scheduling, resource allocation, packing, network design, routing
  • Uncertainty models: online, stochastic, robust, explorable

Publications

Current Phd Students and Postdocs

  • Max Stahlberg, postdoc, (since 2025)
  • Joes Biburger, PhD student (since 2025)
  • Sarah Morell, postdoc (since 2025)
  • Bart Zondervan, PhD student (since 2024)
  • Zhenwei Liu, PhD student (jointly with Guochuan Zhang, since 2023)
  • Alexander Lindermayr, PhD student (2020-2024), postdoc
  • Previous postdocs and phd students: here

Service

Projects