Zeev Nutov - RankMe

192 papers A* 9A 8B 20C 5Misc 4Journal 119Unranked 23

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On CoRR Zeev Nutov
2025	J	`jnl`	A 22k-approximation algorithm for minimum power k edge disjoint st-paths. Inf. Process. Lett. Zeev Nutov
2025	—	`conf`	A Logarithmic Approximation Algorithm for the Activation Edge-Multicover Problem. ALGOWIN Zeev Nutov, Avner Huri, Guy Kortsarz
2025	J	`jnl`	A tight example for approximation ratio 5 for covering small cuts by the primal-dual method. CoRR Zeev Nutov
2025	J	`jnl`	Approximation and parameterized algorithms for covering disjointness-compliable set families. CoRR Zeev Nutov, Anael Vaknin
2025	A	`conf`	Bicriteria Approximation for k-Edge-Connectivity. ESA Zeev Nutov, Reut Cohen
2025	J	`jnl`	Bicriteria approximation for CoRR Zeev Nutov, Reut Cohen
2025	J	`jnl`	Improved bicriteria approximation for CoRR Zeev Nutov
2025	B	`conf`	Tight Analysis of the Primal-Dual Method for Edge-Covering Pliable Set Families. MFCS Zeev Nutov
2025	J	`jnl`	Tight analysis of the primal-dual method for edge-covering pliable set families. CoRR Zeev Nutov
2024	J	`jnl`	2-node-connectivity network design. Theor. Comput. Sci. Zeev Nutov
2024	—	`conf`	A 1.5-Approximation Algorithm for Activating Two Disjoint st-Paths. ALGOWIN Zeev Nutov, Dawod Kahba
2024	J	`jnl`	Approximation algorithms for node and element connectivity augmentation problems. Theory Comput. Syst. Zeev Nutov
2024	B	`conf`	Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families. IPCO Zeev Nutov
2024	B	`conf`	Improved Approximation Algorithms for Covering Pliable Set Families and Flexible Graph Connectivity. WAOA Zeev Nutov
2024	J	`jnl`	Improved approximation ratio for covering pliable set families. CoRR Zeev Nutov
2024	J	`jnl`	On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs. Oper. Res. Forum Zeev Nutov
2024	A	`conf`	Parameterized Algorithms for Node Connectivity Augmentation Problems. ESA Zeev Nutov
2023	J	`jnl`	A 1.5-pproximation algorithms for activating 2 disjoint st-paths. CoRR Zeev Nutov, Dawod Kahba
2023	J	`jnl`	A logarithmic approximation algorithm for the activation edge multicover problem. CoRR Zeev Nutov
2023	C	`conf`	An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. CiE Zeev Nutov
2023	J	`jnl`	Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments. IEEE/ACM Trans. Netw. Kiril Danilchenko, Zeev Nutov, Michael Segal
2023	J	`jnl`	Doing their best: How to provide service by limited number of drones? Wirel. Networks Kiril Danilchenko, Zeev Nutov, Michael Segal
2023	J	`jnl`	Extending the primal-dual 2-approximation algorithm beyond uncrossable set families. CoRR Zeev Nutov
2023	B	`conf`	Improved Approximations for Relative Survivable Network Design. WAOA Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov
2023	J	`jnl`	Improved Approximations for Relative Survivable Network Design. CoRR Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov
2023	J	`jnl`	Improved approximation algorithms for some capacitated k edge connectivity problems. CoRR Zeev Nutov
2023	J	`jnl`	Practical Budgeted Submodular Maximization. Algorithmica Moran Feldman, Zeev Nutov, Elad Shoham
2022	J	`jnl`	A 4 +  J. Comput. Syst. Sci. Zeev Nutov
2022	J	`jnl`	A polylogarithmic approximation algorithm for 2-edge-connected dominating set. Inf. Process. Lett. Amir Belgi, Zeev Nutov
2022	J	`jnl`	An $O(\sqrt{k})$-approximation algorithm for minimum power $k$ edge disjoint $st$ -paths. CoRR Zeev Nutov
2022	J	`jnl`	Approximating activation edge-cover and facility location problems. Theor. Comput. Sci. Guy Kortsarz, Zeev Nutov, Eli Shalom
2022	J	`jnl`	Approximating k-Connected m-Dominating Sets. Algorithmica Zeev Nutov
2022	A	`conf`	Data Structures for Node Connectivity Queries. ESA Zeev Nutov
2022	J	`jnl`	Parameterized algorithms for node connectivity augmentation problems. CoRR Zeev Nutov
2022	J	`jnl`	The minimum degree Group Steiner problem. Discret. Appl. Math. Guy Kortsarz, Zeev Nutov
2021	Misc	`conf`	Approximation Algorithms for Connectivity Augmentation Problems. CSR Zeev Nutov
2021	J	`jnl`	Data structure for node connectivity queries. CoRR Zeev Nutov
2021	Misc	`conf`	On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. CSR Zeev Nutov
2021	J	`jnl`	On the Tree Augmentation Problem. Algorithmica Zeev Nutov
2020	B	`conf`	2-Node-Connectivity Network Design. WAOA Zeev Nutov
2020	J	`jnl`	2-node-connectivity network design. CoRR Zeev Nutov
2020	A*	`conf`	A 4 + SODA Zeev Nutov
2020	A	`conf`	Approximating k-Connected m-Dominating Sets. ESA Zeev Nutov
2020	J	`jnl`	Approximation algorithms for connectivity augmentation problems. CoRR Zeev Nutov
2020	C	`conf`	Bounded Degree Group Steiner Tree Problems. IWOCA Guy Kortsarz, Zeev Nutov
2020	C	`conf`	Covering Users by a Connected Swarm Efficiently. ALGOSENSORS Kiril Danilchenko, Michael Segal, Zeev Nutov
2020	J	`jnl`	On rooted k-connectivity problems in quasi-bipartite digraphs. CoRR Zeev Nutov
2020	J	`jnl`	Practical Budgeted Submodular Maximization. CoRR Zeev Nutov, Elad Shoham
2019	J	`jnl`	A (4+ε)-approximation for k-connected subgraphs. CoRR Zeev Nutov
2019	J	`jnl`	An Õ(log CoRR Amir Belgi, Zeev Nutov
2019	J	`jnl`	Approximating $k$-connected $m$-dominating sets. CoRR Zeev Nutov
2019	B	`conf`	Approximating Activation Edge-Cover and Facility Location Problems. MFCS Zeev Nutov, Guy Kortsarz, Eli Shalom
2019	J	`jnl`	Bounded Degree Group Steiner Tree Problems. CoRR Guy Kortsarz, Zeev Nutov
2019	J	`jnl`	Improved approximation algorithms for minimum power covering problems. Theor. Comput. Sci. Gruia Calinescu, Guy Kortsarz, Zeev Nutov
2018	—	`ch.`	Activation Network Design Problems. Handbook of Approximation Algorithms and Metaheuristics (2) Zeev Nutov
2018	J	`jnl`	Approximating Steiner trees and forests with minimum number of Steiner points. J. Comput. Syst. Sci. Nachshon Cohen, Zeev Nutov
2018	J	`jnl`	Approximating activation edge-cover and facility location problems. CoRR Zeev Nutov, Eli Shalom
2018	J	`jnl`	Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies. ACM Trans. Algorithms Zeev Nutov
2018	J	`jnl`	Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems. Theory Comput. Syst. Zeev Nutov
2018	B	`conf`	Improved Approximation Algorithms for Minimum Power Covering Problems. WAOA Gruia Calinescu, Guy Kortsarz, Zeev Nutov
2018	J	`jnl`	Improved approximation algorithms for Inf. Process. Lett. Zeev Nutov
2018	J	`jnl`	LP-relaxations for tree augmentation. Discret. Appl. Math. Guy Kortsarz, Zeev Nutov
2018	—	`ch.`	Node-Connectivity Survivable Network Problems. Handbook of Approximation Algorithms and Metaheuristics (2) Zeev Nutov
2018	—	`ch.`	The k-Connected Subgraph Problem. Handbook of Approximation Algorithms and Metaheuristics (2) Zeev Nutov
2017	J	`jnl`	A Note on the Tree Augmentation Problem. CoRR Zeev Nutov
2017	J	`jnl`	Approximating source location and star survivable network problems. Theor. Comput. Sci. Guy Kortsarz, Zeev Nutov
2017	J	`jnl`	Improved Approximation Algorithm for Steiner ACM Trans. Algorithms Michael Dinitz, Guy Kortsarz, Zeev Nutov
2017	J	`jnl`	Improved approximation algorithms for k-connected m-dominating set problems. CoRR Zeev Nutov
2017	A	`conf`	On the Tree Augmentation Problem. ESA Zeev Nutov
2016	J	`jnl`	A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2. ACM Trans. Algorithms Guy Kortsarz, Zeev Nutov
2016	Misc	`conf`	Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems. CSR Zeev Nutov
2016	—	`conf`	LP-Relaxations for Tree Augmentation. APPROX-RANDOM Guy Kortsarz, Zeev Nutov
2016	J	`jnl`	On Fixed Cost k-Flow Problems. Theory Comput. Syst. MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2015	J	`jnl`	A 1.75 LP approximation for the Tree Augmentation Problem. CoRR Guy Kortsarz, Zeev Nutov
2015	J	`jnl`	A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. CoRR Guy Kortsarz, Zeev Nutov
2015	B	`conf`	Approximating Source Location and Star Survivable Network Problems. WG Guy Kortsarz, Zeev Nutov
2015	J	`jnl`	Approximating minimum power edge-multi-covers. J. Comb. Optim. Nachshon Cohen, Zeev Nutov
2015	J	`jnl`	Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. SIAM J. Comput. Takuro Fukunaga, Zeev Nutov, R. Ravi
2014	B	`conf`	Approximating Steiner Trees and Forests with Minimum Number of Steiner Points. WAOA Nachshon Cohen, Zeev Nutov
2014	J	`jnl`	Approximating minimum-cost edge-covers of crossing biset-families. Comb. Zeev Nutov
2014	J	`jnl`	Degree Constrained Node-Connectivity Problems. Algorithmica Zeev Nutov
2014	—	`conf`	Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. APPROX-RANDOM Michael Dinitz, Guy Kortsarz, Zeev Nutov
2013	J	`jnl`	A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. Theor. Comput. Sci. Nachshon Cohen, Zeev Nutov
2013	J	`jnl`	Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points CoRR Nachshon Cohen, Zeev Nutov
2013	J	`jnl`	MMM: multi-channel TDMA with MPR capabilities for MANETs. Wirel. Networks Shimon Avadis, Anat Lerner, Zeev Nutov
2013	B	`conf`	On Fixed Cost k-Flow Problems. WAOA MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2013	J	`jnl`	On some network design problems with degree constraints. J. Comput. Syst. Sci. Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2013	J	`jnl`	Small Discret. Appl. Math. Zeev Nutov
2013	J	`jnl`	Steiner Forest Orientation Problems. SIAM J. Discret. Math. Marek Cygan, Guy Kortsarz, Zeev Nutov
2013	J	`jnl`	Survivable network activation problems. Theor. Comput. Sci. Zeev Nutov
2012	J	`jnl`	A note on labeling schemes for graph connectivity. Inf. Process. Lett. Rani Izsak, Zeev Nutov
2012	J	`jnl`	A unified approach to source location via rooted network augmentation CoRR Zeev Nutov
2012	Misc	`conf`	Approximating Minimum Power Edge-Multi-Covers. CSR Nachshon Cohen, Zeev Nutov
2012	J	`jnl`	Approximating Node-Connectivity Augmentation Problems. Algorithmica Zeev Nutov
2012	J	`jnl`	Approximating fault-tolerant group-Steiner problems. Theor. Comput. Sci. Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2012	J	`jnl`	Approximating minimum-cost connectivity problems via uncrossable bifamilies. ACM Trans. Algorithms Zeev Nutov
2012	J	`jnl`	Approximating minimum-cost edge-covers of crossing biset-families CoRR Zeev Nutov
2012	J	`jnl`	Approximating subset k-connectivity problems. J. Discrete Algorithms Zeev Nutov
2012	J	`jnl`	Approximating survivable networks with minimum number of steiner points. Networks Lior Kamma, Zeev Nutov
2012	B	`conf`	Degree-Constrained Node-Connectivity. LATIN Zeev Nutov
2012	J	`jnl`	Improved approximation algorithms for Directed Steiner Forest. J. Comput. Syst. Sci. Moran Feldman, Guy Kortsarz, Zeev Nutov
2012	J	`jnl`	Improved approximation algorithms for maximum lifetime problems in wireless networks. Theor. Comput. Sci. Zeev Nutov, Michael Segal
2012	J	`jnl`	Prize-collecting steiner network problems. ACM Trans. Algorithms Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2012	—	`conf`	Scheduling of Vehicles in Transportation Networks. Nets4Cars/Nets4Trains Dariusz R. Kowalski, Zeev Nutov, Michael Segal
2012	J	`jnl`	Small ℓ-edge-covers in k-connected graphs CoRR Zeev Nutov
2012	A	`conf`	Steiner Forest Orientation Problems. ESA Marek Cygan, Guy Kortsarz, Zeev Nutov
2012	B	`conf`	Survivable Network Activation Problems. LATIN Zeev Nutov
2011	—	`conf`	A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius. APPROX-RANDOM Nachshon Cohen, Zeev Nutov
2011	J	`jnl`	A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. Inf. Process. Lett. Guy Even, Guy Kortsarz, Zeev Nutov
2011	J	`jnl`	Approximating Minimum-Power Degree and Connectivity Problems. Algorithmica Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko
2011	B	`conf`	Approximating Subset k-Connectivity Problems. WAOA Zeev Nutov
2011	J	`jnl`	Approximating directed weighted-degree constrained networks. Theor. Comput. Sci. Zeev Nutov
2011	J	`jnl`	Approximating minimum-power edge-multicovers CoRR Nachshon Cohen, Zeev Nutov
2011	J	`jnl`	Approximating some network design problems with node costs. Theor. Comput. Sci. Guy Kortsarz, Zeev Nutov
2011	J	`jnl`	Approximating subset $k$-connectivity problems CoRR Zeev Nutov
2011	J	`jnl`	Approximating survivable networks with β-metric costs. J. Discrete Algorithms Johnny David, Zeev Nutov
2011	J	`jnl`	Combinatorial Algorithms for Capacitated Network Design CoRR MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2011	—	`conf`	Network-Design with Degree Constraints. APPROX-RANDOM Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2011	J	`jnl`	Novel algorithms for the network lifetime problem in wireless settings. Wirel. Networks Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin
2011	J	`jnl`	Steiner Forest Orientation Problems CoRR Marek Cygan, Guy Kortsarz, Zeev Nutov
2010	J	`jnl`	Approximating Maximum Subgraphs without Short Cycles. SIAM J. Discret. Math. Guy Kortsarz, Michael Langberg, Zeev Nutov
2010	J	`jnl`	Approximating Minimum-Power k-Connectivity. Ad Hoc Sens. Wirel. Networks Zeev Nutov
2010	J	`jnl`	Approximating Steiner Networks with Node-Weights. SIAM J. Comput. Zeev Nutov
2010	B	`conf`	Approximating Survivable Networks with Minimum Number of Steiner Points. WAOA Lior Kamma, Zeev Nutov
2010	J	`jnl`	Approximating minimum power covers of intersecting families and directed edge-connectivity problems. Theor. Comput. Sci. Zeev Nutov
2010	J	`jnl`	Covering a laminar family by leaf to leaf links. Discret. Appl. Math. Yael Maduel, Zeev Nutov
2010	J	`jnl`	On minimum power connectivity problems. J. Discrete Algorithms Yuval Lando, Zeev Nutov
2010	B	`conf`	Prize-Collecting Steiner Network Problems. IPCO MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2009	J	`jnl`	A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov
2009	J	`jnl`	A note on Rooted Survivable Networks. Inf. Process. Lett. Zeev Nutov
2009	A*	`conf`	An almost SODA Zeev Nutov
2009	—	`conf`	Approximating Fault-Tolerant Group-Steiner Problems. FSTTCS Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2009	A*	`conf`	Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions. FOCS Zeev Nutov
2009	—	`conf`	Approximating Node-Connectivity Augmentation Problems. APPROX-RANDOM Zeev Nutov
2009	—	`conf`	Approximating Some Network Design Problems with Node Costs. APPROX-RANDOM Guy Kortsarz, Zeev Nutov
2009	J	`jnl`	Approximating connectivity augmentation problems. ACM Trans. Algorithms Zeev Nutov
2009	—	`conf`	Approximating minimum cost connectivity problems. Parameterized complexity and approximation algorithms Guy Kortsarz, Zeev Nutov
2009	J	`jnl`	Approximating minimum-power edge-covers and 2, 3-connectivity. Discret. Appl. Math. Guy Kortsarz, Zeev Nutov
2009	C	`conf`	Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks. ALGOSENSORS Zeev Nutov, Michael Segal
2009	A*	`conf`	Improved approximating algorithms for Directed Steiner Forest. SODA Moran Feldman, Guy Kortsarz, Zeev Nutov
2009	J	`jnl`	Inapproximability of survivable networks. Theor. Comput. Sci. Yuval Lando, Zeev Nutov
2009	J	`jnl`	Listing minimal edge-covers of intersecting families with applications to connectivity problems. Discret. Appl. Math. Zeev Nutov
2009	J	`jnl`	Wireless network design via 3-decompositions. Inf. Process. Lett. Zeev Nutov, Ariel Yaroshevitch
2008	J	`jnl`	A note on two source location problems. J. Discrete Algorithms Guy Kortsarz, Zeev Nutov
2008	—	`conf`	Approximating Directed Weighted-Degree Constrained Networks. APPROX-RANDOM Zeev Nutov
2008	—	`conf`	Approximating Maximum Subgraphs without Short Cycles. APPROX-RANDOM Guy Kortsarz, Michael Langberg, Zeev Nutov
2008	B	`conf`	Approximating Minimum-Power Degree and Connectivity Problems. LATIN Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko
2008	—	`conf`	Approximating Minimum-Power k-Connectivity. ADHOC-NOW Zeev Nutov
2008	B	`conf`	Approximating Steiner Networks with Node Weights. LATIN Zeev Nutov
2008	—	`conf`	Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows. DIALM-POMC Zeev Nutov
2008	J	`jnl`	Approximating maximum satisfiable subsystems of linear equations of bounded width. Inf. Process. Lett. Zeev Nutov, Daniel Reichman
2008	—	`conf`	Inapproximability of Survivable Networks. APPROX-RANDOM Yuval Lando, Zeev Nutov
2008	—	`conf`	Novel Algorithms for the Network Lifetime Problem in Wireless Settings. ADHOC-NOW Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin
2008	J	`jnl`	On extremal k-outconnected graphs. Discret. Math. Zeev Nutov
2008	J	`jnl`	Tight approximation algorithm for connectivity augmentation problems. J. Comput. Syst. Sci. Guy Kortsarz, Zeev Nutov
2007	A	`conf`	Approximating Interval Scheduling Problems with Bounded Profits. ESA Israel Beniaminy, Zeev Nutov, Meir Ovadia
2007	—	`ch.`	Approximating Minimum-Cost Connectivity Problems. Handbook of Approximation Algorithms and Metaheuristics Guy Kortsarz, Zeev Nutov
2007	J	`jnl`	Approximation algorithms and hardness results for cycle packing problems. ACM Trans. Algorithms Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster
2007	J	`jnl`	Improved approximation algorithms for directed Steiner forest. Electron. Colloquium Comput. Complex. Moran Feldman, Guy Kortsarz, Zeev Nutov
2007	J	`jnl`	On (t, k)-shredders in k-connected graphs. Ars Comb. Zeev Nutov, Masao Tsugaki
2007	A	`conf`	On Minimum Power Connectivity Problems. ESA Yuval Lando, Zeev Nutov
2007	J	`jnl`	On shredders and vertex connectivity augmentation. J. Discrete Algorithms Gilad Liberman, Zeev Nutov
2007	J	`jnl`	Packing directed cycles efficiently. Discret. Appl. Math. Zeev Nutov, Raphael Yuster
2007	J	`jnl`	Power optimization for connectivity problems. Math. Program. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
2006	J	`jnl`	A (1-1/ Oper. Res. Lett. Zeev Nutov, Israel Beniaminy, Raphael Yuster
2006	—	`conf`	Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems. APPROX-RANDOM Zeev Nutov
2006	J	`jnl`	Approximating Rooted Connectivity Augmentation Problems. Algorithmica Zeev Nutov
2006	—	`conf`	Tight Approximation Algorithm for Connectivity Augmentation Problems. ICALP (1) Guy Kortsarz, Zeev Nutov
2005	J	`jnl`	Approximating SIAM J. Comput. Guy Kortsarz, Zeev Nutov
2005	A*	`conf`	Approximating connectivity augmentation problems. SODA Zeev Nutov
2005	A*	`conf`	Approximation algorithms for cycle packing problems. SODA Michael Krivelevich, Zeev Nutov, Raphael Yuster
2005	J	`jnl`	Greedy approximation algorithms for directed multicuts. Networks Yana Kortsarts, Guy Kortsarz, Zeev Nutov
2005	B	`conf`	Power Optimization for Connectivity Problems. IPCO Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
2004	B	`conf`	Approximation Algorithm for Directed Multicuts. WAOA Yana Kortsarts, Guy Kortsarz, Zeev Nutov
2004	A*	`conf`	Approximation algorithm for k-node connected subgraphs via critical graphs. STOC Guy Kortsarz, Zeev Nutov
2004	B	`conf`	Packing Directed Cycles Efficiently. MFCS Zeev Nutov, Raphael Yuster
2003	J	`jnl`	Approximating Node Connectivity Problems via Set Covers. Algorithmica Guy Kortsarz, Zeev Nutov
2003	—	`conf`	Approximating Rooted Connectivity Augmentation Problems. RANDOM-APPROX Zeev Nutov
2001	—	`conf`	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. RANDOM-APPROX Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov
2001	J	`jnl`	On Rooted Node-Connectivity Problems. Algorithmica Joseph Cheriyan, Tibor Jordán, Zeev Nutov
2000	J	`jnl`	Approximating multiroot 3-outconnected subgraphs. Networks Zeev Nutov
2000	—	`conf`	Approximating node connectivity problems via set covers. APPROX Guy Kortsarz, Zeev Nutov
2000	J	`jnl`	On Integrality, Stability and Composition of Dicycle Packings and Covers. J. Comb. Optim. Zeev Nutov, Michal Penn
1999	J	`jnl`	A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. J. Algorithms Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente
1999	J	`jnl`	A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. J. Algorithms Yefim Dinitz, Zeev Nutov
1999	A*	`conf`	Approximating Multiroot 3-Outconnected Subgraphs. SODA Zeev Nutov
1998	—	`conf`	Approximating APPROX Joseph Cheriyan, Tibor Jordán, Zeev Nutov
1997	J	`jnl`	Faster approximation algorithms for weighted triconnectivity augmentation problems. Oper. Res. Lett. Zeev Nutov, Michal Penn
1997	C	`conf`	Finding Optimum CIAC Yefim Dinitz, Zeev Nutov
1995	A*	`conf`	A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. STOC Yefim Dinitz, Zeev Nutov
1995	J	`jnl`	on the Integral Dicycle Packings and Covers and the Linear ordering Polytope. Discret. Appl. Math. Zeev Nutov, Michal Penn