Full CV
PHAM VAN CANH
Lecturer
Post-doc (Computer Science Phenikaa University, 2020-2022)
Ph.D. (Computer Science University of Engineering and Technology, Vietnam National University, Hanoi, Vietnam, 2020)
M.Sc. (Computer Science University of Engineering and Technology, Vietnam National University, Hanoi, Vietnam, 2016)
B.Sc. (Information Technology People’s Security Academy, Vietnam, 2012)
RESEARCH INTERESTS
SELECTED PUBLICATIONS
- Hue T. Nguyen, Dung T. K. Ha, Canh V. Pham (2024). Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity. Asia-Pacific Journal of Operational Research. Volume , pp . (Q3 ranking on Scimago)
- Tan D. Tran, Canh V. Pham, Dung P. Trung, Uyen T. Nguyen (2024). Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem. Lecture Notes in Computer Science. Volume , pp 222-233. (Q3 ranking on Scimago)
- Uyen T. Nguyen, Sang X. Tran, Canh V. pham (2025). A new heuristic algorithm for Student-Project Allocation with lecturer preferences and Ties. Asia-Pacific Journal of Operational Research. Volume , pp . (Q3 ranking on Scimago)
- Dung T.K. Ha, Canh V. Pham, Tan D. Tran (2024). Improved approximation algorithms for k-submodular maximization under a knapsack constraint. Computers and Operations Research. Volume 161, pp 106452. (Q1 ranking on Scimago)
- Canh V. Pham, Tan D. Tran, Dung T. K. Ha, Quat V. Phu (2025). Practical algorithm for minimum cost submodular cover problem with performance guarantees. Optimization Letters. Volume , pp . (Q2 ranking on Scimago)
- Canh V. Pham (2024). Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity. Journal of Combinatorial Optimization. Volume 49, pp . (Q2 ranking on Scimago)
- Tan D. Tran, Canh V. Pham, Dung T. K. Ha, Phuong N. H. Pham (2024). Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint. Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence. Volume , pp . (Rank A*)
- Bich-Ngan T. Nguyen, Phuong N.H. Pham, Canh V. Pham, Vaclav Snasel (2025). Fast bicriteria streaming algorithms for submodular cover problem under noise models. Computer Standards and Interfaces. Volume 91, pp 103883. (Q1 ranking on Scimago)
- Nguyen Thi Uyen, Giang L. Nguyen, Canh V. Pham, Tran Xuan Sang, Hoang Huu Viet (2023). A Heuristic Algorithm for Student-Project Allocation Problem. Lecture Notes in Computer Science. Volume , pp 280-291. (Q2 ranking on Scimago)
- Canh V. Pham, Tan D. Tran, Dung T.K. Ha, My T. Thai (2023). Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. Volume , pp . (Rank A*)
- Canh V. Pham, Quat V. Phu, Dung T. K. Ha (2024). Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem. Lecture Notes in Computer Science. Volume , pp 186-197. (Q3 ranking on Scimago)
- Dung Ha, Canh V. Pham, Huan X. Hoang, “Submodular Maximization Subject to a Knapsack Constraint Under Noise Models”, Asia-Pacific Journal of Operational Research, 2021.
- Canh V. Pham, Quang C. Vu, Dung K. T. Ha, Tai T. Nguyen, Nguyen D. Le, “Maximizing k-submodular functions under budget constraint: applications and streaming algorithms”, Journal of Combinatorial Optimization, 44, 723–751, 2022.
- Canh V. Pham, Pham, D.V., Bui, B.Q, Anh V. Nguyen. “Minimum budget for misinformation detection in online social networks with provable guarantees”. Optimization Letters, 16, 515–544.
- Canh V. Pham, QV Phu, HX Hoang, J Pei, MT Thai. “Minimum budget for misinformation blocking in online social networks”. Journal of Combinatorial Optimization, 2019, 38, 1101–1127.
PROFESSIONAL CERTIFICATIONS
N/A
COURSES TAUGHT
15 Floor, A9 Building
Phenikaa University
Nguyen Van Trac, Yen Nghia
Ha Noi, Viet Nam