I'm a faculty at Oxford's Department of Computer Science. My research is in the area of algorithms and computational complexity. In particular, I work on convex relaxations, discrete optimisation, and complexity of constraint satisfaction problems.
28 Which SAT problems are easy? jan 18 '11
9 Is Max-Cut APX-complete on triangle-free graphs? oct 16 '11
8 Submodular functions: reference request aug 10 '11