1. Angelopoulos, S., Dürr, C., Jin, S.: Online maximum matching with recourse. J. Comb. Optim. 40(4), 974–1007 (2020). https://doi.org/10.1007/s10878-020-00641-w
2. Böckenhauer, H.-J., Burjons, E., Hromkovič, J., Lotze, H., Rossmanith, P.: Online simple knapsack with reservation costs. In: Bläser, M., Monmege, B., (eds.), 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16–19 March 2021, Saarbrücken, Germany (Virtual Conference), vol. 187 of LIPIcs, pp. 16:1–16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
3. Böckenhauer, H.-J., Dreier, J., Frei, F., Rossmanith, P.: Advice for online knapsack with removable items. CoRR, abs/2005.01867 (2020)
4. Lecture Notes in Computer Science;H-J Böckenhauer,2009
5. Böckenhauer, H.-J., Komm, D., Královič, R., Rossmanith, P.: The online knapsack problem: Advice and randomization. Theor. Comput. Sci. 527, 61–72 (2014)