Thore Husfeldt

Thore Husfeldt is a Professor of Theoretical Computer Science at the IT University of Copenhagen, leading the Algorithms Research Group. He holds a PhD from the University of Aarhus (1997), a Docent title from Lund University (2007), and has been a Professor at the University of Lund since 2012. His research focuses on algorithms, with a concentration on exponential time algorithms, combinatorial optimization, and graph theory.

Education

• Bachelor (B.Sc.) in Computer Science and Mathematics, University of Aarhus (1993)
• Cand. scient. (M.Sc.) in Computer Science, University of Aarhus (1994)
• Ph.D. in Science (Computer Science), University of Aarhus (1997)
• Docent, Lund University (2007)
• Professor of Computer Science, Lund University (2012)

Research Interests
Husfeldt’s work explores foundational aspects of algorithms, including exponential time algorithms for hard problems, graph algorithms, and combinatorial optimization. His recent contributions address topics like cycle detection, path enumeration, and efficient algorithm design for NP-hard problems. His research bridges theoretical computer science with practical algorithmic challenges.

Awards

• Best Paper Award at ICALP 2014 (Track A: Algorithms, Complexity, and Games)
• Excellence in Teaching Award (2018)

Grants & Projects
Husfeldt leads major initiatives such as the BARC2: Basic Algorithms Research Copenhagen (Villum Foundation), focusing on theoretical algorithm research, and DIREC, developing algorithms education through animated videos. He also collaborates on projects like Unifying Theories for Graph Modification Problems (Independent Research Fund Denmark).

Labs & Teams
He oversees the Algorithms Research Group at ITU and contributes to the BARC (Basic Algorithms Research Copenhagen) initiative, fostering collaborations in algorithmic theory and applications.