Amir Nayyeri

Papers

Total Citations

H-Index

About

Amir Nayyeri is a computer science researcher whose work focuses on the design and analysis of approximation algorithms, with a particular emphasis on multi-robot coordination and scheduling problems in metric spaces. His most recognized contributions center on the challenging **min-max latency patrol-scheduling problem**, where the goal is to compute optimal or near-optimal patrol schedules for teams of robots visiting sites across a metric space while minimizing the worst-case time any site goes unvisited. Nayyeri's research on multi-robot patrol scheduling has attracted notable attention in the robotics and theoretical computer science communities, with his 2021 paper on approximation algorithms for this problem accumulating 15 citations — a strong indicator of relevance in a specialized field. His follow-up work in 2022 extended these ideas to cyclic patrol solutions, exploring the structural properties of optimal schedules and deepening theoretical understanding of the problem's complexity. His contributions are valuable to students and practitioners working at the intersection of algorithms, computational geometry, and autonomous systems, providing rigorous theoretical foundations for real-world multi-agent surveillance and coverage applications. Nayyeri's body of work reflects a commitment to bridging abstract algorithmic theory with practical robotics challenges.