Lizaveta Babior
Papers
1
Total Citations
4
H-Index
1
About
Lizaveta Babior’s research centers on algorithm optimization, with a particular focus on enhancing the efficiency of fundamental graph search methods. Her most cited work, “Optimizing Dijkstra’s Algorithm: Enhancing Pathfinding Efficiency Through Heuristics and Structural Techniques” (2025), systematically evaluates and synthesizes advanced optimization strategies for Dijkstra’s algorithm, addressing critical performance bottlenecks in large-scale, complex graphs. By integrating heuristic approaches and structural modifications, Babior’s research directly improves pathfinding efficiency across domains such as navigation, robotics, gaming, and network routing. With 4 citations already, this paper is gaining traction as a practical resource for both researchers and engineers seeking to accelerate real-world shortest-path computations. Her contributions stand out for bridging theoretical algorithm design with applied performance engineering, offering actionable insights for optimizing one of computer science’s most ubiquitous algorithms. Babior’s work exemplifies how targeted algorithmic refinements can yield significant gains in computational speed and scalability, making her a rising voice in the field of algorithm optimization and graph theory.
Research Focus
Key Achievements
Top Papers
- 1