On December 13, 2019, Marten Maack (Kiel University, CAU) will give a talk about "Inapproximability Results for Scheduling with Interval and Resource Restrictions" in the context of the SFB 901.
The paper "A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks" written by Jannik Castenow, Christina Kolb and Christian Scheideler, SFB 901 project A1, wins the Best Paper Award on the 21st International Conference on Distributed Computing and Networking (ICDCN 2020).
On November 12, 2019, Heinrich Riebler has successfully defended his PhD thesis on "Efficient Parallel Branch-and-Bound Search on FPGAs Using Work Stealing and Instance-Specific Designs"
