We’ll present our recent algorithmic results on online graph clustering, demand-aware network designs and local fast failover at SIAM SODA and SIAM APOCS (held virtually in January 2021)
- Tight Bounds for Online Graph Partitioning
Monika Henzinger, Stefan Neumann, Harald Räcke, and Stefan Schmid.
ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria, Virginia, USA, January 2021.
- ReNets: Statically-Optimal Demand-Aware Networks
Chen Avin and Stefan Schmid.
SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS), Alexandria, Virginia, USA, January 2021.
- On the Feasibility of Perfect Resilience with Local Fast Failover
Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tredan.
SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS), Alexandria, Virginia, USA, January 2021.
- Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time
Tobias Forner, Harald Räcke, and Stefan Schmid.
SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS), Alexandria, Virginia, USA, January 2021.
