Susanne Albers

Computer Networks and Communications · 2003–2020

A researcher in the Science corpus: 3 papers; trusts 17 researchers and is trusted by 20 researchers here, as inferred from the citation graph.

Subfields

• Computer Networks and Communications — 14 citations into it; #2,162 of 9,886 by trust here, #7,140 by citations
• Management Science and Operations Research — 9 citations into it; #2,705 of 11,946 by trust here, #8,906 by citations
• Algorithms & Complexity — 8 citations into it
• Game & Decision Theory — 6 citations into it
• Computational Theory and Mathematics — 5 citations into it
• Industrial and Manufacturing Engineering — 5 citations into it

Whom Susanne Albers trusts overall

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

1. Robert D. Kleinberg
2. Moshe Babaioff
3. Adam Meyerson
4. M. Burrows
5. Mohammad Mahdian
6. Niv Buchbinder
7. Silvano Martello
8. T-H. Hubert Chan
9. Peter J. Denning
10. Nicole Immorlica

Who trusts Susanne Albers overall

1. Leonora Bianchi
2. Andjela Mladenovic
3. Elias Boutros Khalil
4. Thomas Schlechte
5. Warrren B Powell
6. Marco Dorigo
7. Avishek Joey Bose
8. Bistra N. Dilkina
9. Arindam Khan
10. Luca Maria Gambardella

Papers from Susanne Albers's perspective

Ordered by how strongly the researchers Susanne Albers 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. Competitive auctions and digital goods (ACM-SIAM Symposium on Discrete Algorithms)
4. A Knapsack Secretary Problem with Applications
5. Knapsack Problems: Algorithms and Computer Implementations
6. Secretary Problems via Linear Programming
7. Online facility location (Proceedings IEEE International Conference on Cluster Computing)
8. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs (Symposium on the Theory of Computing)
9. New Results for the $k$-Secretary Problem
10. Speed is as powerful as clairvoyance (JACM)

Their papers

• Online algorithms: a survey (2003) — 304 citations
• 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