Online Strip Packing with Polynomial Migration. - Klaus Jansen; Kim-Manuel Klein; Maria Kosche; Leon Ladewig (APPROX-RANDOM, 2017)

Eine bibliometrische Analyse: Interdisziplinarität im Exzellenzcluster The Future Ocean. - Isabella Peters; Leon Ladewig (Inf. Wiss. Prax., 2017)

New Results for the k-Secretary Problem. - Susanne Albers; Leon Ladewig (ISAAC, 2019)

Improved Online Algorithms for Knapsack and GAP in the Random Order Model. - Susanne Albers; Arindam Khan 001; Leon Ladewig (Algorithmica, 2021)

Best Fit Bin Packing with Random Order Revisited. - Susanne Albers; Arindam Khan 001; Leon Ladewig (Algorithmica, 2021)

New results for the k-secretary problem. - Susanne Albers; Leon Ladewig (Theor. Comput. Sci., 2021)

Online Algorithms for Packing Problems in the Random-Order Model (Online-Algorithmen für Packungsprobleme im Random-Order-Modell) - Leon Ladewig (2021)

Knapsack Secretary Through Boosting. - Andreas Abels; Leon Ladewig; Kevin Schewior; Moritz Stinzendörfer (WAOA, 2022)