( en | de | ru )

 

Disambiguation of "Ladewig, Leon"

Author of the publication

copydeleteadd this publication to your clipboard
Best Fit Bin Packing with Random Order Revisited.

, , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Wilhelm Ladewig

Dieter Ladewig

Wolfgang Ladewig

Julia Ladewig

Wilhelm Ladewig

 

Other publications of authors with the same name

Best Fit Bin Packing with Random Order Revisited., , and . MFCS, volume 170 of LIPIcs, page 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Knapsack Secretary Through Boosting., , , and . WAOA, volume 13538 of Lecture Notes in Computer Science, page 61-81. Springer, (2022)Online Algorithms for Packing Problems in the Random-Order Model (Online-Algorithmen für Packungsprobleme im Random-Order-Modell). Technical University of Munich, Germany, (2021)New results for the k-secretary problem., and . Theor. Comput. Sci., (2021)Improved Online Algorithms for Knapsack and GAP in the Random Order Model., , and . CoRR, (2020)Eine bibliometrische Analyse: Interdisziplinarität im Exzellenzcluster The Future Ocean., and . Inf. Wiss. Prax., 68 (5-6): 337-351 (2017)New Results for the k-Secretary Problem., and . ISAAC, volume 149 of LIPIcs, page 18:1-18:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Best Fit Bin Packing with Random Order Revisited., , and . Algorithmica, 83 (9): 2833-2858 (2021)Improved Online Algorithms for Knapsack and GAP in the Random Order Model., , and . Algorithmica, 83 (6): 1750-1785 (2021)New Results for the k-Secretary Problem., and . CoRR, (2020)