Ph.D Computer Science, University of Bergen, Norway
M.Sc. Computer Science, University of Bergen, Norway
B.Sc. Mathematics, University of Bergen, Norway
Daniel Lokshtanov is currently an Associate Professor of Computer Science at UCSB. He received his PhD in Computer Science (2009), from the University of Bergen. Lokshtanov spent two years (2010-2012) as a Simons Postdoctoral Fellow at University of California at San Diego, and is now a professor at the Department of Informatics at the University of Bergen. His main research interests are in graph algorithms, parameterized algorithms and complexity. He is a recipient of the Meltzer prize, the Bergen Research Foundation young researcher grant, and of an ERC starting grant on parameterized algorithms. He is a co-author of the recent Parameterized Algorithms book [http://parameterized-algorithms.mimuw.edu.pl/].
Dr. Daniel Lokshtanov's research is in Theoretical Computer Science and Discrete Mathematics, most of it in Algorithmic Graph Theory and Parameterized Complexity, which also was the topic to his Ph.D thesis.
Honors and Awards
Outstanding Young Researcher Meltzer Award, 2009
EATCS European Symposium on Algorithms (ESA 2015) Best Paper