Joseph Naor
- Computer Networks and Communications top 0.2%
- Computational Theory and Mathematics top 0.1%
- Artificial Intelligence top 1%
- Electrical and Electronic Engineering top 5%
- Management Science and Operations Research top 0.5%
- Co-authors
- Niv BuchbinderBaruch SchieberMoni NaorSamir KhullerAnna MossAmotz Bar-NoyLiane Lewin-EytanBezalel Peleg
- Topics
- Optimization and Search Problems (92 papers)Complexity and Algorithms in Graphs (78 papers)Advanced Graph Theory Research (60 papers)
- Cited by
- Computer Networks and CommunicationsComputational Theory and MathematicsComputer Graphics and Computer-Aided Design
- Journals
- IEEE Transactions on Pattern Analysis and Machine IntelligenceIEEE Transactions on Information TheoryCommunications of the ACM
- Partner nations
- IsraelUnited StatesGermany
In The Last Decade
Joseph Naor
193 papers receiving 6.3k citations
Hit Papers
Peers
Comparison fields: 5 of 145
- Computer Networks and Communications 3.7k
- Computational Theory and Mathematics 2.3k
- Artificial Intelligence 1.4k
- Electrical and Electronic Engineering 1.1k
- Management Science and Operations Research 758
Countries citing papers authored by Joseph Naor
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 4 | |
| 2 | 17 | |
| 3 | 3 | |
| 4 | Efficient Online Scheduling for Deadline-Sensitive Batch Computing | 1 |
| 5 | Improved competitive ratios for submodular secretary problems | 13 |
| 6 | Nonmonotone submodular maximization via a structural continuous greedy algorithm (Extended Abstract) | 4 |
| 7 | 33 | |
| 8 | 1 | |
| 9 | 3 | |
| 10 | 1 | |
| 11 | Asymmetric k-center is log * n-hard to Approximate | 3 |
| 12 | 7 | |
| 13 | 27 | |
| 14 | 68 | |
| 15 | 1 | |
| 16 | Efficient recovery from power outage | 30 |
| 17 | Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). | 4 |
| 18 | Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). | 5 |
| 19 | 29 | |
| 20 | 1 |
About Joseph Naor
Joseph Naor is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 197 papers that have together received 6.7k indexed citations. Recurring topics across this work include Optimization and Search Problems (92 papers), Complexity and Algorithms in Graphs (78 papers) and Advanced Graph Theory Research (60 papers). The work is most often cited by research in Computer Networks and Communications (3.7k citations), Computational Theory and Mathematics (2.3k citations) and Computer Graphics and Computer-Aided Design (356 citations). Joseph Naor has collaborated with scholars based in Israel, United States and Germany. Frequent 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. Their work appears in journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, IEEE Transactions on Information Theory and Communications of the ACM.
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.