University of Copenhagen, Denmark
Jakob Nordström is a professor at the Department of Computer Science at the University of Copenhagen, Denmark, and also has a part-time affiliation with the the Department of Computer Science at Lund University. His research interests lie in understanding combinatorial optimization problems -- to prove formally, on the one hand, that many such problems are beyond the reach of current algorithmic techniques, but also, on the other hand, to develop new algorithms that have the potential to go significantly beyond the current state of the art. Recently, he has also been working on harnessing complexity theory to produce certificates that algorithms are actually computing correct results. Prior to moving to Copenhagen and Lund, Jakob worked at KTH Royal Institute of Technology as an assistant professor and then associate professor during the years 2011-2019. During 2008-2010 he was a postdoc at the Computer Science and Artificial Intelligence Laboratory at the Massachusetts Institute of Technology hosted by Madhu Sudan. Before that he was a PhD student of Johan Håstad in the Theory Group at KTH, where he defended my PhD thesis in May 2008.