Dynamic Communication-Efficient Parallel Sorting on SMPs. - Tipraporn Thanakulwarapas; Jeeraporn Werapun (HPCC, 2009)

An efficient parallel construction of optimal independent spanning trees on hypercubes. - Jeeraporn Werapun; Sarun Intakosum; Veera Boonjing (J. Parallel Distributed Comput., 2012)

An optimized bitonic sorting strategy with midpoint-based dynamic communication. - Tipraporn Thanakulwarapas; Jeeraporn Werapun (J. Parallel Distributed Comput., 2015)

Embedding the optimal all-to-all personalized exchange on multistage interconnection networks+. - Roselin Petagon; Jeeraporn Werapun (J. Parallel Distributed Comput., 2016)

VA-DE: Valuable ATAPE with dynamic embedding and super-pipeline scheduling on partitionable multistage interconnection. - Roselin Petagon; Jeeraporn Werapun (J. Parallel Distributed Comput., 2017)

Parallel time-space reduction by unbiased filtering for solving the 0/1-Knapsack problem. - Patcharin Buayen; Jeeraporn Werapun (J. Parallel Distributed Comput., 2018)

Shortest-path routing for optimal all-to-all personalized-exchange embedding on hierarchical hypercube networks. - Nuntipat Phisutthangkoon; Jeeraporn Werapun (J. Parallel Distributed Comput., 2021)

Efficient 0/1-Multiple-Knapsack Problem Solving by Hybrid DP Transformation and Robust Unbiased Filtering. - Patcharin Buayen; Jeeraporn Werapun (Algorithms, 2022)

Optimal ATAPE task scheduling on reconfigurable and partitionable hierarchical hypercube networks. - Nuntipat Phisutthangkoon; Jeeraporn Werapun (Parallel Comput., 2022)

Minimum cost of job assignment in polynomial time by adaptive unbiased filtering and branch-and-bound algorithm with the best predictor. - Jeeraporn Werapun; Witchaya Towongpaichayont; Anantaporn Hanskunatai (Intell. Syst. Appl., 2025)