Niv Buchbinder

3.6k total citations
62 papers, 1.4k citations indexed

About

Niv Buchbinder is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Management Science and Operations Research. According to data from OpenAlex, Niv Buchbinder has authored 62 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computer Networks and Communications, 30 papers in Computational Theory and Mathematics and 20 papers in Management Science and Operations Research. Recurrent topics in Niv Buchbinder's work include Optimization and Search Problems (45 papers), Complexity and Algorithms in Graphs (29 papers) and Auction Theory and Applications (13 papers). Niv Buchbinder is often cited by papers focused on Optimization and Search Problems (45 papers), Complexity and Algorithms in Graphs (29 papers) and Auction Theory and Applications (13 papers). Niv Buchbinder collaborates with scholars based in Israel, United States and United Kingdom. Niv Buchbinder's co-authors include Joseph Naor, Moran Feldman, Roy Schwartz, Nikhil Bansal, Yossi Azar, Baruch Awerbuch, Noga Alon, Ishai Menache, Ariel Orda and Liane Lewin-Eytan and has published in prestigious journals such as Operations Research, Journal of the ACM and IEEE/ACM Transactions on Networking.

In The Last Decade

Niv Buchbinder

60 papers receiving 1.3k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Niv Buchbinder Israel	18	956	457	391	298	164	62	1.4k
Mohammad Taghi Hajiaghayi United States	21	895 0.9×	469 1.0×	339 0.9×	148 0.5×	303 1.8×	75	1.4k
MohammadTaghi Hajiaghayi United States	25	1.1k 1.1×	1.0k 2.2×	360 0.9×	292 1.0×	221 1.3×	124	2.1k
Yair Bartal Israel	24	1.2k 1.3×	728 1.6×	324 0.8×	298 1.0×	121 0.7×	74	1.9k
Viswanath Nagarajan United States	16	396 0.4×	331 0.7×	161 0.4×	138 0.5×	82 0.5×	76	862
Magnús M. Halldórsson Iceland	25	1.3k 1.3×	1.0k 2.2×	235 0.6×	327 1.1×	521 3.2×	138	2.3k
Asaf Levin Israel	18	596 0.6×	358 0.8×	199 0.5×	155 0.5×	146 0.9×	130	1.3k
Guy Kortsarz United States	25	1.1k 1.1×	1.1k 2.5×	120 0.3×	218 0.7×	258 1.6×	111	1.9k
Boaz Patt-Shamir Israel	24	1.4k 1.5×	557 1.2×	128 0.3×	295 1.0×	232 1.4×	124	1.7k
Benjamin Moseley United States	15	611 0.6×	226 0.5×	107 0.3×	594 2.0×	79 0.5×	89	1.3k
Harald Räcke United States	16	904 0.9×	525 1.1×	101 0.3×	214 0.7×	279 1.7×	50	1.3k

Countries citing papers authored by Niv Buchbinder

Since Specialization

Citations

This map shows the geographic impact of Niv Buchbinder's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Niv Buchbinder with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Niv Buchbinder more than expected).

Fields of papers citing papers by Niv Buchbinder

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Niv Buchbinder. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Niv Buchbinder. The network helps show where Niv Buchbinder may publish in the future.

Co-authorship network of co-authors of Niv Buchbinder

This figure shows the co-authorship network connecting the top 25 collaborators of Niv Buchbinder. A scholar is included among the top collaborators of Niv Buchbinder based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Niv Buchbinder. Niv Buchbinder is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Buchbinder, Niv & Moran Feldman. (2024). Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. 1820–1831. 5 indexed citations

Buchbinder, Niv & Moran Feldman. (2024). Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. 700–712. 1 indexed citations

Buchbinder, Niv & Moran Feldman. (2019). Constrained Submodular Maximization via a Nonsymmetric Technique. Mathematics of Operations Research. 44(3). 988–1005. 28 indexed citations

Buchbinder, Niv, et al.. (2017). O(depth)-competitive algorithm for online multi-level aggregation. arXiv (Cornell University). 1235–1244. 4 indexed citations

Buchbinder, Niv, et al.. (2017). Simplex transformations and the multiway cut problem. Symposium on Discrete Algorithms. 2400–2410. 4 indexed citations

Buchbinder, Niv, et al.. (2017). Fair coin flipping: tighter analysis and the many-party case. arXiv (Cornell University). 2580–2600. 1 indexed citations

Buchbinder, Niv, Moran Feldman, & Roy Schwartz. (2015). Comparing apples and oranges: query tradeoff in submodular maximization. Symposium on Discrete Algorithms. 1149–1168. 5 indexed citations

Bansal, Nikhil, Niv Buchbinder, Aleksander Mądry, & Joseph Naor. (2015). A Polylogarithmic-Competitive Algorithm for the k -Server Problem. Journal of the ACM. 62(5). 1–49. 17 indexed citations

Azar, Yossi, Niv Buchbinder, & Kamal Jain. (2014). How to Allocate Goods in an Online Market?. Algorithmica. 74(2). 589–601. 3 indexed citations

10.

Buchbinder, Niv, Moran Feldman, Joseph Naor, & Roy Schwartz. (2013). Submodular Maximization with Cardinality Constraints. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1433–1452. 64 indexed citations

11.

Buchbinder, Niv, et al.. (2013). Competitive Analysis via Regularization. 436–444. 41 indexed citations

12.

Buchbinder, Niv, Joseph Naor, & Roy Schwartz. (2013). Simplex partitioning via exponential clocks and the multiway cut problem. 535–544. 12 indexed citations

13.

Buchbinder, Niv, et al.. (2012). Unified Algorithms for Online Learning and Competitive Analysis. Conference on Learning Theory. 7 indexed citations

14.

Jain, Navendu, Niv Buchbinder, & Ishai Menache. (2011). Online Job-Migration for Reducing the Electricity Bill. 2 indexed citations

15.

Buchbinder, Niv, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, & Ariel Orda. (2010). Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. 1–9. 13 indexed citations

16.

Alon, Noga, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, & Joseph Naor. (2009). The Online Set Cover Problem. SIAM Journal on Computing. 39(2). 361–370. 54 indexed citations

17.

Buchbinder, Niv & Joseph Naor. (2009). The Design of Competitive Online Algorithms via a Primal—Dual Approach. 3(2-3). 93–263. 153 indexed citations

18.

Buchbinder, Niv, Liane Lewin-Eytan, Joseph Naor, & Ariel Orda. (2009). Non-Cooperative Cost Sharing Games via Subsidies. Theory of Computing Systems. 47(1). 15–37. 11 indexed citations

19.

Buchbinder, Niv & Erez Petrank. (2006). Lower and upper bounds on obtaining history independence. Information and Computation. 204(2). 291–337. 5 indexed citations

20.

Alon, Noga, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, & Joseph Naor. (2004). A general approach to online network optimization problems. Symposium on Discrete Algorithms. 577–586. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact