| 2025 | Algosensors | A Logarithmic Approximation Algorithm for the Activation Edge-Multicover Problem. | Zeev Nutov, Avner Huri, Guy Kortsarz |
| 2025 | ESA | Bicriteria Approximation for k-Edge-Connectivity. | Zeev Nutov, Reut Cohen |
| 2025 | MFCS | Tight Analysis of the Primal-Dual Method for Edge-Covering Pliable Set Families. | Zeev Nutov |
| 2024 | Algosensors | A 1.5-Approximation Algorithm for Activating Two Disjoint st-Paths. | Zeev Nutov, Dawod Kahba |
| 2024 | ESA | Parameterized Algorithms for Node Connectivity Augmentation Problems. | Zeev Nutov |
| 2024 | IPCO | Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families. | Zeev Nutov |
| 2024 | WAOA | Improved Approximation Algorithms for Covering Pliable Set Families and Flexible Graph Connectivity. | Zeev Nutov |
| 2023 | CiE | An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths. | Zeev Nutov |
| 2023 | WAOA | Improved Approximations for Relative Survivable Network Design. | Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov |
| 2022 | ESA | Data Structures for Node Connectivity Queries. | Zeev Nutov |
| 2021 | CSR | Approximation Algorithms for Connectivity Augmentation Problems. | Zeev Nutov |
| 2021 | CSR | On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. | Zeev Nutov |
| 2020 | Algosensors | Covering Users by a Connected Swarm Efficiently. | Kiril Danilchenko, Michael Segal, Zeev Nutov |
| 2020 | ESA | Approximating k-Connected m-Dominating Sets. | Zeev Nutov |
| 2020 | IWOCA | Bounded Degree Group Steiner Tree Problems. | Guy Kortsarz, Zeev Nutov |
| 2020 | SODA | A 4 + | Zeev Nutov |
| 2020 | WAOA | 2-Node-Connectivity Network Design. | Zeev Nutov |
| 2019 | MFCS | Approximating Activation Edge-Cover and Facility Location Problems. | Zeev Nutov, Guy Kortsarz, Eli Shalom |
| 2018 | WAOA | Improved Approximation Algorithms for Minimum Power Covering Problems. | Gruia Calinescu, Guy Kortsarz, Zeev Nutov |
| 2017 | ESA | On the Tree Augmentation Problem. | Zeev Nutov |
| 2016 | CSR | Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems. | Zeev Nutov |
| 2015 | WG | Approximating Source Location and Star Survivable Network Problems. | Guy Kortsarz, Zeev Nutov |
| 2014 | WAOA | Approximating Steiner Trees and Forests with Minimum Number of Steiner Points. | Nachshon Cohen, Zeev Nutov |
| 2013 | WAOA | On Fixed Cost k-Flow Problems. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
| 2012 | CSR | Approximating Minimum Power Edge-Multi-Covers. | Nachshon Cohen, Zeev Nutov |
| 2012 | ESA | Steiner Forest Orientation Problems. | Marek Cygan, Guy Kortsarz, Zeev Nutov |
| 2012 | LATIN | Degree-Constrained Node-Connectivity. | Zeev Nutov |
| 2012 | LATIN | Survivable Network Activation Problems. | Zeev Nutov |
| 2011 | WAOA | Approximating Subset k-Connectivity Problems. | Zeev Nutov |
| 2010 | IPCO | Prize-Collecting Steiner Network Problems. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
| 2010 | WAOA | Approximating Survivable Networks with Minimum Number of Steiner Points. | Lior Kamma, Zeev Nutov |
| 2009 | Algosensors | Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks. | Zeev Nutov, Michael Segal |
| 2009 | FOCS | Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions. | Zeev Nutov |
| 2009 | SODA | Improved approximating algorithms for Directed Steiner Forest. | Moran Feldman, Guy Kortsarz, Zeev Nutov |
| 2009 | SODA | An almost | Zeev Nutov |
| 2008 | LATIN | Approximating Minimum-Power Degree and Connectivity Problems. | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko |
| 2008 | LATIN | Approximating Steiner Networks with Node Weights. | Zeev Nutov |
| 2007 | ESA | Approximating Interval Scheduling Problems with Bounded Profits. | Israel Beniaminy, Zeev Nutov, Meir Ovadia |
| 2007 | ESA | On Minimum Power Connectivity Problems. | Yuval Lando, Zeev Nutov |
| 2006 | ICALP | Tight Approximation Algorithm for Connectivity Augmentation Problems. | Guy Kortsarz, Zeev Nutov |
| 2005 | IPCO | Power Optimization for Connectivity Problems. | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov |
| 2005 | SODA | Approximation algorithms for cycle packing problems. | Michael Krivelevich, Zeev Nutov, Raphael Yuster |
| 2005 | SODA | Approximating connectivity augmentation problems. | Zeev Nutov |
| 2004 | MFCS | Packing Directed Cycles Efficiently. | Zeev Nutov, Raphael Yuster |
| 2004 | STOC | Approximation algorithm for k-node connected subgraphs via critical graphs. | Guy Kortsarz, Zeev Nutov |
| 2004 | WAOA | Approximation Algorithm for Directed Multicuts. | Yana Kortsarts, Guy Kortsarz, Zeev Nutov |
| 1999 | SODA | Approximating Multiroot 3-Outconnected Subgraphs. | Zeev Nutov |
| 1997 | CIAC | Finding Optimum | Yefim Dinitz, Zeev Nutov |
| 1995 | STOC | 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 |