With the beginning of the new year Davis Issac will join the Algorithm Engineering group. He is a researcher in combinatorial optimization as well as parameterized and approximation algorithms. Davis received his PhD in February 2019 On Some Covering, Partition and Connectivity Problems in Graphs from the Max Planck Institute for Informatics at the University of Saarbrücken. Since then he worked as a postdoctoral researcher at the Charles University in Prague.
