Heydrich, Sandy Algorithms and Complexity, MPI for Informatics, Max Planck Society; International Max Planck Research School, MPI for Informatics, Max Planck Society;
https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/27141 (Any fulltext)
Heydrich, S. (2018). A Tale of Two Packing Problems: Improved Algorithms and Tighter Bounds for Online Bin Packing and the Geometric Knapsack Problem. PhD Thesis, Universität des Saarlandes, Saarbrücken. doi:10.22028/D291-27240.