Zeev Nutov

2.0k total citations
93 papers, 801 citations indexed

About

Zeev Nutov is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Zeev Nutov has authored 93 papers receiving a total of 801 indexed citations (citations by other indexed papers that have themselves been cited), including 84 papers in Computational Theory and Mathematics, 58 papers in Computer Networks and Communications and 12 papers in Electrical and Electronic Engineering. Recurrent topics in Zeev Nutov's work include Complexity and Algorithms in Graphs (74 papers), Advanced Graph Theory Research (63 papers) and Optimization and Search Problems (34 papers). Zeev Nutov is often cited by papers focused on Complexity and Algorithms in Graphs (74 papers), Advanced Graph Theory Research (63 papers) and Optimization and Search Problems (34 papers). Zeev Nutov collaborates with scholars based in Israel, United States and Germany. Zeev Nutov's co-authors include Guy Kortsarz, Yefim Dinitz, Raphael Yuster, Michal Penn, Nachshon Cohen, Michael Krivelevich, Rohit Khandekar, Vincenzo Auletta, Guy Even and Mimmo Parente and has published in prestigious journals such as IEEE/ACM Transactions on Networking, Mathematical Programming and SIAM Journal on Computing.

In The Last Decade

Zeev Nutov

83 papers receiving 726 citations

Peers

Zeev Nutov
Lap Chi Lau Hong Kong
Uri N. Peled United States
David Lichtenstein United States
S. Poljak Czechia
A. V. Pyatkin Russia
Ali Ridha Mahjoub France
Ralph Tindell United States
Renu Laskar United States
David Hartvigsen United States
Magnus Wahlström United Kingdom
Lap Chi Lau Hong Kong
Zeev Nutov
Citations per year, relative to Zeev Nutov Zeev Nutov (= 1×) peers Lap Chi Lau

Countries citing papers authored by Zeev Nutov

Since Specialization
Citations

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

Fields of papers citing papers by Zeev Nutov

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Zeev Nutov

This figure shows the co-authorship network connecting the top 25 collaborators of Zeev Nutov. A scholar is included among the top collaborators of Zeev Nutov 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 Zeev Nutov. Zeev Nutov 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.
Cohen, Nachshon & Zeev Nutov. (2018). Approximating Steiner trees and forests with minimum number of Steiner points. Journal of Computer and System Sciences. 98. 53–64. 1 indexed citations
2.
Cohen, Nachshon & Zeev Nutov. (2013). A(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. Theoretical Computer Science. 489-490. 67–74. 21 indexed citations
3.
Nutov, Zeev. (2013). Smallℓ-edge-covers ink-connected graphs. Discrete Applied Mathematics. 161(13-14). 2101–2106. 1 indexed citations
4.
Nutov, Zeev. (2012). Survivable network activation problems. Theoretical Computer Science. 514. 105–115. 4 indexed citations
5.
Nutov, Zeev. (2012). Approximating subset k-connectivity problems. Journal of Discrete Algorithms. 17. 51–59. 9 indexed citations
6.
Nutov, Zeev & Michael Segal. (2011). Improved approximation algorithms for maximum lifetime problems in wireless networks. Theoretical Computer Science. 453. 88–97. 4 indexed citations
7.
Khandekar, Rohit, Guy Kortsarz, & Zeev Nutov. (2011). Approximating fault-tolerant group-Steiner problems. Theoretical Computer Science. 416. 55–64. 10 indexed citations
8.
Nutov, Zeev. (2010). Approximating Minimum-Power k-Connectivity.. Ad Hoc & Sensor Wireless Networks. 9. 129–137. 11 indexed citations
9.
Nutov, Zeev. (2010). Approximating directed weighted-degree constrained networks. Theoretical Computer Science. 412(8-10). 901–912. 2 indexed citations
10.
Nutov, Zeev, et al.. (2010). Approximating survivable networks with β-metric costs. Journal of Discrete Algorithms. 9(2). 170–175. 1 indexed citations
11.
Nutov, Zeev. (2009). An almost O(log k)-approximation for k-connected subgraphs. Symposium on Discrete Algorithms. 912–921. 25 indexed citations
12.
Nutov, Zeev, et al.. (2009). Inapproximability of survivable networks. Theoretical Computer Science. 410(21-23). 2122–2125. 20 indexed citations
13.
Kortsarz, Guy & Zeev Nutov. (2009). Approximating minimum-power edge-covers and2,3-connectivity. Discrete Applied Mathematics. 157(8). 1840–1847. 3 indexed citations
14.
Nutov, Zeev. (2008). Listing minimal edge-covers of intersecting families with applications to connectivity problems. Discrete Applied Mathematics. 157(1). 112–117. 1 indexed citations
15.
Kortsarz, Guy & Zeev Nutov. (2007). Tight approximation algorithm for connectivity augmentation problems. Journal of Computer and System Sciences. 74(5). 662–670. 11 indexed citations
16.
Kortsarz, Guy & Zeev Nutov. (2007). A note on two source location problems. Journal of Discrete Algorithms. 6(3). 520–525. 4 indexed citations
17.
Nutov, Zeev & Raphael Yuster. (2006). Packing directed cycles efficiently. Discrete Applied Mathematics. 155(2). 82–91. 6 indexed citations
18.
Krivelevich, Michael, Zeev Nutov, & Raphael Yuster. (2005). Approximation algorithms for cycle packing problems. Symposium on Discrete Algorithms. 556–561. 8 indexed citations
19.
Nutov, Zeev. (2005). Approximating connectivity augmentation problems. Symposium on Discrete Algorithms. 176–185. 14 indexed citations
20.
Nutov, Zeev, et al.. (1996). Doubly stochastic matrices and dicycle covers and packings in eulerian digraphs. Linear Algebra and its Applications. 246. 361–371. 2 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 Lap Chi Lau Breakdown of academic impact, for papers by Uri N. Peled Breakdown of academic impact, for papers by David Lichtenstein Breakdown of academic impact, for papers by S. Poljak Breakdown of academic impact, for papers by A. V. Pyatkin Breakdown of academic impact, for papers by Ali Ridha Mahjoub Breakdown of academic impact, for papers by Ralph Tindell Breakdown of academic impact, for papers by Renu Laskar Breakdown of academic impact, for papers by David Hartvigsen Breakdown of academic impact, for papers by Magnus Wahlström
Rankless by CCL
2026