Leon Ladewig

Computer Networks and Communications · 2020

A researcher in the Science corpus: 2 papers; trusts 15 researchers and is trusted by 9 researchers here, as inferred from the citation graph.

Subfields

• Computer Networks and Communications — 12 citations into it
• Management Science and Operations Research — 8 citations into it
• Algorithms & Complexity — 7 citations into it
• Game & Decision Theory — 6 citations into it
• Computational Theory and Mathematics — 5 citations into it

Whom Leon Ladewig trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Robert D. Kleinberg
2. Moshe Babaioff
3. Niv Buchbinder
4. Adam Meyerson
5. Mohammad Mahdian
6. Susanne Albers
7. T-H. Hubert Chan
8. Nicole Immorlica
9. Silvano Martello

Who trusts Leon Ladewig overall

1. Andjela Mladenovic
2. Susanne Albers

Papers from Leon Ladewig's perspective

Ordered by how strongly the researchers Leon Ladewig trusts endorse each paper. Same corpus, a different order for every researcher.

1. A multiple-choice secretary algorithm with applications to online auctions
2. Who Solved the Secretary Problem
3. A Knapsack Secretary Problem with Applications
4. Knapsack Problems: Algorithms and Computer Implementations
5. Secretary Problems via Linear Programming
6. Online facility location (Proceedings IEEE International Conference on Cluster Computing)
7. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs (Symposium on the Theory of Computing)
8. New Results for the $k$-Secretary Problem
9. Approximating the stochastic knapsack problem: the benefit of adaptivity (45th Annual IEEE Symposium on Foundations of Computer Science)
10. Competitive auctions and digital goods (ACM-SIAM Symposium on Discrete Algorithms)

Their papers

• New Results for the $k$-Secretary Problem (2020) — 23 citations
• Improved Online Algorithms for Knapsack and GAP in the Random Order Model (2020) — 40 citations