Hard Problems on Random Graphs. - Jan Dreier; Henri Lotze; Peter Rossmanith (ICALP, 2020)

Further Results on Online Node- and Edge-Deletion Problems with Advice. - Li-Hsuan Chen; Ling-Ju Hung; Henri Lotze; Peter Rossmanith (IWOCA, 2020)

The Secretary Problem with Reservation Costs. - Elisabet Burjons; Matthias Gehnen; Henri Lotze; Daniel Mock; Peter Rossmanith (COCOON, 2021)

Online Simple Knapsack with Reservation Costs. - Hans-Joachim Böckenhauer; Elisabet Burjons; Juraj Hromkovic; Henri Lotze; Peter Rossmanith (STACS, 2021)

Online Node- and Edge-Deletion Problems with Advice. - Li-Hsuan Chen; Ling-Ju Hung; Henri Lotze; Peter Rossmanith (Algorithmica, 2021)

The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. - Elisabet Burjons; Janosch Fuchs; Henri Lotze (IWOCA, 2022)

Delaying Decisions and Reservation Costs. - Elisabet Burjons; Fabian Frei; Matthias Gehnen; Henri Lotze; Daniel Mock; Peter Rossmanith (COCOON (1), 2023)

Advice Complexity Bounds for Online Delayed ℱ-Node-, H-Node- and H-Edge-Deletion Problems. - Niklas Berndt; Henri Lotze (IWOCA, 2023)

The Online Simple Knapsack Problem with Reservation and Removability. - Elisabet Burjons; Matthias Gehnen; Henri Lotze; Daniel Mock; Peter Rossmanith (MFCS, 2023)

Online Simple Knapsack with Bounded Predictions. - Matthias Gehnen; Henri Lotze; Peter Rossmanith (STACS, 2024)

Online Knapsack Problems with Estimates. - Jakub Balabán; Matthias Gehnen; Henri Lotze; Finn Seesemann; Moritz Stocker (MFCS, 2025)

Online Unbounded Knapsack. - Hans-Joachim Böckenhauer; Matthias Gehnen; Juraj Hromkovic; Ralf Klasing; Dennis Komm; Henri Lotze; Daniel Mock; Peter Rossmanith; Moritz Stocker (Theory Comput. Syst., 2025)