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)

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)

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

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)

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)

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)

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)

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)