Session 8A - New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut