PhD Defence: Andreas Björklund

Date: January 19, 2007 (Friday) at 13:00 to 15:00

Title: Algorithmic bounds for presumably hard combinatorial problems
Opponent: Fedor Fomin (Bergen)
Committee: Devdatt Dubhashi (Chalmers), Johan Håstad (KTH), Peter Bro Miltersen (Aarhus)