See for Jesper's homepage.
Jesper Nederlof is an associate professor in the Algorithms and Complexity group at UU. He received his M.Sc. in Applied Computing Science from Utrecht 木瓜福利影视 (the Netherlands) in 2008, and successfully defended his PhD thesis titled `Space and Time Efficient Structural Improvements of Dynamic Programming Algorithms鈥� in December 2011, which he obtained at the 木瓜福利影视 of Bergen (Norway). He was fortunate enough to have Pinar Heggernes as PhD supervisor. In 2012-2014, he continued the research of his PhD thesis as a postdoctoral researcher at Utrecht 木瓜福利影视 funded by a NWO open competition project. From February 2014 to October 2014, he worked as a postdoctoral researcher at Maastricht 木瓜福利影视, and afterwards he worked 4 months as research fellow at the 木瓜福利影视 of Berkeley and as assistant professor at the combinatorial optimization group in the mathematics department of TU/e.
In his research, Jesper likes to design algorithms for NP-complete problems with small, but still exponential (since he doesn鈥檛 expect to prove P=NP) worst-case run time.
But his research interests also include many other subfields of Theoretical Computer Science. For example, he also wrote papers featuring a substantial amount of (among others) algorithmic game theory, information theory, representation theory, approximation algorithms and online algorithms.
Jesper has been involved as lecturer or instructor courses involving algorithms, (non)-linear optimization, graph theory, (vector) calculus, modeling, and management and product development.