Scholar
Daniel Lokshtanov
Google Scholar ID: vaQGFLsAAAAJ
Professor of Computer Science, UCSB
Citations & Impact
Citations
8,141
H-index
38
i10-index
140
Publications
20
Co-authors
157
list available
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- Textbooks: 'Kernelization: Theory of Parameterized Preprocessing' (Cambridge University Press); 'Parameterized Algorithms' (Springer).
Research Experience
- Involved in organizing the Inter-Collegiate Programming Contest at UCSB; Occasionally involved in organizing the Norwegian Informatics Olympiad for high school students; Served as PC Chair or participant in multiple international conferences (such as STACS 2024, STOC 2023, WADS 2023, etc.).
Education
- PhD Thesis Topic: Parameterized Complexity
Background
- Research Interests: Theoretical Computer Science, Discrete Mathematics, Algorithmic Graph Theory, and Parameterized Complexity; Professional Field: Algorithmic Graph Theory and Parameterized Complexity; Bio: Professor and Vice Chair at the Department of Computer Science, University of California Santa Barbara, and a visiting professor at the University of Bergen.
Miscellany
- Personal Interests: Running, hiking, skiing, fantasy, sci-fi, cognac, parmesan, and football (the real kind). Starred in Fana school theatre many years ago.
