Zeev Nutov
Orcid: 0000-0002-6629-3243
According to our database1,
Zeev Nutov
authored at least 133 papers
between 1995 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
2025
0
5
10
15
3
1
1
4
6
5
2
1
3
6
4
2
3
2
7
11
8
6
7
4
5
2
2
1
1
2
2
1
1
3
2
1
1
3
1
1
2
2
4
1
1
1
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Inf. Process. Lett., 2025
2024
Theory Comput. Syst., October, 2024
Oper. Res. Forum, March, 2024
Proceedings of the Integer Programming and Combinatorial Optimization, 2024
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
Proceedings of the Algorithmics of Wireless Networks - 20th International Symposium, 2024
2023
Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments.
IEEE/ACM Trans. Netw., December, 2023
Wirel. Networks, 2023
CoRR, 2023
CoRR, 2023
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023
Proceedings of the Unity of Logic and Computation, 2023
2022
Theor. Comput. Sci., 2022
J. Comput. Syst. Sci., 2022
Inf. Process. Lett., 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
2021
Proceedings of the Computer Science - Theory and Applications, 2021
2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
Proceedings of the Algorithms for Sensor Systems, 2020
2019
Theor. Comput. Sci., 2019
CoRR, 2019
2018
Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies.
ACM Trans. Algorithms, 2018
Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems.
Theory Comput. Syst., 2018
J. Comput. Syst. Sci., 2018
Improved approximation algorithms for <i>k</i>-connected <i>m</i>-dominating set problems.
Inf. Process. Lett., 2018
Activation Network Design Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
Node-Connectivity Survivable Network Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
The k-Connected Subgraph Problem.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Theor. Comput. Sci., 2017
Improved Approximation Algorithm for Steiner <i>k</i>-Forest with Nearly Uniform Weights.
ACM Trans. Algorithms, 2017
CoRR, 2017
2016
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2.
ACM Trans. Algorithms, 2016
Proceedings of the Computer Science - Theory and Applications, 2016
2015
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.
SIAM J. Comput., 2015
2014
Proceedings of the Approximation, 2014
2013
A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius.
Theor. Comput. Sci., 2013
Discret. Appl. Math., 2013
CoRR, 2013
2012
Improved approximation algorithms for maximum lifetime problems in wireless networks.
Theor. Comput. Sci., 2012
ACM Trans. Algorithms, 2012
Networks, 2012
J. Comput. Syst. Sci., 2012
Proceedings of the Communication Technologies for Vehicles - 4th International Workshop, 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
2011
Wirel. Networks, 2011
Theor. Comput. Sci., 2011
Theor. Comput. Sci., 2011
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
Inf. Process. Lett., 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2010
Approximating minimum power covers of intersecting families and directed edge-connectivity problems.
Theor. Comput. Sci., 2010
2009
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
ACM Trans. Algorithms, 2009
Listing minimal edge-covers of intersecting families with applications to connectivity problems.
Discret. Appl. Math., 2009
Discret. Appl. Math., 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009
2008
J. Comput. Syst. Sci., 2008
Inf. Process. Lett., 2008
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
ACM Trans. Algorithms, 2007
On (t, k)-shredders in k-connected graphs.
Ars Comb., 2007
Proceedings of the Algorithms, 2007
2006
Oper. Res. Lett., 2006
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems.
Proceedings of the Approximation, 2006
2005
SIAM J. Comput., 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
2004
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
2003
2001
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.
Proceedings of the Approximation, 2001
2000
J. Comb. Optim., 2000
1999
A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs.
J. Algorithms, 1999
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph.
J. Algorithms, 1999
1998
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998
1997
Oper. Res. Lett., 1997
Finding Optimum <i>k</i>-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for <i>k</i>=3, 4, 5.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997
1995
Discret. Appl. Math., 1995
A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995