1. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. In: 24th Annual Symposium on Foundations of Computer Science, pp. 265–273. IEEE (1983)
2. Lecture Notes in Computer Science;S Berndt,2020
3. Berndt, S., Epstein, L., Jansen, K., Levin, A., Maack, M., Rohwedder, L.: Online bin covering with limited migration. In: Bender, M.A., Svensson, O., Herman, G. (eds.) 27th Annual European Symposium on Algorithms, ESA 2019. LIPIcs, Munich/Garching, Germany, 9–11 September 2019, vol. 144, pp. 18:1–18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
4. Berndt, S., Jansen, K., Klein, K.-M.: Fully dynamic bin packing revisited. Math. Program., 109–155 (2018). https://doi.org/10.1007/s10107-018-1325-x
5. Bhore, S., Li, G., Nöllenburg, M.: An algorithmic study of fully dynamic independent sets for map labeling. In: ESA. LIPIcs, vol. 173, pp. 19:1–19:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)