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

Transitive Avoidance Games on Boards of Odd Size. - Matthias Gehnen; Eberhard Triesch (Electron. J. Comb., 2021)

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

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

Tetris Is Not Competitive. - Matthias Gehnen; Luca Venier (FUN, 2024)

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

Tree Coloring: Random Order and Predictions. - Fabian Frei; Matthias Gehnen; Dennis Komm; Rastislav Královic; Richard Královic; Peter Rossmanith; Moritz Stocker (CoRR, 2024)

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

Graph Exploration with Edge Weight Estimates. - Matthias Gehnen; Ralf Klasing; Émile Naquin (CoRR, 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)

Online General Knapsack with Reservation Costs. - Elisabet Burjons; Matthias Gehnen (CoRR, 2025)

Online Bin Packing with Item Size Estimates. - Matthias Gehnen; Andreas Usdenski (CoRR, 2025)