PhD position in algorithms and complexity at KTH Royal Institute of Technology, Stockholm

The Theoretical Computer Science group at KTH Royal Institute of
Technology invites applications for a PhD position in Theoretical
Computer Science (Algorithms & Complexity).

We are seeking a PhD student in Theoretical Computer Science for the
research project "Trading Time for Approximation in Optimization" in
the areas of approximation algorithms and exact algorithms.

The application deadline is January 31, 2014. See
http://www.csc.kth.se/~austrin/jobs/D-2013-0775.php for the full, formal
announcement with more information and instructions for how to
apply. Informal enquiries about this position are welcome and may be
sent to Per Austrin (austrin@kth.se).

Best regards,
Per Austrin