I will be on the program committee of SOSA 2022 (Symposium on Simplicity in Algorithms).
I'm looking for a PhD student to work in my project "Dynamic Algorithms Against Strong Adversaries". The main goal of this project is to design new algorithms with theoretical guarantees for fundamental graph problems, like shortest paths and maximal matching, in a dynamic setting that allows for insertions and deletions of edges to which the algorithm should react as fast as possible.
More graduation news: My student Mara Grilnberger finished her bachelor thesis titled "On Thorup-Zwick-based hopsets beyond Huang-Pettie". Congratulations, Mara!
My student Martin Grösbacher finished his bachelor thesis titled "A more streamlined exposition to random delay clustering". Congratulations for graduating, Martin!
Our DISC 2017 paper "Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models" was accepted to SIAM Journal on Computing. Joint work with Ruben Becker, Andreas Karrenbauer, and Christoph Lenzen.
