| 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 | 517 | 2015 |
| The design of competitive online algorithms via a primal–dual approach N Buchbinder, JS Naor Foundations and Trends® in Theoretical Computer Science 3 (2–3), 93-263, 2009 | 477 | 2009 |
| Online primal-dual algorithms for maximizing ad-auctions revenue N Buchbinder, K Jain, J Naor European Symposium on Algorithms, 253-264, 2007 | 414 | 2007 |
| 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 | 383 | 2014 |
| Online primal-dual algorithms for covering and packing N Buchbinder, J Naor Mathematics of Operations Research 34 (2), 270-286, 2009 | 363* | 2009 |
| The online set cover problem N Alon, B Awerbuch, Y Azar Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 351 | 2003 |
| 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 | 182 | 2015 |
| A primal-dual randomized algorithm for weighted paging N Bansal, N Buchbinder, J Naor Journal of the ACM (JACM) 59 (4), 1-24, 2012 | 181 | 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 | 180 | 2006 |
| Deterministic algorithms for submodular maximization problems N Buchbinder, M Feldman ACM Transactions on Algorithms (TALG) 14 (3), 1-20, 2018 | 131 | 2018 |
| Online job-migration for reducing the electricity bill in the cloud N Buchbinder, N Jain, I Menache NETWORKING 2011: 10th International IFIP TC 6 Networking Conference …, 2011 | 128 | 2011 |
| Online submodular maximization with preemption N Buchbinder, M Feldman, R Schwartz ACM Transactions on Algorithms (TALG) 15 (3), 1-31, 2019 | 114 | 2019 |
| Constrained submodular maximization via a nonsymmetric technique N Buchbinder, M Feldman Mathematics of Operations Research 44 (3), 988-1005, 2019 | 98 | 2019 |
| Secretary problems via linear programming N Buchbinder, K Jain, M Singh Mathematics of Operations Research 39 (1), 190-206, 2014 | 95* | 2014 |
| 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 | 95 | 2006 |
| 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 | 89* | 2008 |
| Competitive analysis via regularization N Buchbinder, S Chen, J Naor Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 77 | 2014 |
| 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 | 74 | 2016 |
| Comparing apples and oranges: Query trade-off in submodular maximization N Buchbinder, M Feldman, R Schwartz Mathematics of Operations Research 42 (2), 308-329, 2017 | 65 | 2017 |
| 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 | 63* | 2013 |
