This fall, we have four new group members joining: Farehe Soheil who has been working on graph theory and approximate algorithms already started in the beginning of October as a PhD student. The same holds true for Georg Tennigkeit who already did his Master’s degree at HPI. Also a new PhD student, Panagiotis Aivasiliotis has previously worked on graph externality optimization via maximizing the difference of a submodular and a modular function. He will start in November. Finally, Shaily Verma will join our group as a postdoctoral researcher. Previously, she worked on designing efficient algorithms for graph problems or proving lower bounds on its time complexity at the Institute of Mathematical Sciences.
Welcome to all new members!
