| A tight linear time (1/2)-approximation for unconstrained submodular maximization N Buchbinder, M Feldman, J Seffi, R Schwartz SIAM Journal on Computing 44 (5), 1384-1402, 2015 | 361 | 2015 |
| Online primal-dual algorithms for maximizing ad-auctions revenue N Buchbinder, K Jain, JS Naor European Symposium on Algorithms, 253-264, 2007 | 309 | 2007 |
| The design of competitive online algorithms via a primal-dual approach N Buchbinder, J Naor Now Publishers Inc, 2009 | 308 | 2009 |
| Online primal-dual algorithms for covering and packing N Buchbinder, J Naor Mathematics of Operations Research 34 (2), 270-286, 2009 | 265* | 2009 |
| Submodular maximization with cardinality constraints N Buchbinder, M Feldman, J Naor, R Schwartz Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 216 | 2014 |
| A primal-dual randomized algorithm for weighted paging N Bansal, N Buchbinder, J Naor Journal of the ACM (JACM) 59 (4), 1-24, 2012 | 140 | 2012 |
| A general approach to online network optimization problems N Alon, B Awerbuch, Y Azar, N Buchbinder, J Naor ACM Transactions on Algorithms (TALG) 2 (4), 640-660, 2006 | 138 | 2006 |
| Online job-migration for reducing the electricity bill in the cloud N Buchbinder, N Jain, I Menache International Conference on Research in Networking, 172-185, 2011 | 119 | 2011 |
| A Polylogarithmic-Competitive Algorithm for the k-Server Problem N Bansal, N Buchbinder, A Madry, J Naor Journal of the ACM (JACM) 62 (5), 1-49, 2015 | 117 | 2015 |
| The online set cover problem N Alon, B Awerbuch, Y Azar, N Buchbinder, J Naor SIAM Journal on Computing 39 (2), 361-370, 2009 | 106 | 2009 |
| Deterministic algorithms for submodular maximization problems N Buchbinder, M Feldman ACM Transactions on Algorithms (TALG) 14 (3), 1-20, 2018 | 81 | 2018 |
| Randomized competitive algorithms for generalized caching N Bansal, N Buchbinder, J Naor Proceedings of the fortieth annual ACM symposium on Theory of computing, 235-244, 2008 | 73* | 2008 |
| Improved bounds for online routing and packing via a primal-dual approach N Buchbinder, J Naor 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006 | 73 | 2006 |
| Online submodular maximization with preemption N Buchbinder, M Feldman, R Schwartz Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 58 | 2014 |
| Secretary problems via linear programming N Buchbinder, K Jain, M Singh International Conference on Integer Programming and Combinatorial …, 2010 | 54* | 2010 |
| Unified algorithms for online learning and competitive analysis N Buchbinder, S Chen, JS Naor, O Shamir Conference on Learning Theory, 5.1-5.18, 2012 | 45 | 2012 |
| Towards the Randomized k-Server Conjecture: A Primal-Dual Approach: N Bansal, N Buchbinder, J Naor Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010 | 44 | 2010 |
| Constrained submodular maximization via a nonsymmetric technique N Buchbinder, M Feldman Mathematics of Operations Research 44 (3), 988-1005, 2019 | 43 | 2019 |
| Simplex partitioning via exponential clocks and the multiway cut problem N Buchbinder, J Naor, R Schwartz Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 42 | 2013 |
| Online algorithms for covering and packing problems with convex objectives Y Azar, N Buchbinder, THH Chan, S Chen, IR Cohen, A Gupta, Z Huang, ... 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 41 | 2016 |
