Oksana Tymoshenko
Papers
1
Total Citations
13
H-Index
1
About
Oksana Tymoshenko is a researcher at the intersection of wireless networking and combinatorial optimization, best known for her work on applying the Travelling Salesman Problem (TSP) to next-generation communication systems. Her most-cited paper, "Searching Extreme Paths Based on Travelling Salesman’s Problem for Wireless Emerging Networking" (2023), has garnered 13 citations, establishing her as a rising voice in the field. In this work, she introduces novel pathfinding algorithms that optimize data routing in dynamic, resource-constrained wireless networks—a critical challenge for emerging technologies like IoT and 5G/6G. By reframing network efficiency as an extreme-path TSP variant, Tymoshenko bridges theoretical computer science with practical engineering, offering solutions that reduce latency and energy consumption. Her contributions are particularly notable for their potential to enhance autonomous systems and smart infrastructure. With a focus on algorithmic innovation and real-world applicability, Tymoshenko continues to shape how wireless networks handle complex, high-stakes data flows. Her work signals a promising trajectory in network optimization, where mathematical rigor meets the demands of modern connectivity.
Research Focus
Key Achievements
Top Papers
- 1