Marek Sokołowski gave a talk on a new parallel algorithm computing single-source shortest paths in directed graphs at the Discrete Math Seminar

On February 24, 2026, Marek Sokołowski from the Max Planck Institute of Informatics gave a talk at the Discrete Math Seminar on a new parallel algorithm computing single-source shortests paths in directed graphs. The title of his talk was “Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP“.