Beyond planarity…

I put my talk from SODA 16 on youtube (the audio quality is not great, but whatever):

  1. Part I: The circle packing theorem.
  2. Part II: The planar separator theorem — the movie.
  3. Part III: Low-density and polynomial expansion graphs.
  4. Part IV: Local search and approximation algorithms.
  5. Part V: Hardness, thesis and open problems.

The slides are available here.

Yalla, bye.