A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. - Yefim Dinitz; Zeev Nutov (STOC, 1995)

on the Integral Dicycle Packings and Covers and the Linear ordering Polytope. - Zeev Nutov; Michal Penn (Discret. Appl. Math., 1995)

Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5. - Yefim Dinitz; Zeev Nutov (CIAC, 1997)

Faster approximation algorithms for weighted triconnectivity augmentation problems. - Zeev Nutov; Michal Penn (Oper. Res. Lett., 1997)

Approximating k-outconnected Subgraph Problems. - Joseph Cheriyan; Tibor Jordán; Zeev Nutov (APPROX, 1998)

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. - Vincenzo Auletta; Yefim Dinitz; Zeev Nutov; Domenico Parente (J. Algorithms, 1999)

A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. - Yefim Dinitz; Zeev Nutov (J. Algorithms, 1999)

On Integrality, Stability and Composition of Dicycle Packings and Covers. - Zeev Nutov; Michal Penn (J. Comb. Optim., 2000)

Approximating multiroot 3-outconnected subgraphs. - Zeev Nutov (Networks, 2000)

A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set. - Guy Even; Jon Feldman; Guy Kortsarz; Zeev Nutov (RANDOM-APPROX, 2001)

On Rooted Node-Connectivity Problems. - Joseph Cheriyan; Tibor Jordán; Zeev Nutov (Algorithmica, 2001)

Approximating Node Connectivity Problems via Set Covers. - Guy Kortsarz; Zeev Nutov (Algorithmica, 2003)

Approximation algorithm for k-node connected subgraphs via critical graphs. - Guy Kortsarz; Zeev Nutov (STOC, 2004)

Approximation Algorithm for Directed Multicuts. - Yana Kortsarts; Guy Kortsarz; Zeev Nutov (WAOA, 2004)

Approximation algorithms for cycle packing problems. - Michael Krivelevich; Zeev Nutov; Raphael Yuster (SODA, 2005)

Greedy approximation algorithms for directed multicuts. - Yana Kortsarts; Guy Kortsarz; Zeev Nutov (Networks, 2005)

Approximating k-node Connected Subgraphs via Critical Graphs. - Guy Kortsarz; Zeev Nutov (SIAM J. Comput., 2005)

Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems. - Zeev Nutov (APPROX-RANDOM, 2006)

Approximating Rooted Connectivity Augmentation Problems. - Zeev Nutov (Algorithmica, 2006)

A (1-1/e)-approximation algorithm for the generalized assignment problem. - Zeev Nutov; Israel Beniaminy; Raphael Yuster (Oper. Res. Lett., 2006)

Approximating Interval Scheduling Problems with Bounded Profits. - Israel Beniaminy; Zeev Nutov; Meir Ovadia (ESA, 2007)

On (t, k)-shredders in k-connected graphs. - Zeev Nutov; Masao Tsugaki (Ars Comb., 2007)

Packing directed cycles efficiently. - Zeev Nutov; Raphael Yuster (Discret. Appl. Math., 2007)

On shredders and vertex connectivity augmentation. - Gilad Liberman; Zeev Nutov (J. Discrete Algorithms, 2007)

Power optimization for connectivity problems. - Mohammad Taghi Hajiaghayi; Guy Kortsarz; Vahab S. Mirrokni; Zeev Nutov (Math. Program., 2007)

Approximation algorithms and hardness results for cycle packing problems. - Michael Krivelevich; Zeev Nutov; Mohammad R. Salavatipour; Jacques Verstraëte; Raphael Yuster (ACM Trans. Algorithms, 2007)

Approximating Minimum-Cost Connectivity Problems. - Guy Kortsarz; Zeev Nutov (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows. - Zeev Nutov (DIALM-POMC, 2008)

On extremal k-outconnected graphs. - Zeev Nutov (Discret. Math., 2008)

Approximating maximum satisfiable subsystems of linear equations of bounded width. - Zeev Nutov; Daniel Reichman 001 (Inf. Process. Lett., 2008)

Tight approximation algorithm for connectivity augmentation problems. - Guy Kortsarz; Zeev Nutov (J. Comput. Syst. Sci., 2008)

A note on two source location problems. - Guy Kortsarz; Zeev Nutov (J. Discrete Algorithms, 2008)

Approximating minimum cost connectivity problems. - Guy Kortsarz; Zeev Nutov (Parameterized complexity and approximation algorithms, 2009)

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions. - Zeev Nutov (FOCS, 2009)

Improved approximating algorithms for Directed Steiner Forest. - Moran Feldman; Guy Kortsarz; Zeev Nutov (SODA, 2009)

An almost O(log k)-approximation for k-connected subgraphs. - Zeev Nutov (SODA, 2009)

Approximating minimum-power edge-covers and 2, 3-connectivity. - Guy Kortsarz; Zeev Nutov (Discret. Appl. Math., 2009)

Listing minimal edge-covers of intersecting families with applications to connectivity problems. - Zeev Nutov (Discret. Appl. Math., 2009)

A note on Rooted Survivable Networks. - Zeev Nutov (Inf. Process. Lett., 2009)

Wireless network design via 3-decompositions. - Zeev Nutov; Ariel Yaroshevitch (Inf. Process. Lett., 2009)

A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. - Guy Even; Jon Feldman; Guy Kortsarz; Zeev Nutov (ACM Trans. Algorithms, 2009)

Approximating connectivity augmentation problems. - Zeev Nutov (ACM Trans. Algorithms, 2009)

Inapproximability of survivable networks. - Yuval Lando; Zeev Nutov (Theor. Comput. Sci., 2009)

Approximating Minimum-Power k-Connectivity. - Zeev Nutov (Ad Hoc Sens. Wirel. Networks, 2010)

Covering a laminar family by leaf to leaf links. - Yael Maduel; Zeev Nutov (Discret. Appl. Math., 2010)

On minimum power connectivity problems. - Yuval Lando; Zeev Nutov (J. Discrete Algorithms, 2010)

Approximating Steiner Networks with Node-Weights. - Zeev Nutov (SIAM J. Comput., 2010)

Approximating Maximum Subgraphs without Short Cycles. - Guy Kortsarz; Michael Langberg; Zeev Nutov (SIAM J. Discret. Math., 2010)

Approximating minimum power covers of intersecting families and directed edge-connectivity problems. - Zeev Nutov (Theor. Comput. Sci., 2010)

A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius. - Nachshon Cohen; Zeev Nutov (APPROX-RANDOM, 2011)

Network-Design with Degree Constraints. - Rohit Khandekar; Guy Kortsarz; Zeev Nutov (APPROX-RANDOM, 2011)

Approximating Minimum-Power Degree and Connectivity Problems. - Guy Kortsarz; Vahab S. Mirrokni; Zeev Nutov; Elena Tsanko (Algorithmica, 2011)

Approximating minimum-power edge-multicovers - Nachshon Cohen; Zeev Nutov (CoRR, 2011)

Combinatorial Algorithms for Capacitated Network Design - MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Zeev Nutov (CoRR, 2011)

A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. - Guy Even; Guy Kortsarz; Zeev Nutov (Inf. Process. Lett., 2011)

Approximating survivable networks with β-metric costs. - Johnny David; Zeev Nutov (J. Discrete Algorithms, 2011)

Approximating some network design problems with node costs. - Guy Kortsarz; Zeev Nutov (Theor. Comput. Sci., 2011)

Approximating directed weighted-degree constrained networks. - Zeev Nutov (Theor. Comput. Sci., 2011)

Novel algorithms for the network lifetime problem in wireless settings. - Michael Elkin; Yuval Lando; Zeev Nutov; Michael Segal 001; Hanan Shpungin (Wirel. Networks, 2011)

Degree-Constrained Node-Connectivity. - Zeev Nutov (LATIN, 2012)

Scheduling of Vehicles in Transportation Networks. - Dariusz R. Kowalski; Zeev Nutov; Michael Segal 001 (Nets4Cars/Nets4Trains, 2012)

Approximating Node-Connectivity Augmentation Problems. - Zeev Nutov (Algorithmica, 2012)

Small ℓ-edge-covers in k-connected graphs - Zeev Nutov (CoRR, 2012)

A unified approach to source location via rooted network augmentation - Zeev Nutov (CoRR, 2012)

A note on labeling schemes for graph connectivity. - Rani Izsak; Zeev Nutov (Inf. Process. Lett., 2012)

Improved approximation algorithms for Directed Steiner Forest. - Moran Feldman; Guy Kortsarz; Zeev Nutov (J. Comput. Syst. Sci., 2012)

Approximating subset k-connectivity problems. - Zeev Nutov (J. Discrete Algorithms, 2012)

Approximating survivable networks with minimum number of steiner points. - Lior Kamma; Zeev Nutov (Networks, 2012)

Prize-collecting steiner network problems. - Mohammad Taghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Zeev Nutov (ACM Trans. Algorithms, 2012)

Approximating minimum-cost connectivity problems via uncrossable bifamilies. - Zeev Nutov (ACM Trans. Algorithms, 2012)

Approximating fault-tolerant group-Steiner problems. - Rohit Khandekar; Guy Kortsarz; Zeev Nutov (Theor. Comput. Sci., 2012)

Improved approximation algorithms for maximum lifetime problems in wireless networks. - Zeev Nutov; Michael Segal 001 (Theor. Comput. Sci., 2012)

Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points - Nachshon Cohen; Zeev Nutov (CoRR, 2013)

Small ℓℓ-edge-covers in kk-connected graphs. - Zeev Nutov (Discret. Appl. Math., 2013)

On some network design problems with degree constraints. - Rohit Khandekar; Guy Kortsarz; Zeev Nutov (J. Comput. Syst. Sci., 2013)

Steiner Forest Orientation Problems. - Marek Cygan; Guy Kortsarz; Zeev Nutov (SIAM J. Discret. Math., 2013)

A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. - Nachshon Cohen; Zeev Nutov (Theor. Comput. Sci., 2013)

Survivable network activation problems. - Zeev Nutov (Theor. Comput. Sci., 2013)

MMM: multi-channel TDMA with MPR capabilities for MANETs. - Shimon Avadis; Anat Lerner; Zeev Nutov (Wirel. Networks, 2013)

Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. - Michael Dinitz; Guy Kortsarz; Zeev Nutov (APPROX-RANDOM, 2014)

Degree Constrained Node-Connectivity Problems. - Zeev Nutov (Algorithmica, 2014)

Approximating minimum-cost edge-covers of crossing biset-families. - Zeev Nutov (Comb., 2014)

A 1.75 LP approximation for the Tree Augmentation Problem. - Guy Kortsarz; Zeev Nutov (CoRR, 2015)

Approximating minimum power edge-multi-covers. - Nachshon Cohen; Zeev Nutov (J. Comb. Optim., 2015)

Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. - Takuro Fukunaga; Zeev Nutov; R. Ravi 001 (SIAM J. Comput., 2015)

Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems. - Zeev Nutov (CSR, 2016)

On Fixed Cost k-Flow Problems. - MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Zeev Nutov (Theory Comput. Syst., 2016)

A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2. - Guy Kortsarz; Zeev Nutov (ACM Trans. Algorithms, 2016)

Improved approximation algorithms for k-connected m-dominating set problems. - Zeev Nutov (CoRR, 2017)

A Note on the Tree Augmentation Problem. - Zeev Nutov (CoRR, 2017)

Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. - Michael Dinitz; Guy Kortsarz; Zeev Nutov (ACM Trans. Algorithms, 2017)

Approximating source location and star survivable network problems. - Guy Kortsarz; Zeev Nutov (Theor. Comput. Sci., 2017)

The k-Connected Subgraph Problem. - Zeev Nutov (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Node-Connectivity Survivable Network Problems. - Zeev Nutov (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Activation Network Design Problems. - Zeev Nutov (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Approximating activation edge-cover and facility location problems. - Zeev Nutov; Eli Shalom (CoRR, 2018)

LP-relaxations for tree augmentation. - Guy Kortsarz; Zeev Nutov (Discret. Appl. Math., 2018)

Improved approximation algorithms for k-connected m-dominating set problems. - Zeev Nutov (Inf. Process. Lett., 2018)

Approximating Steiner trees and forests with minimum number of Steiner points. - Nachshon Cohen; Zeev Nutov (J. Comput. Syst. Sci., 2018)

Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems. - Zeev Nutov (Theory Comput. Syst., 2018)

Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies. - Zeev Nutov (ACM Trans. Algorithms, 2018)

A (4+ε)-approximation for k-connected subgraphs. - Zeev Nutov (CoRR, 2019)

An Õ(log2n)-approximation algorithm for 2-edge-connected dominating set. - Amir Belgi; Zeev Nutov (CoRR, 2019)

Improved approximation algorithms for minimum power covering problems. - Gruia Calinescu; Guy Kortsarz; Zeev Nutov (Theor. Comput. Sci., 2019)

Covering Users by a Connected Swarm Efficiently. - Kiril Danilchenko; Michael Segal 001; Zeev Nutov (ALGOSENSORS, 2020)

Bounded Degree Group Steiner Tree Problems. - Guy Kortsarz; Zeev Nutov (IWOCA, 2020)

A 4 + ε approximation for k-connected subgraphs. - Zeev Nutov (SODA, 2020)

Practical Budgeted Submodular Maximization. - Zeev Nutov; Elad Shoham (CoRR, 2020)

Approximation Algorithms for Connectivity Augmentation Problems. - Zeev Nutov (CSR, 2021)

On the Tree Augmentation Problem. - Zeev Nutov (Algorithmica, 2021)

Data structure for node connectivity queries. - Zeev Nutov (CoRR, 2021)

Data Structures for Node Connectivity Queries. - Zeev Nutov (ESA, 2022)

Approximating k-Connected m-Dominating Sets. - Zeev Nutov (Algorithmica, 2022)

The minimum degree Group Steiner problem. - Guy Kortsarz; Zeev Nutov (Discret. Appl. Math., 2022)

A polylogarithmic approximation algorithm for 2-edge-connected dominating set. - Amir Belgi; Zeev Nutov (Inf. Process. Lett., 2022)

A 4 + ϵ approximation for k-connected subgraphs. - Zeev Nutov (J. Comput. Syst. Sci., 2022)

Approximating activation edge-cover and facility location problems. - Guy Kortsarz; Zeev Nutov; Eli Shalom (Theor. Comput. Sci., 2022)

An $O( sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. - Zeev Nutov (CiE, 2023)

Improved Approximations for Relative Survivable Network Design. - Michael Dinitz; Ama Koranteng; Guy Kortsarz; Zeev Nutov (WAOA, 2023)

Improved approximation algorithms for some capacitated k edge connectivity problems. - Zeev Nutov (CoRR, 2023)

A 1.5-pproximation algorithms for activating 2 disjoint st-paths. - Zeev Nutov; Dawod Kahba (CoRR, 2023)

A logarithmic approximation algorithm for the activation edge multicover problem. - Zeev Nutov (CoRR, 2023)

Doing their best: How to provide service by limited number of drones? - Kiril Danilchenko; Zeev Nutov; Michael Segal 001 (Wirel. Networks, 2023)

Practical Budgeted Submodular Maximization. - Moran Feldman; Zeev Nutov; Elad Shoham (Algorithmica, 2023)

Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments. - Kiril Danilchenko; Zeev Nutov; Michael Segal 001 (IEEE/ACM Trans. Netw., 2023)

A 1.5-Approximation Algorithm for Activating Two Disjoint st-Paths. - Zeev Nutov; Dawod Kahba (ALGOWIN, 2024)

Parameterized Algorithms for Node Connectivity Augmentation Problems. - Zeev Nutov (ESA, 2024)

Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families. - Zeev Nutov (IPCO, 2024)

Improved Approximation Algorithms for Covering Pliable Set Families and Flexible Graph Connectivity. - Zeev Nutov (WAOA, 2024)

Improved approximation ratio for covering pliable set families. - Zeev Nutov (CoRR, 2024)

2-node-connectivity network design. - Zeev Nutov (Theor. Comput. Sci., 2024)

On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs. - Zeev Nutov (Oper. Res. Forum, 2024)

Approximation algorithms for node and element connectivity augmentation problems. - Zeev Nutov (Theory Comput. Syst., 2024)

Tight Analysis of the Primal-Dual Method for Edge-Covering Pliable Set Families. - Zeev Nutov (MFCS, 2025)

A 22k-approximation algorithm for minimum power k edge disjoint st-paths. - Zeev Nutov (Inf. Process. Lett., 2025)

Bicriteria approximation for k-edge-connectivity. - Zeev Nutov; Reut Cohen (CoRR, 2025)

Improved bicriteria approximation for k-edge-connectivity. - Zeev Nutov (CoRR, 2025)