Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator
Unique games on expanding constraint graphs are easy
Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08
Proceedings of the 44th symposium on Theory of Computing - STOC ’12
Madhur Tulsiani
Alexandra Kolla
Subhash A. Khot
Sanjeev Arora
Sushant Sachdeva
David Steurer
Bypassing UGC from Some Optimal Geometric Inapproximability Results