Kesornprom, S. and Pholasa, N. (2021). Strong Convergence of the Inertial Proximal Algorithm for the Split Variational Inclusion Problem in Hilbert Spaces. 18(3), 1401-1415.

Pholasa, N., Pakkaranang, N., Bantaojai, T., Jabir Khan M. and Chaloemwiriya, W. (2020). Modified Explicit Self-Adaptive Two-Step Extragradient Method for Equilibrium Programming in a Real Hilbert Space. Thai Journal of Mathematics. 18(3), 1343-1358.

Cholamjiak P, Kankam K, Srinet P, Pholasa N. A double forward-backward algorithm using linesearches for minimization problem. Thai Journal of Mathematics 2019;18(1):63-76.

Cholamjiak P , Pholasa N , Kankam K , Srinak P. Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm. Rendiconti del Circolo Matematico di Palermo Series 2. 2019; 69(3). 1131-1148.

Kankam K, Pholasa N, Cholamjiak P. Hybrid Forward-Backward Algorithms Using Linesearch Rule for Minimization Problem. Thai  Journal of Mathematics 2019;17(3):607-625.

Kesornprom S, Pholasa N, Cholamjiak P. On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem. Numerical Algorithms 2019;997-1017.

Suantai S, Eiamniran N, Pholasa N, Cholamjiak P. Three-Step Projective Methods for Solving the Split Feasibility Problems. Mathematics 2019; 7(8):712.

Kesornprom S, Pholasa N, Cholamjiak P. A Modified CQ Algorithm for Solving the Multiple-Sets Split Feasibility Problem and the Fixed Point Problem for Nonexpansive Mappings. Thai Journal of Mathematics 2019;17(2):475-493.

Cholamjiak P, Kesornprom S, Pholasa N. Weak and strong convergence theorems for the inclusion problem and the fixed-point problem of nonexpansive mappings. Mathematics 2019;7(2):167.

Kankam K, Pholasa N, Cholamjiak P. On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization. Mathematical Methods in the Applied Sciences 2019;42(5):1352-1362.

Pheetarakorn S , Pholasa N ,  Cholamjiak W. Convergence theorems for three G-nonexpansive mappings in hilbert spaces with graphs by modifying SP and noor iterations with shrinking projection methods. Maltepe Üniversitesi. 2019.

Pakkaranang N, Kumam P, Cholamjiak P, Pholasa N. Convergence analysis of modified Picard-S hybrid with errors for total asymptotically nonexpansive mappings in CAT (0) spaces. Linear Nonlinear Anal 2018;4(3):377-391.

Suantai S, Pholasa N, Cholamjiak P. The modified inertial relaxed CQ algorithm for solving the split feasibility problems. J. Ind. Manag. Optim 2018;14(4):1595-1615.

Cholamjiak W, Pholasa N, Suantai S. A modified inertial shrinking projection method for solving inclusion problems and quasi-nonexpansive multivalued mappings. Computational and Applied Mathematics 2018;37(5):5750-5774.

Cholamjiak P, Suantai S, Pholasa N. Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems. Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas 2018;113(2):1081-1099.

Cholamjiak P, Pholasa N. Approximating fixed points for continuous functions on an arbitrary interval. Journal of Inequalities and Applications. 2013:1-9.