Home Bookmarks Papers Blog

Beyond planarity: On geometric intersection graphs $\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}} \newcommand{\eps}{\varepsilon} \newcommand{\pth}[2][\!]{#1\left({#2}\right)}$

Source of slides

Recorded talk

  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 .

Last modified: Sun Sep 27 13:24:55 CDT 2015