Mr. Ro-Yu Wu | Computer Science | Research Excellence Award

Professor | Lunghwa University of Science and Technology | Taiwan

Mr. Ro-Yu Wu is a Taiwan-based researcher recognized for his contributions to combinatorial algorithms, graph theory, and efficient data structures, particularly within the domains of ranking and unranking methods, Hamiltonian graph properties, and algorithmic generation of combinatorial objects. As a productive scholar in theoretical computer science and industrial management, his work emphasizes the design of loopless, lexicographic, and Gray code–based algorithms that enhance computational efficiency and fault-tolerant communication in complex networks. His research is well acknowledged in the global academic community, as reflected in his Scopus record with 45 documents, 308 citations across 189 citing works, and an h-index of 10. On ResearchGate, he maintains an active profile with 47 publications, over 6,300 reads, and 367 citations. These metrics highlight his growing influence, especially in areas involving structured graph traversal, spanning-tree generation, and the analytical foundations supporting optimization and data broadcasting systems. His work frequently explores practical algorithmic strategies for high-performance computing environments, providing innovative insights for fault-tolerant network design and combinatorial enumeration. Mr. Wu’s collaborations span multi-author research teams, contributing to advancements published in high-impact venues such as Theoretical Computer Science, The Journal of Supercomputing, Journal of Combinatorial Optimization, and Optimization Letters. His ongoing research continues to shape efficient computational paradigms for combinatorial structures, making him a relevant contributor to the future of theoretical and applied algorithmic studies.

Profile

Scopus

Featured Publications 

Xie, Z., Wu, R.-Y., & Shi, L. (2025). Ranking and unranking algorithms for derangements based on lexicographical order. Theoretical Computer Science.

Pai, K.-J., Wu, R.-Y., Peng, S. L., & Chang, J. M. (2023). Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting. The Journal of Supercomputing.

Chang, Y. H., Wu, R.-Y., Chang, R. S., & Chang, J. M. (2022). Improved algorithms for ranking and unranking (k, m)-ary trees in B-order. Journal of Combinatorial Optimization.

Wu, R.-Y., Tseng, C. C., Hung, L. J., & Chang, J. M. (2022). Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms. International Symposium on Combinatorial Optimization.

Chang, Y. H., Wu, R.-Y., Lin, C. K., & Chang, J. M. (2021). A loopless algorithm for generating (k, m)-ary trees in Gray code order. Optimization Letters.