معرفی
Lars Jaffke is an Assistant Professor in Informatics at NHH Norwegian School of Economics, Bergen, Norway. Previously, he held postdoctoral positions at IT University of Copenhagen (2024), University of Warsaw (2021-2022), and University of Bergen (2020-2021). He earned his PhD in Computer Science from the University of Bergen in 2020.
Research Interests: His work focuses on algorithmic and structural aspects of graphs, particularly width measures (treewidth, pathwidth, mim-width) and their applications to graph classes. He investigates parameterized complexity, optimization problems, and algorithm design for graphs with bounded width parameters.
Key Publications Trends: Recent works include algorithmic meta-theorems for mim-width, structural analysis of planar graphs, and complexity studies in graph coloring and domination problems. He develops dynamic programming techniques on specialized decompositions and explores logical characterizations of graph algorithms.
Scientific Awards:
- IPEC Best Paper Award (2022)
- Travel Grant from L. Meltzer Fund (2021)
- Scholarship in Applied Computer Science, State of NRW (2012)
Teaching & Service: He has served as course co-instructor for Algorithms and Programming with Python (2024) and taught Complexity Theory and graph algorithms at University of Bergen. He has been on program committees for IPEC 2024 and ESA 2023, and regularly reviews for top-tier conferences and journals like FOCS, STOC, SIAM Journal on Computing, and Theoretical Computer Science.
