Arindam Khan

Computer Networks and Communications · 2020

A researcher in the Science corpus: 1 paper; trusts 9 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Arindam Khan trusts overall

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

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

Who trusts Arindam Khan overall

  1. Andjela Mladenovic

Papers from Arindam Khan's perspective

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

  1. A multiple-choice secretary algorithm with applications to online auctions
  2. Knapsack Problems: Algorithms and Computer Implementations
  3. Online facility location (Proceedings IEEE International Conference on Cluster Computing)
  4. A Knapsack Secretary Problem with Applications
  5. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs (Symposium on the Theory of Computing)
  6. New Results for the $k$-Secretary Problem
  7. Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
  8. The NP-Completeness Column: An Ongoing Guide
  9. Who Solved the Secretary Problem
  10. Secretary Problems via Linear Programming

Their papers