World's Best Scientists 2026 revealed!
Niv Buchbinder

Niv Buchbinder

Overview

Niv Buchbinder is affiliated with Tel Aviv University in Israel and has made contributions primarily in the fields of computer science and engineering. Their research spans multiple subfields including computer networks and communications, computational theory and mathematics, management science and operations research, artificial intelligence, and industrial and manufacturing engineering.

Their scholarly work is notably concentrated on topics such as optimization and search problems, complexity and algorithms in graphs, auction theory and applications, cryptography and data security, advanced graph theory research, facility location and emergency management, as well as optimization and packing problems.

Niv Buchbinder's publication record includes papers in a variety of venues. Frequent publication outlets for their work are:

  • arXiv (Cornell University)
  • Mathematical Programming
  • SIAM Journal on Computing
  • ACM SIGMETRICS Performance Evaluation Review
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Recent papers authored by Niv Buchbinder include:

  • Online submodular maximization: beating 1/2 made simple, 2020, Mathematical Programming
  • Online Virtual Machine Allocation with Lifetime and Load Predictions, 2021, ACM SIGMETRICS Performance Evaluation Review
  • Online k-taxi via Double Coverage and time-reverse primal-dual, 2022, Mathematical Programming
  • Deterministic (½+ε)-Approximation for Submodular Maximization over a Matroid, 2023, SIAM Journal on Computing
  • Metrical Service Systems with Transformations, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

The scientist has collaborated frequently with several researchers, indicating a network of partnerships in their academic work. Frequent co-authors include:

  • Moran Feldman
  • Joseph Naor
  • Christian Coester
  • David Wajc
  • Naor

Best Publications

  • A Tight Linear Time (1/2)-Approximation For Unconstrained Submodular Maximization

    Niv Buchbinder;Moran Feldman;Joseph Seffi Naor;Roy Schwartz

  • Online primal-dual algorithms for maximizing ad-auctions revenue

    Niv Buchbinder;Kamal Jain;Joseph Seffi Naor

  • The Design of Competitive Online Algorithms via a Primal-Dual Approach

    Niv Buchbinder;Joseph (Seffi) Naor

  • A Primal-Dual Randomized Algorithm for Weighted Paging

    Nikhil Bansal;Niv Buchbinder;Joseph (Seffi) Naor

  • Online Primal-Dual Algorithms for Covering and Packing

    Niv Buchbinder;Joseph (Seffi) Naor

  • Submodular maximization with cardinality constraints

    Niv Buchbinder;Moran Feldman;Joseph (Seffi) Naor;Roy Schwartz

  • A Polylogarithmic-Competitive Algorithm for the k-Server Problem

    Nikhil Bansal;Niv Buchbinder;Aleksander Madry;Joseph (Seffi) Naor

  • A general approach to online network optimization problems

    Noga Alon;Baruch Awerbuch;Yossi Azar;Niv Buchbinder

  • Online primal-dual algorithms for covering and packing problems

    Niv Buchbinder;Joseph Naor

  • The Online Set Cover Problem

    Noga Alon;Baruch Awerbuch;Yossi Azar;Niv Buchbinder

  • Online job-migration for reducing the electricity bill in the cloud

    Niv Buchbinder;Navendu Jain;Ishai Menache

  • Online Submodular Maximization with Preemption

    Niv Buchbinder;Moran Feldman;Roy Schwartz

  • Randomized Competitive Algorithms for Generalized Caching

    Nikhil Bansal;Niv Buchbinder;Joseph (Seffi) Naor

  • Deterministic algorithms for submodular maximization problems

    Niv Buchbinder;Moran Feldman

  • Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach

    Niv Buchbinder;Joseph Naor

  • Constrained Submodular Maximization via a Nonsymmetric Technique

    Niv Buchbinder;Moran Feldman

  • Online make-to-order joint replenishment model: primal dual competitive algorithms

    N. Buchbinder;T. Kimbrelt;R. Levi;K. Makarychev

  • Competitive analysis via regularization

    Niv Buchbinder;Shahar Chen;Joseph (Seffi) Naor

  • Constrained Submodular Maximization via a Non-symmetric Technique

    Niv Buchbinder;Moran Feldman

  • Online Job-Migration for Reducing the Electricity Bill

    Navendu Jain;Niv Buchbinder;Ishai Menache

Frequent Co-Authors

Joseph (Seffi) Naor
Joseph (Seffi) Naor Technion – Israel Institute of Technology
Nikhil Bansal
Nikhil Bansal University of Michigan–Ann Arbor
Kamal Jain
Kamal Jain Microsoft (United States)
Ishai Menache
Ishai Menache Microsoft (United States)
Yossi Azar
Yossi Azar Tel Aviv University
Anupam Gupta
Anupam Gupta Carnegie Mellon University
Ariel Orda
Ariel Orda Technion – Israel Institute of Technology
Navendu Jain
Navendu Jain Microsoft (United States)
Erez Petrank
Erez Petrank Technion – Israel Institute of Technology
Baruch Awerbuch
Baruch Awerbuch Johns Hopkins University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Considering a Computer Science degree in the USA can open doors to many related fields and career options, especially through online learning. Today, students can find a variety of reputable programs designed for flexibility and affordability.

If you’re seeking engineering pathways, the cheapest online mechanical engineering degree options make it easier to acquire skills for industries such as manufacturing and robotics without burdensome tuition fees.

Those curious about the theoretical side of STEM ask, can you get a physics degree online? The answer is yes—and these programs can lead to roles in research, teaching, or high-tech sectors.

For data-driven careers, pursuing a data scientist degree online has become increasingly popular, reflecting the demand for expertise in data analytics, AI, and big data.

Finally, students interested in high-growth technology roles may want to explore the top online electrical engineering schools in the USA, which often feature industry-aligned curricula and innovative coursework.

With so many flexible options, related online degrees offer a practical pathway into exciting and lucrative tech fields.

Best Scientists Citing Niv Buchbinder

Trending Scientists