New hardness results for planar graph problems in p and an algorithm for sparsest cut.

Amir Abboud, Vincent Cohen-Addad, Philip N. Klein

Browse the full STOC paper archive.