Laura Vargas Koch
University of Bonn | Research Institute for Discrete Mathematics and Hausdorff Center of Mathematics
About Me
I am a professor (Bonn Junior Fellow) at the research institute of discrete mathematics and the hausdorff center for mathematics. My research interests lie in the areas of combinatorial optimization and algorithmic game theory. In the field of combinatorial optimization, my work focuses on approximation algorithms. Within algorithmic game theory, I specifically study dynamic routing games and Nash flows over time.
Before coming to Bonn, I was a PostDoc at ETH Zurich, hosted by Rico Zenklusen and at CMM in Santiago de Chile, hosted by José Correa. I completed my Ph.D. at RWTH Aachen under the supervision of Britta Peis.
TEACHING
Winter term 2023/24: Selected topics in discrete mathematics: Optimization and game theory in flow problems.
Summer term 2024: Linear and integer optimization.
Recent Activities
I am/ was member of the following PCs: ESA 2024, EC 2024, WAOA 2023, WINE 2023, EC 2023, WINE 2021.
I am/was co-organizing:
A Dagstuhl seminar on Dynamic Traffic Models in Transportation Science
3rd IGAFIT Workshop for Algorithms Postdocs in Europe (AlgPiE by IGAFIT 2024)
The Day on Computational Game Theory 2024 in Bonn
A Dagstuhl Research Meeting on Mathematical Foundations on Dynamic Nash Flows 2020
Selected PUblications And Talks
Single-source unsplittable flows in planar graphs.
with Vera Traub and Rico Zenklusen
(SODA 2024) [arxiv]
Convergence of approximate and packet rounting equilibria to Nash flows over time
with Neil Olver and Leon Sering
(FOCS 2023)
Techniques for Generalized k-Center Problem
with Georg Anegg and Rico Zenklusen
(ESA 2022) [arXiv]
Convergence of a Packet-Routing Model to Flows Over Time
with Leon Sering and Theresa Ziemke
(EC 2021) [arXiv]
Podcast
To communicate our research topics to a broader audience and to entertain our students during the Covid pandemic we recorded 20 episodes of the German-speaking podcast Algo2Go together with Niklas Rieken and Björn Tauer.