I put my talk from SODA 16 on youtube (the audio quality is not great, but whatever):
- Part I: The circle packing theorem.
- Part II: The planar separator theorem — the movie.
- Part III: Low-density and polynomial expansion graphs.
- Part IV: Local search and approximation algorithms.
- Part V: Hardness, thesis and open problems.
The slides are available here.