Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
| Mittagsseminar Talk Information |
Date and Time: Tuesday, September 17, 2024, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Simon Meierhans
In this talk, I want to show you a simple dynamic spanner by reduction to the All-Pairs Shortest Paths problem (https://arxiv.org/abs/2408.11368). I hope to go through the whole construction in detail, and I'll make sure that no prior knowledge on graph algorithms is required to follow. If I have time, I'll give you a quick update on recent progress on dynamic minimum-cost flow that we made since I last gave a talk at this seminar in spring.
Upcoming talks | All previous talks | Talks by speaker |
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login