Evan A. Sultanik
Papers
1
Total Citations
4
H-Index
1
About
Evan A. Sultanik is a researcher whose work bridges theoretical computer science and practical multiagent systems, with a particular focus on geometric optimization and distributed algorithms. His most-cited paper, "Dominating sets of agents in visibility graphs: distributed algorithms for art gallery problems" (2010, 4 citations), tackles the classic Art Gallery Problem—finding a minimal set of vertices to observe a polygon's interior—in a distributed context. This contribution is pivotal for applications in robotics, sensor networks, wireless networking, and surveillance, where centralized solutions are often impractical. Sultanik's approach extends the problem to multiagent systems, offering algorithms that enable autonomous agents to coordinate coverage without a central controller. While his citation count is modest, his work is notable for its interdisciplinary impact, providing foundational insights for deploying teams of robots or sensors in complex environments. Sultanik's research stands out for its elegant fusion of theoretical rigor with real-world applicability, making him a valuable contributor to the fields of distributed computing and geometric optimization.
Research Focus
Key Achievements
Top Papers
- 1