Publications

All Journal Proceedings

2025

  1. Practical Algorithm for Minimum Cost Submodular Cover Problem with Performance Guarantees Canh V. Pham, Tan D. Tran, Dung T. K. Ha, and 1 more author ; Optimization Letters, 2025
  2. A new heuristic algorithm for Student-Project Allocation with lecturer preferences and Ties Uyen T. Nguyen, Sang X. Tran, and Canh V. Pham ; Asia-Pacific Journal of Operational Research, 2025
  3. Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity Canh V. Pham ; Journal of Combinatorial Optimization, 2025

2024

  1. Fast bicriteria streaming algorithms for submodular cover problem under noise models Bich-Ngan T. Nguyen, Phuong H.N. Pham, Canh V. Pham*, and 1 more author ; Computer Standards and Interfaces, 2024
  2. Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint Tan D. Tran, Canh V. Pham* Dung T. K. Ha, and Phuong H. N Pham ; In Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI), Rank A*, acceptance rate=791/5651=14%, 2024
  3. Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity Nguyen Hue T., Dung T. K. Ha, and Canh V. Pham ; Asia-Pacific Journal of Operational Research, 2024
  4. Improved approximation algorithms for k-submodular maximization under a knapsack constraint Dung T. K. Ha, Canh V. Pham*, and Tan D. Tran ; Computers & Operations Research, 2024

2023

  1. Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem Tan D. Tran, Canh V. Pham, Dung T. Pham, and 1 more author ; In Proceedings of 12th International Conference on Computational Data and Social Networks (CSoNet), 2023
  2. Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem Canh V. Pham, Quat Phu, and Dung T.K Ha ; In Proceedings of 12th International Conference on Computational Data and Social Networks (CSoNet), 2023
  3. Minimizing cost for influencing target groups in social network: A model and algorithmic approach Phuong N. H. Pham, Canh V. Pham*, Hieu V. Duong, and 2 more authors ; Computer Communication, 2023
  4. A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities Canh V. Pham, and Dung K. Ha ; Information Processing Letters, 2023
  5. Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint Canh V. Pham, Tan D. Tran, Dung T. K. Ha, and 1 more author ; In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI), Rank A*, acceptance rate=14.9% , 2023
  6. Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint Dung K. T. Ha, Canh V. Pham, Tan D. Tran, and 1 more author ; In 15th International Conference on Knowledge and Systems Engineering, (KSE), 2023
  7. Maximizing a k-Submodular Maximization Function under an Individual Knapsack Constraint Tan D. Tran, Canh V. Pham, and Dung Ha ; In Proceedings of the 12th International Symposium on Information and Communication Technology (SOICT), 2023

2022

  1. Submodular Maximization Subject to a Knapsack Constraint Under Noise Models Dung K. Ha, Canh V. Pham*, and Huan X. Hoang ; Asia-Pacific Journal of Operational Research, 2022
  2. Maximizing k-submodular functions under budget constraint: applications and streaming algorithms Canh V. Pham, Quang C. Vu, Dung K. Ha, and 2 more authors ; Journal of Combinatorial Optimization, 2022
  3. Minimum budget for misinformation detection in online social networks with provable guarantees Canh V. Pham, Dung V. Pham, Bao Q. Bui, and 1 more author ; Optimization Letters, 2022
  4. A Heuristic Algorithm for Student-Project Allocation Problem Nguyen Thi Uyen, Giang L. Nguyen, Canh V. Pham, and 2 more authors ; In Proceedings of 11th International Conference on Computational Data and Social Networks (CSoNet), 2022
  5. Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint Canh V. Pham, Dung K. T. Ha, Huan X. Hoang, and 1 more author ; In Proceedings of 9th IEEE International Conference on Data Science and Advanced Analytics (DSAA), Rank A, acceptance rate=24.9%, 2022
  6. k-Submodular Cover Problem: Application and Algorithms Phuong N. H. Pham, Quy T. N. Co, Anh N. Su, and 3 more authors ; In Proceedings of 11th International Symposium on Information and Communication Technology, 2022

2021

  1. Streaming Algorithms for Budgeted k-Submodular Maximization Problem Canh V. Pham, Quang C. Vu, Dung K. Ha, and 1 more author ; In Proceedings of 10th International Conference on Computational Data and Social Networks (CSoNet), 2021
  2. Groups Influence with Minimum Cost in Social Networks Phuong N. H. Pham, Canh V. Pham, Hieu V. Duong, and 2 more authors ; In Proceedings of 10th International Conference on Computational Data and Social Networks (CSoNet), 2021
  3. Threshold Benefit for Groups Influence in Online Social Networks Phuong N. H. Pham, Bich-Ngan T. Nguyen, Quy T. N. Co, and 2 more authors ; In 8th International Conference on Future Data and Security Engineering (FDSE), 2021
  4. Streaming Algorithm for Submodular Cover Problem Under Noise Bich-Ngan T. Nguyen, Phuong N. H. Pham, Canh V. Pham, and 2 more authors ; In Proceedings of RIVF International Conference on Computing and Communication Technologies, 2021
  5. Efficient Algorithm for Multiple Benefit Thresholds Problem in Online Social Networks Phuong N. H. Pham, Bich-Ngan T. Nguyen, Canh V. Pham, and 2 more authors ; In Proceedings of RIVF International Conference on Computing and Communication Technologies, 2021

2020

  1. Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks Dung V. Pham, Long Giang Nguyen, Ngoc-Tu Nguyen, and 2 more authors ; IEEE Access, 2020
  2. Influence Maximization with Priority in Online Social Networks Canh V. Pham, Dung K. T. Ha, Quang C. Vu, and 2 more authors ; Algorithms, 2020

2019

  1. Minimum budget for misinformation blocking in online social networks Canh V. Pham, Quat V. Phu, Huan X. Hoang, and 2 more authors ; Journal of Combinatorial Optimization, 2019
  2. Importance Sample-Based Approximation Algorithm for Cost-Aware Targeted Viral Marketing Canh V. Pham, Hieu V. Duong, and My T. Thai ; In Proceedings of 10th International Conference on Computational Data and Social Networks (CSoNet), 2019
  3. Multiple Topics Misinformation blocking in Online Social Networks Dung V. Pham, Hieu V. Duong, Canh V. Pham, and 2 more authors ; In Proceedings of 11th International Conference on Knowledge and Systems Engineering, (KSE), 2019
  4. Competitive Influence Maximization on Online Social Networks: A Deterministic Modeling Approach Canh V. Pham, Nam V. Nguyen, Tuan X. Le, and 1 more author ; In Proceedings of 2019 IEEE-RIVF International Conference on Computing and Communication Technologies, 2019

2018

  1. Maximizing misinformation restriction within time and budget constraints Canh V. Pham, My T. Thai, Hieu V. Duong, and 2 more authors ; Journal of Combinatorial Optimization, 2018
  2. Targeted Misinformation Blocking on Online Social Networks Canh V. Pham, Quat V. Phu, and Huan X. Hoang ; In Proceedings 10th Asian Conference on Intelligent Information and Database Systems (ACIIDS)-Part I, 2018
  3. Budgeted Competitive Influence Maximization on Online Social Networks Canh V. Pham, Hieu V. Duong, Bao Q. Bui, and 1 more author ; In Proceedings of 7th International Conference Computational Data and Social Networks, 2018

2017

  1. Limiting the Spread of Epidemics within Time Constraint on Online Social Networks Canh V. Pham, Hoang M. Dinh, Hoa D. Nguyen, and 2 more authors ; In Proceedings of the 8th International Symposium on Information and Communication Technology, 2017

2016

  1. Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks Canh V. Pham, My T. Thai, Dung K. Ha, and 2 more authors ; In Proceedings of 5th International Conference on Computational Data and Social Networks (CSoNet), 2016
  2. A new viral marketing strategy with the competition in the large-scale online social networks Canh V. Pham, Dung K. Ha, Dung Q. Ngo, and 2 more authors ; In 2016 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), 2016

2015

  1. Preventing and Detecting Infiltration on Online Social Networks Canh V. Pham, Huan X. Hoang, and Manh M. Vu ; In Proceedings of 4th International Conference on Computational Data and Social Networks (CSoNet), 2015