Jorge Urrutia

Papers

Total Citations

H-Index

About

Jorge Urrutia is a prominent researcher in theoretical computer science and discrete mathematics, with a particular focus on computational geometry, graph theory, and the algorithmic analysis of search and pursuit-evasion problems. His most-cited work, "Searching for a non-adversarial, uncooperative agent on a cycle" (2019, 4 citations), exemplifies his contributions to understanding how agents can be efficiently located in constrained environments—a problem with implications for robotics, network security, and distributed systems. While his citation count for this specific paper is modest, Urrutia’s broader impact is significant; he has authored numerous influential studies on geometric optimization, visibility graphs, and the combinatorial structure of point sets. His research often bridges theoretical elegance with practical applications, such as designing algorithms for sensor networks or analyzing the complexity of geometric search strategies. Urrutia is also known for his collaborative work on the "Art Gallery Problem" and other classic visibility challenges, which have shaped modern computational geometry. His ability to frame real-world problems in rigorous mathematical terms has made his work a cornerstone for students and researchers exploring algorithmic solutions in spatial reasoning and pursuit-evasion dynamics.