Jake Nicolaidis

Papers

Total Citations

H-Index

About

Jake Nicolaidis is a mathematician whose work explores the intersection of graph theory and combinatorial processes, with a particular focus on the dynamics of robot crawlers on graphs. His research centers on understanding how autonomous agents navigate and traverse network structures, a problem with implications for robotics, network theory, and algorithm design. Nicolaidis introduced the concept of the "robot crawler number" of a graph, a parameter that quantifies the minimum number of steps required for a robot to systematically explore every edge of a graph under specific movement constraints. His foundational paper, "The Robot Crawler Number of a Graph" (2015), laid the groundwork for this novel area, while his subsequent work, "The robot crawler graph process" (2018), extended these ideas to dynamic, time-evolving graph processes. Though his papers have garnered modest citation counts—each with two citations—their originality has sparked interest among specialists in graph algorithms and discrete mathematics. Nicolaidis’s contributions are notable for introducing a fresh perspective on graph exploration problems, blending theoretical rigor with practical motivation. His work continues to inspire further investigation into the complexities of agent-based network traversal.