| 2026 | ICALP | Competitive Bundle Trading. | Yossi Azar, Niv Buchbinder, Roie Levin, Or Vardi |
| 2025 | ICML | Competitively Consistent Clustering. | Niv Buchbinder, Roie Levin, Yue Yang |
| 2025 | STOC | Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. | Niv Buchbinder, Moran Feldman |
| 2025 | SPAA | Brief Announcement: Load Balancing with Duration Predictions. | Yossi Azar, Niv Buchbinder, Tomer Epshtein |
| 2024 | FOCS | Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. | Niv Buchbinder, Moran Feldman |
| 2024 | SODA | Maintaining Matroid Intersections Online. | Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar |
| 2024 | STOC | Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. | Niv Buchbinder, Moran Feldman |
| 2023 | FOCS | Chasing Positive Bodies. | Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak |
| 2023 | SODA | Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). | Niv Buchbinder, Joseph (Seffi) Naor, David Wajc |
| 2021 | IPCO | Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. | Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor |
| 2021 | SIGMETRICS | Online Virtual Machine Allocation with Lifetime and Load Predictions. | Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph (Seffi) Naor |
| 2019 | IPCO | Online Submodular Maximization: Beating 1/2 Made Simple. | Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg |
| 2019 | SODA | Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. | Niv Buchbinder, Moran Feldman, Mohit Garg |
| 2019 | SODA | k-Servers with a Smile: Online Algorithms via Projections. | Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor |
| 2017 | ESA | Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. | Niv Buchbinder, Danny Segev, Yevgeny Tkach |
| 2017 | SODA | Untitled record | Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon |
| 2017 | SODA | Fair Coin Flipping: Tighter Analysis and the Many-Party Case. | Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia |
| 2017 | SODA | Simplex Transformations and the Multiway Cut Problem. | Niv Buchbinder, Roy Schwartz, Baruch Weizman |
| 2016 | FOCS | Online Algorithms for Covering and Packing Problems with Convex Objectives. | Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi |
| 2016 | SODA | Deterministic Algorithms for Submodular Maximization Problems. | Niv Buchbinder, Moran Feldman |
| 2015 | SODA | Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. | Niv Buchbinder, Moran Feldman, Roy Schwartz |
| 2015 | SODA | Online Submodular Maximization with Preemption. | Niv Buchbinder, Moran Feldman, Roy Schwartz |
| 2014 | ESA | Competitive Algorithms for Restricted Caching and Matroid Caching. | Niv Buchbinder, Shahar Chen, Joseph Naor |
| 2014 | SODA | Competitive Analysis via Regularization. | Niv Buchbinder, Shahar Chen, Joseph Naor |
| 2014 | SODA | Submodular Maximization with Cardinality Constraints. | Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz |
| 2013 | STOC | Simplex partitioning via exponential clocks and the multiway cut problem. | Niv Buchbinder, Joseph Naor, Roy Schwartz |
| 2012 | FOCS | A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. | Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz |
| 2012 | ICALP | Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. | Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh |
| 2011 | FOCS | A Polylogarithmic-Competitive Algorithm for the k-Server Problem. | Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor |
| 2011 | Networking | Online Job-Migration for Reducing the Electricity Bill in the Cloud. | Niv Buchbinder, Navendu Jain, Ishai Menache |
| 2011 | WADS | Frequency Capping in Online Advertising. | Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor |
| 2010 | ALT | A Regularization Approach to Metrical Task Systems. | Jacob D. Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton |
| 2010 | ESA | How to Allocate Goods in an Online Market? | Yossi Azar, Niv Buchbinder, Kamal Jain |
| 2010 | ICALP | Metrical Task Systems and the | Nikhil Bansal, Niv Buchbinder, Joseph Naor |
| 2010 | INFOCOM | Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. | Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda |
| 2010 | IPCO | Secretary Problems via Linear Programming. | Niv Buchbinder, Kamal Jain, Mohit Singh |
| 2010 | SODA | Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. | Nikhil Bansal, Niv Buchbinder, Joseph Naor |
| 2009 | INFOCOM | Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. | Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda |
| 2008 | SODA | Online make-to-order joint replenishment model: primal dual competitive algorithms. | Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko |
| 2008 | STOC | Randomized competitive algorithms for generalized caching. | Nikhil Bansal, Niv Buchbinder, Joseph Naor |
| 2008 | SAGT | Non-cooperative Cost Sharing Games Via Subsidies. | Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda |
| 2007 | ESA | An | Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor |
| 2007 | ESA | Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. | Niv Buchbinder, Kamal Jain, Joseph Naor |
| 2007 | FOCS | A Primal-Dual Randomized Algorithm for Weighted Paging. | Nikhil Bansal, Niv Buchbinder, Joseph Naor |
| 2006 | FOCS | Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. | Niv Buchbinder, Joseph Naor |
| 2006 | SPAA | Fair online load balancing. | Niv Buchbinder, Joseph Naor |
| 2005 | ESA | Online Primal-Dual Algorithms for Covering and Packing Problems. | Niv Buchbinder, Joseph Naor |
| 2004 | SODA | A general approach to online network optimization problems. | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
| 2003 | CRYPTO | Lower and Upper Bounds on Obtaining History Independence. | Niv Buchbinder, Erez Petrank |
| 2003 | STOC | The online set cover problem. | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |