Scholar
Zeev Nutov
Google Scholar ID: cGvYY4YAAAAJ
The Open University of Israel
network design
approximation algorithms
Follow
Google Scholar
↗
Citations & Impact
All-time
Citations
875
H-index
15
i10-index
22
Publications
20
Co-authors
0
Contact
No contact links provided.
Publications
6 items
On k-connectivity oracles in k-connected graphs
arXiv.org · 2026
Cited
0
Approximation and parameterized algorithms for covering disjointness-compliable set families
2025
Cited
0
A tight example for approximation ratio 5 for covering small cuts by the primal-dual method
2025
Cited
0
Improved bicriteria approximation for $k$-edge-connectivity
2025
Cited
0
Bicriteria approximation for $k$-edge-connectivity
2025
Cited
0
Tight analysis of the primal-dual method for edge-covering pliable set families
2025
Cited
0
Resume (English only)
Co-authors
0 total
Co-authors: 0 (list not available)
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up