Daniel Lokshtanov
CRML Affiliated Faculty
Associate Professor, Computer Science
Dr. Daniel Lokshtanov's research is in Theoretical Computer Science and Discrete Mathematics, most of it in Algorithmic Graph Theory and Parameterized Complexity.
Daniel Lokshtanov is 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 6 as a faculty 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 textbooks on Parameterized Algorithms [http://parameterized-algorithms.mimuw.edu.pl/] and Kernelization [https://kernelization.ii.uib.no/]