An efficient test for product states, with applications to quantum Merlin-Arthur games [arXiv]
Authors:Aram W. Harrow: Department of Mathematics, University of Bristol & Departmenty of Computer Science and Engineering, University of Washington and Ashley Montanaro: Department of Computer Science, University of Bristol and Department of Applied Mathematics and Theoretical Physics, University of Cambridge

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs
Authors: Irit Dinur and Subhash Khot and Will Perkins and Muli Safra

Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time [arXiv]
Authors: Glencora Borradaile: School of Electrical Engineering and Computer Science, Oregon State University; Piotr Sankowski: Institute of Informatics, University of Warsaw and Department of Computer and System Science, Sapienza University of Rome; Christian Wulff-Nilsen: Department of Computer Science, University of Copenhagen

Subexponential Algorithms for Unique Games and Related problems [pdf]
Authors: Sanjeev Arora: Princeton University and Center for Computational Intractability; Boaz Barak: Microsoft Research and Princeton University; David Steurer: Princeton University and Center for Computational Intractability.