Yaroslav Pyrih

Papers

Total Citations

H-Index

About

Yaroslav Pyrih is a researcher advancing the frontiers of wireless networking and combinatorial optimization. His work centers on solving complex routing and pathfinding challenges in emerging network architectures, particularly through the lens of the Travelling Salesman Problem (TSP). In his most-cited paper, "Searching Extreme Paths Based on Travelling Salesman’s Problem for Wireless Emerging Networking" (2023, 13 citations), Pyrih introduces novel algorithmic approaches for optimizing data transmission routes in dynamic, resource-constrained wireless environments. This contribution addresses critical inefficiencies in network topology, enabling more robust and energy-efficient communication for next-generation systems like IoT and ad hoc networks. By bridging theoretical optimization with practical networking demands, Pyrih’s research offers tangible solutions for reducing latency and extending network lifespan. His work is notable for its interdisciplinary impact, drawing from graph theory, computational geometry, and wireless protocol design. With a growing citation footprint, Pyrih is establishing himself as a key voice in the intersection of algorithmic design and real-world networking challenges, making his research essential reading for students and engineers tackling the scalability and reliability issues of tomorrow’s wireless infrastructures.