Preventing and Detecting Infiltration on Online Social Networks. - Canh V. Pham; Huan X. Hoang; Manh M. Vu (CSoNet, 2015)

Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks. - Canh V. Pham; My T. Thai; Dung K. Ha 001; Dung Q. Ngo; Huan X. Hoang (CSoNet, 2016)

A new viral marketing strategy with the competition in the large-scale online social networks. - Canh V. Pham; Dung K. Ha 001; Dung Q. Ngo; Quang C. Vu; Huan X. Hoang (RIVF, 2016)

Limiting the Spread of Epidemics within Time Constraint on Online Social Networks. - Canh V. Pham; Hoang M. Dinh; Hoa D. Nguyen; Huyen T. Dang; Huan X. Hoang (SoICT, 2017)

Targeted Misinformation Blocking on Online Social Networks. - Canh V. Pham; Quat V. Phu; Huan X. Hoang (ACIIDS (1), 2018)

Budgeted Competitive Influence Maximization on Online Social Networks. - Canh V. Pham; Hieu V. Duong; Bao Q. Bui; My T. Thai (CSoNet, 2018)

Maximizing misinformation restriction within time and budget constraints. - Canh V. Pham; My T. Thai; Hieu V. Duong; Bao Q. Bui; Huan X. Hoang (J. Comb. Optim., 2018)

Importance Sample-Based Approximation Algorithm for Cost-Aware Targeted Viral Marketing. - Canh V. Pham; Hieu V. Duong; My T. Thai (CSoNet, 2019)

Multiple Topics Misinformation blocking in Online Social Networks. - Dung V. Pham; Hieu V. Duong; Canh V. Pham; Bao Q. Bui; Anh V. Nguyen (KSE, 2019)

Competitive Influence Maximization on Online Social Networks: A Deterministic Modeling Approach. - Canh V. Pham; Nam V. Nguyen; Tuan X. Le; Huan X. Hoang (RIVF, 2019)

Minimum budget for misinformation blocking in online social networks. - Canh V. Pham; Quat V. Phu; Huan X. Hoang; Jun Pei; My T. Thai (J. Comb. Optim., 2019)

Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks. - Dung V. Pham; Long Giang Nguyen; Ngoc-Tu Nguyen 002; Canh V. Pham; Anh V. Nguyen (IEEE Access, 2020)

Influence Maximization with Priority in Online Social Networks. - Canh V. Pham; Dung K. T. Ha; Quang C. Vu; Anh N. Su; Huan X. Hoang (Algorithms, 2020)

Groups Influence with Minimum Cost in Social Networks. - Phuong N. H. Pham; Canh V. Pham; Hieu V. Duong; Trung Thanh Nguyen 004; My T. Thai (CSoNet, 2021)

Streaming Algorithms for Budgeted k-Submodular Maximization Problem. - Canh V. Pham; Quang C. Vu; Dung K. Ha 001; Tai T. Nguyen (CSoNet, 2021)

Threshold Benefit for Groups Influence in Online Social Networks. - Phuong N. H. Pham; Bich-Ngan T. Nguyen; Quy T. N. Co; Canh V. Pham; Václav Snásel (FDSE, 2021)

Streaming Algorithm for Submodular Cover Problem Under Noise. - Bich-Ngan T. Nguyen; Phuong N. H. Pham; Canh V. Pham; Anh N. Su; Václav Snásel (RIVF, 2021)

Efficient Algorithm for Multiple Benefit Thresholds Problem in Online Social Networks. - Phuong N. H. Pham; Bich-Ngan T. Nguyen; Canh V. Pham; Nghia D. Nghia; Václav Snásel (RIVF, 2021)

A Heuristic Algorithm for Student-Project Allocation Problem. - Nguyen Thi Uyen; Giang L. Nguyen; Canh V. Pham; Tran Xuan Sang; Hoang Huu Viet (CSoNet, 2022)

Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint. - Canh V. Pham; Dung K. T. Ha; Huan X. Hoang; Tan D. Tran (DSAA, 2022)

k-Submodular Cover Problem: Application and Algorithms. - Phuong N. H. Pham; Quy T. N. Co; Anh N. Su; Phuong T. Pham; Canh V. Pham; Václav Snásel (SoICT, 2022)

Maximizing k-submodular functions under budget constraint: applications and streaming algorithms. - Canh V. Pham; Quang C. Vu; Dung K. Ha 001; Tai T. Nguyen; Nguyen D. Le (J. Comb. Optim., 2022)

Minimum budget for misinformation detection in online social networks with provable guarantees. - Canh V. Pham; Dung V. Pham; Bao Q. Bui; Anh V. Nguyen (Optim. Lett., 2022)

Submodular Maximization Subject to a Knapsack Constraint Under Noise Models. - Dung K. Ha 001; Canh V. Pham; Huan X. Hoang (Asia Pac. J. Oper. Res., 2022)

Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem. - Canh V. Pham; Quat V. Phu; Dung T. K. Ha (CSoNet, 2023)

Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem. - Tan D. Tran; Canh V. Pham; Dung P. Trung; Uyen T. Nguyen (CSoNet, 2023)

Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. - Canh V. Pham; Tan D. Tran; Dung K. T. Ha; My T. Thai (IJCAI, 2023)

Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint. - Dung K. T. Ha; Canh V. Pham; Tan D. Tran; Huan X. Hoang (KSE, 2023)

Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint. - Tan D. Tran; Canh V. Pham; Dung Ha 001 (SoICT, 2023)

A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities. - Canh V. Pham; Dung K. Ha 001 (Inf. Process. Lett., 2023)

Minimizing cost for influencing target groups in social network: A model and algorithmic approach. - Phuong N. H. Pham; Canh V. Pham; Hieu V. Duong; Václav Snásel; Trung Thanh Nguyen 004 (Comput. Commun., 2023)

Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint. - Tan D. Tran; Canh V. Pham; Dung T. K. Ha; Phuong N. H. Pham (IJCAI, 2024)

Improved approximation algorithms for k-submodular maximization under a knapsack constraint. - Dung T. K. Ha; Canh V. Pham; Tan D. Tran (Comput. Oper. Res., 2024)

Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity. - Hue T. Nguyen; Dung T. K. Ha; Canh V. Pham (Asia Pac. J. Oper. Res., 2024)

Influence Maximization with Fairness Cost on Groups in Online Social Networks. - Hue T. Nguyen; Bac D. Pham; Dung T. K. Ha; Long Giang Nguyen; Canh V. Pham (ACIIDS (2), 2025)

Fast bicriteria streaming algorithms for submodular cover problem under noise models. - Bich-Ngan T. Nguyen; Phuong N. H. Pham; Canh V. Pham; Václav Snásel (Comput. Stand. Interfaces, 2025)

Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity. - Canh V. Pham (J. Comb. Optim., 2025)