Publications

All Journal Proceedings

2024

  1. 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

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. 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
  4. 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
  5. 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. 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
  2. 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
  3. 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

2019

  1. 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
  2. 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
  3. 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. 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
  2. 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