Joseph

1. A Polylogarithmic-Competitive Algorithm for the k-Server Problem
   2011/10/07 by Bansal, Nikhil, Buchbinder, Niv, Madry, Aleksander +2 · 6 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. Min-Max Graph Partitioning and Small Set Expansion
   2011/10/19 by Bansal, Nikhil, Feige, Uriel, Krauthgamer, Robert +5 · 2 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)
   2021/06/09 by Niv Buchbinder, Buchbinder, Niv, Joseph Joseph +4 · 3 citations
   Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #Optimization and Search Problems
4. k-Servers with a Smile: Online Algorithms via Projections
   2018/10/17 by Buchbinder, Niv, Gupta, Anupam, Molinaro, Marco +2 · 2 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
5. Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual
   2020/12/03 by Niv Buchbinder, Buchbinder, Niv, Christian Coester +4 · 2 citations
   Computer Science · Engineering · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems #Smart Parking Systems Research
6. Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
   2012/05/07 by Buchbinder, Niv, Joseph, Naor +2 · 1 citation
   #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences
7. Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
   2023/01/20 by Joseph Joseph, Joseph, Naor +4 · 2 citations
   Computer Science · #Complexity and Algorithms in Graphs #Cooperative Communication and Network Coding #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
8. Tight Bounds for Online Weighted Tree Augmentation
   2019/04/26 by Joseph, Naor, Umboh, Seeun William +1 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences