Sepehr Assadi and collaborators receive STOC 2025 Best Paper Award
The award recognizes the research team’s paper, Vizing’s Theorem in Near-Linear Time, which introduces a randomized algorithm that computes a (∆ + 1)-edge colouring in near-linear time with high probability, a near-optimal result for this classic problem in graph theory.