Date: March 4, 2026 (Wednesday) at 4PM (UK time)

Speaker: Prof. Assaf Naor, Princeton University, USA

Topic: Sparsest cut

About the Talk: Prof. Assaf Naor is a world-leading mathematician known for his groundbreaking contributions at the interface of metric geometry, analysis, and approximation algorithms. His work has earned numerous major distinctions, including the Nemmers Prize in Mathematics, the Ostrowski Prize, and the Bôcher Memorial Prize. In this talk, he will discuss the Sparsest Cut problem, explain its significance in algorithm design, and present recent algorithm for its efficient approximation, which is a culmination of decades of work.

Visit https://th21.le.ac.uk/next-talks/ for the link to join

Alternatively, you can open Teams -> Calendar -> Meet now -> Join with an ID, and then enter Meeting ID: 321 254 275 995 46, Passcode: jd9na63y