معرفی
Victor Lagerkvist is an Associate Professor at the Department of Computer Science (IDA), Linköping University, Sweden. He is affiliated with the Theoretical Computer Science Laboratory (TCSLAB) and the Artificial Intelligence and Integrated Computing Systems (AIICS) division. His research focuses on the algebraic method for analyzing computational complexity, particularly in constraint satisfaction problems (CSPs), SAT, and graph homomorphism problems.
- PhD in Computer Science (2016, Linköping University)
- Habilitation (2020, Linköping University)
His recent work investigates fine-grained complexity, twin-width, and universal algebra to improve algorithms for NP-hard problems. Publications span topics like propositional abduction, Allen's interval algebra, and semiring-based dynamic programming.
His scientific awards include the Swedish Research Council Starting Grant (2020) and the 2017 Young Researcher Prize from the Ruth and Nils-Erik Stenbäck Foundation. He supervises PhD students such as Leif Eriksson and serves as a secondary supervisor for others at Linköping University and Université de Lorraine.
