BFS-project: BeHard – Beating Hardness by preprocessing
Department: Department of Informatics
Daniel Lokshtanov is a professor at the Department of Informatics at the University of Bergen, Norway. His main research areas are Theoretical Computer Science and Discrete Mathematics, with a focus on Algorithmic Graph Theory and Parameterized Complexity. He was the principal investigator of the Bergen Research Foundation grant “Beating Hardness by Pre-processing” from 2012 to 2017. This research focused on Kernelization – a mathematical framework for analyzing the performance of pre-processing algorithms for computational problems. Lokshtanov is also involved with organizing the Norwegian Informatics Olympiad for high school students.