Kirill Ternovsky

Papers

Total Citations

H-Index

About

Kirill Ternovsky is a mathematician whose work explores the intersection of graph theory and combinatorial processes, with a particular focus on the dynamics of robot motion on graphs. His research centers on the concept of the "robot crawler number," a parameter that quantifies the minimum number of steps required for a robot to traverse all edges of a graph under specific movement constraints. In his foundational 2015 paper, "The Robot Crawler Number of a Graph," Ternovsky introduced this novel invariant, establishing its theoretical properties and providing initial bounds. He later expanded this work in his 2018 study, "The robot crawler graph process," where he modeled the crawler's traversal as a dynamic graph process, analyzing its behavior over time and its implications for network exploration and coverage. Although his publications have garnered modest citation counts—each with two citations—his contributions are notable for introducing a fresh perspective on graph traversal problems, bridging theoretical graph theory with practical applications in robotics and network analysis. Ternovsky's work offers a compelling framework for students and researchers interested in combinatorial optimization and algorithmic graph theory.