Leon Ladewig

According to our database, Leon Ladewig authored at least 8 papers between 2017 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Knapsack Secretary Through Boosting.

Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

2021

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

Leon Ladewig

PhD thesis, 2021

New results for the <i>k</i>-secretary problem.

Susanne Albers, Leon Ladewig

Theor. Comput. Sci., 2021

2020

Best Fit Bin Packing with Random Order Revisited.

Susanne Albers, Arindam Khan, Leon Ladewig

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

New Results for the k-Secretary Problem.

Susanne Albers, Leon Ladewig

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Improved Online Algorithms for Knapsack and GAP in the Random Order Model.

Susanne Albers, Arindam Khan, Leon Ladewig

Proceedings of the Approximation, 2019

2017

Eine bibliometrische Analyse: Interdisziplinarität im Exzellenzcluster The Future Ocean.

Isabella Peters, Leon Ladewig

Inf. Wiss. Prax., 2017

Online Strip Packing with Polynomial Migration.

Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig

Proceedings of the Approximation, 2017