Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, February 21, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Bernhard Haeupler

Intro to Expander Decopositions and Hop-Constrained Expanders

Expander Decompositions have become one of the most ubiquitous, elegant, and versatile tools for fast graph algorithms. Hop-Constrained Expanders are a recent powerful generalization of expanders. They capture not just (\ell^\infty-quantities like) flows, congestion, and cuts but simultaneously also control (\ell ^{1}-quantities like) lengths and costs. Hop-Constrained Expanders majorly extend the problems expanders and expander decompositions can be used for. This talk gives an introduction to expanders and hop-constrained expanders, their expander decompositions, and some graph algorithms build on them (e.g., (h-hop) oblivious routing, dynamic distance oracles, and fast multi-commodity-flow approximation algorithms).

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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