New PhD student Jacob Evald joins BARC

On September 1, Jacob started as a PhD student in the Algorithms and Complexity section at DIKU. He joins a project under the supervision of Associate Professor Christian Wulff-Nilsen. The project is supported by Christian's Sapere Aude starting grant from DFF. Jacob has done both his bachelor's and master's degree at DIKU. He did his thesis on vertex-label distance oracles, also supervised by Christian Wulff-Nilsen.
Jacob's research will be in static and dynamic graph algorithms related to shortest paths, graph connectivity, etc. The goal is to obtain new upper and/or lower bounds in order to achieve a better understanding of the complexity of such problems.