| # | Document title | Authors | Year | Source | Cited by |
| 1 | Fast and efficient parallel coarsest refinement | Juneam N., Kantabutra S. | 2017 | Fundamenta Informaticae
150(2),pp. 211-220 | 2 |
| 2 | NC algorithms for minimum sum of diameters clustering | Juneam N., Kantabutra S. | 2017 | Journal of Internet Technology
18(4),pp. 899-905 | 1 |
| 3 | On the node searching spanning tree problem | Juneam N., Navrátil O., Peng S. | 2018 | Journal of Computers (Taiwan)
29(1),pp. 160-165 | 1 |
| 4 | GPU-accelerated method for simulating efficient portfolios in the mean-variance analysis | Charoenphaibul P., Juneam N. | 2020 | JCSSE 2020 - 17th International Joint Conference on Computer Science and Software Engineering
,pp. 171-176 | 0 |
| 5 | On the k-hop domination numbers of spanning trees of unicyclic graphs | Jindaluang W., Juneam N. | 2021 | Thai Journal of Mathematics
19(1),pp. 9-17 | 0 |
| 6 | Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model | Juneam N., Kantabutra S. | 2014 | 2014 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, ECTI-CON 2014
| 0 |
| 7 | On the parallel complexity of minimum sum of diameters clustering | Juneam N., Kantabutra S. | 2016 | ICSEC 2015 - 19th International Computer Science and Engineering Conference: Hybrid Cloud Computing: A New Approach for Big Data Era
| 0 |
| 8 | Multi-sources simultaneous communication in the wireless mobility model is NP-complete | Longani P., Juneam N., Kantabutra S. | 2016 | Chiang Mai Journal of Science
43(5),pp. 1205-1221 | 0 |