Thore Husfeldt received his PhD in computer science at Aarhus University, with a thesis on the computational complexity of data structures. More recently, his research has focused on algorithms for computationally hard problems, in particular fundamental graph problems. His specific interest is computation in the exponential time regime, including algorithms design and parameterized complexity. He is Professor of Computer Science at Lund University in Sweden and Associate Professor at IT University of Copenhagen in Denmark.
- Fine-Grained Complexity and Algorithm Design, Fall 2015. Visiting Scientist and Workshop Organizer.