Zeev Nutov

Zeev Nutov is a Professor in the Department of Mathematics and Computer Science at The Open University of Israel. He has held various academic and administrative roles including Head of the Department (2017–2019), Head of the Graduate M.Sc. Program in Computer Science (2011–2013), and Head of the Computer Science Division (2004–2006). He obtained his B.Sc., M.Sc., and D.Sc. in Applied Mathematics from the Technion - Israel Institute of Technology (1990–1997). His research focuses on approximation algorithms for NP-hard problems in network design, connectivity, scheduling, and graph theory.

Education:

• B.Sc., Applied Mathematics, Technion (1990)
• M.Sc., Applied Mathematics, Technion (1992)
• D.Sc., Applied Mathematics, Technion (1997)

Research interests emphasize exact and approximation algorithms for network design problems, particularly connectivity and coverage in wired/wireless networks. His work often addresses combinatorial optimization challenges with practical applications.

Publications span over two decades, with recent contributions focusing on node connectivity, edge-disjoint paths, and approximation algorithms for graph problems.

No scientific awards explicitly listed, but his extensive publication record and academic leadership roles reflect his contributions.

Advising and grants: While specific student names/grant details aren't listed, his roles suggest involvement in mentoring graduate students and securing research funding.

Labs/teams: No specific labs mentioned, but his research aligns with theoretical computer science and discrete optimization groups.