Daniel Lokshtanov

Interested in postdoc or Phd/Msc student positions, undergraduate research or internships? Read this!

I am a professor and vice chair at the Department of Computer Science at the University of California Santa Barbara, and a visiting professor at the University of Bergen. I do resarch in Theoretical Computer Science and Discrete Mathematics, most of it in Algorithmic Graph Theory and Parameterized Complexity, which also was the topic of my Phd. thesis. Outside work, I enjoy running, hiking, skiing, fantasy, sci-fi, cognac, parmesan and football (the real kind). Many years ago I starred in Fana school theatre. I'm involved with organizing the Inter-Collegiate Programming Contest at UCSB. I'm also occasionally involved with organizing the Norwegian Informatics Olympiad for high school students.

Textbook from Cambridge University Press:


Theory of Parameterized Preprocessing

by Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi.

Textbook from Springer:

Parameterized Algorithms

by Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh.