default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeon Ladewig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c5]Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer
:
Knapsack Secretary Through Boosting. WAOA 2022: 61-81- [i5]Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer:
Knapsack Secretary Through Boosting. CoRR abs/2208.05396 (2022) - 2021
- [b1]Leon Ladewig:
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 - [j4]Susanne Albers, Arindam Khan, Leon Ladewig:
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. Algorithmica 83(6): 1750-1785 (2021) - [j3]Susanne Albers, Arindam Khan, Leon Ladewig:
Best Fit Bin Packing with Random Order Revisited. Algorithmica 83(9): 2833-2858 (2021) - [j2]Susanne Albers, Leon Ladewig:
New results for the k-secretary problem. Theor. Comput. Sci. 863: 102-119 (2021) - 2020
- [c4]Susanne Albers, Arindam Khan, Leon Ladewig:
Best Fit Bin Packing with Random Order Revisited. MFCS 2020: 7:1-7:15 - [i4]Susanne Albers, Leon Ladewig:
New Results for the k-Secretary Problem. CoRR abs/2012.00488 (2020) - [i3]Susanne Albers, Arindam Khan, Leon Ladewig:
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. CoRR abs/2012.00497 (2020) - [i2]Susanne Albers, Arindam Khan, Leon Ladewig:
Best Fit Bin Packing with Random Order Revisited. CoRR abs/2012.00511 (2020)
2010 – 2019
- 2019
- [c3]Susanne Albers, Arindam Khan, Leon Ladewig:
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. APPROX-RANDOM 2019: 22:1-22:23 - [c2]Susanne Albers, Leon Ladewig:
New Results for the k-Secretary Problem. ISAAC 2019: 18:1-18:19 - 2017
- [j1]Isabella Peters, Leon Ladewig:
Eine bibliometrische Analyse: Interdisziplinarität im Exzellenzcluster The Future Ocean. Inf. Wiss. Prax. 68(5-6): 337-351 (2017) - [c1]Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig:
Online Strip Packing with Polynomial Migration. APPROX-RANDOM 2017: 13:1-13:18 - [i1]Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig:
Online Strip Packing with Polynomial Migration. CoRR abs/1706.04939 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
