On November 25, 2024, Tijn de Vos successfully defended their dissertation titled “Graph Sparsification in Distributed and Dynamic Settings” at the Paris Lodron University of Salzburg (PLUS). Tijn’s work explored advanced algorithms for fundamental computational graph problems, in the realm of distance, flow, and connectivity. By addressing dynamic, distributed, and quantum models, Tijn’s research introduced faster algorithmic solutions using graph sparsification – a method to reduce graph complexity while preserving key properties. Key contributions included improvements in shortest path approximations, tree packings, and cut sparsifiers.