Daniel Lokshtanov

Daniel Lokshtanov is a Professor and Vice Chair at the Department of Computer Science at the University of California, Santa Barbara (UCSB), with a visiting professor affiliation at the University of Bergen. He is renowned for his work in Theoretical Computer Science and Discrete Mathematics, particularly focusing on Algorithmic Graph Theory and Parameterized Complexity.

• Key roles: Professor (UCSB, since 2020), Vice Chair (UCSB), Visiting Professor (University of Bergen)
• Research focus: Kernelization, Graph Minors, Exact Algorithms, Treewidth, Subexponential Algorithms

Research Trends: His recent publications (2022-2020) demonstrate expertise in applying Parameterized Complexity to Graph Algorithms, including work on Unit Disk Graphs, Graph Reconfiguration, and Subexponential Time Algorithms. Topics span Graph Contraction, Obstacle Removal, and Kemeny Rank Aggregation.

Scientific Awards:

• Outstanding Young Researcher Meltzer Award
• Best ESA Paper Award (2015)

Advising: While not actively seeking new PhD students, he supervises MS students at UCSB and has mentored numerous advisees through Parameterized Algorithms research. He co-organizes the Inter-Collegiate Programming Contest at UCSB and the Norwegian Informatics Olympiad for high school students.