Joseph Naor

12.7k total citations · 3 hit papers
197 papers, 6.7k citations indexed

About

Joseph Naor is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Joseph Naor has authored 197 papers receiving a total of 6.7k indexed citations (citations by other indexed papers that have themselves been cited), including 136 papers in Computer Networks and Communications, 93 papers in Computational Theory and Mathematics and 47 papers in Electrical and Electronic Engineering. Recurrent topics in Joseph Naor's work include Optimization and Search Problems (92 papers), Complexity and Algorithms in Graphs (78 papers) and Advanced Graph Theory Research (60 papers). Joseph Naor is often cited by papers focused on Optimization and Search Problems (92 papers), Complexity and Algorithms in Graphs (78 papers) and Advanced Graph Theory Research (60 papers). Joseph Naor collaborates with scholars based in Israel, United States and Germany. Joseph Naor's co-authors include Niv Buchbinder, Baruch Schieber, Moni Naor, Samir Khuller, Anna Moss, Amotz Bar-Noy, Liane Lewin-Eytan, Bezalel Peleg, Danny Raz and David Avnir and has published in prestigious journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, IEEE Transactions on Information Theory and Communications of the ACM.

In The Last Decade

Joseph Naor

193 papers receiving 6.3k citations

Hit Papers

The budgeted maximum coverage problem 1984 2026 1998 2012 1999 1984 2015 200 400 600
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. The budgeted maximum coverage problem
    1999 634 citations Anna Moss, Joseph Naor et al. profile →
  2. Multiple Resolution Texture Analysis and Classification
    1984 576 citations Joseph Naor et al. profile →
  3. Near optimal placement of virtual network functions
    2015 395 citations Joseph Naor et al. profile →

Peers

Joseph Naor
Andrew V. Goldberg United States
Baruch Awerbuch United States
Chandra Chekuri United States
Sanjeev Khanna United States
David P. Williamson United States
Samir Khuller United States
Dorit S. Hochbaum United States
Clifford Stein United States
Ding‐Zhu Du United States
Allan Borodin Canada
Andrew V. Goldberg United States
Joseph Naor
Citations per year, relative to Joseph Naor Joseph Naor (= 1×) peers Andrew V. Goldberg

Countries citing papers authored by Joseph Naor

Since Specialization
Citations

This map shows the geographic impact of Joseph Naor'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 Joseph Naor with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joseph Naor more than expected).

Fields of papers citing papers by Joseph Naor

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joseph Naor. 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 Joseph Naor. The network helps show where Joseph Naor may publish in the future.

Co-authorship network of co-authors of Joseph Naor

This figure shows the co-authorship network connecting the top 25 collaborators of Joseph Naor. A scholar is included among the top collaborators of Joseph Naor 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 Joseph Naor. Joseph Naor is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Buchbinder, Niv, et al.. (2017). O(depth)-competitive algorithm for online multi-level aggregation. arXiv (Cornell University). 1235–1244. 4 indexed citations
2.
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
3.
Krauthgamer, Robert, Joseph Naor, Roy Schwartz, & Kunal Talwar. (2014). Non-uniform graph partitioning. Symposium on Discrete Algorithms. 1229–1243. 3 indexed citations
4.
Naor, Joseph, Jonathan Yaniv, Ishai Menache, & Brendan Lucier. (2013). Efficient Online Scheduling for Deadline-Sensitive Batch Computing. 1 indexed citations
5.
Feldman, Moran, Joseph Naor, & Roy Schwartz. (2011). Improved competitive ratios for submodular secretary problems. 218–229. 13 indexed citations
6.
Feldman, Moran, Joseph Naor, & Roy Schwartz. (2011). Nonmonotone submodular maximization via a structural continuous greedy algorithm (Extended Abstract). 4 indexed citations
7.
Krauthgamer, Robert, Joseph Naor, & Roy Schwartz. (2009). Partitioning Graphs into Balanced Components. 942–949. 33 indexed citations
8.
Naor, Joseph, et al.. (2007). Equilibria in online games. Symposium on Discrete Algorithms. 149–158. 1 indexed citations
9.
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
10.
Naor, Joseph & Roy Schwartz. (2004). The directed circular arrangement problem. Symposium on Discrete Algorithms. 86–95. 1 indexed citations
11.
Chuzhoy, Julia, Sudipto Guha, Sanjeev Khanna, & Joseph Naor. (2003). Asymmetric k-center is log * n-hard to Approximate. Electronic colloquium on computational complexity. 3 indexed citations
12.
Bar-Noy, Amotz, et al.. (2002). Competitive on-line switching policies. Symposium on Discrete Algorithms. 525–534. 7 indexed citations
13.
Chekuri, Chandra, Sanjeev Khanna, & Joseph Naor. (2001). A deterministic algorithm for the cost-distance problem. Symposium on Discrete Algorithms. 232–233. 27 indexed citations
14.
Chekuri, Chandra, Sanjeev Khanna, Joseph Naor, & Leonid Zosin. (2001). Approximation algorithms for the metric labeling problem via a new linear programming formulation. Symposium on Discrete Algorithms. 109–118. 68 indexed citations
15.
Khanna, Sanjeev, Joseph Naor, & F. Bruce Shepherd. (2000). Directed network design with orientation constraints. Symposium on Discrete Algorithms. 663–671. 1 indexed citations
16.
Guha, Sudipto, Anna Moss, Joseph Naor, & Baruch Schieber. (1999). Efficient recovery from power outage. 574–582. 30 indexed citations
17.
Bhatia, Randeep, et al.. (1998). Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract).. Symposium on Discrete Algorithms. 11–20. 4 indexed citations
18.
Even, Guy, Joseph Naor, Satish Rao, & Baruch Schieber. (1995). Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).. 62–71. 5 indexed citations
19.
Bar-Yehuda, Reuven, Dan Geiger, Joseph Naor, & Ron M. Roth. (1994). Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference. Symposium on Discrete Algorithms. 344–354. 29 indexed citations
20.
Luby, Michael, Joseph Naor, & Ariel Orda. (1994). Tight bounds for dynamic storage allocation. Symposium on Discrete Algorithms. 724–732. 1 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

Breakdown of academic impact, for papers by Andrew V. Goldberg Breakdown of academic impact, for papers by Baruch Awerbuch Breakdown of academic impact, for papers by Chandra Chekuri Breakdown of academic impact, for papers by Sanjeev Khanna Breakdown of academic impact, for papers by David P. Williamson Breakdown of academic impact, for papers by Samir Khuller Breakdown of academic impact, for papers by Dorit S. Hochbaum Breakdown of academic impact, for papers by Clifford Stein Breakdown of academic impact, for papers by Ding‐Zhu Du Breakdown of academic impact, for papers by Allan Borodin
Rankless by CCL
2026