Canh V. Pham - RankMe

48 papers A* 2B 1Journal 24Unranked 21

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint. J. Comb. Optim. Tan D. Tran, Canh V. Pham
2025	J	`jnl`	A New Heuristic Algorithm for Student-Project Allocation with Lecturer Preferences and Ties. Asia Pac. J. Oper. Res. Uyen T. Nguyen, Sang X. Tran, Canh V. Pham
2025	J	`jnl`	Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity. J. Comb. Optim. Canh V. Pham
2025	J	`jnl`	Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint. CoRR Tan D. Tran, Canh V. Pham
2025	J	`jnl`	Fast Stochastic Greedy Algorithm for k-Submodular Cover Problem. CoRR Hue T. Nguyen, Tan D. Tran, Long Giang Nguyen, Canh V. Pham
2025	J	`jnl`	Fast bicriteria streaming algorithms for submodular cover problem under noise models. Comput. Stand. Interfaces Bich-Ngan T. Nguyen, Phuong N. H. Pham, Canh V. Pham, Václav Snásel
2025	J	`jnl`	Hephaestus: Mixture Generative Modeling with Energy Guidance for Large-scale QoS Degradation. CoRR Nguyen Do, Bach Ngo, Youval Kashuv, Canh V. Pham, Hanghang Tong, My T. Thai
2025	—	`conf`	Influence Maximization with Fairness Cost on Groups in Online Social Networks. ACIIDS (2) Hue T. Nguyen, Bac D. Pham, Dung T. K. Ha, Long Giang Nguyen, Canh V. Pham
2025	J	`jnl`	Practical algorithm for minimum cost submodular cover problem with performance guarantees. Optim. Lett. Canh V. Pham, Tan D. Tran, Dung T. K. Ha, Quat V. Phu
2024	J	`jnl`	Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity. Asia Pac. J. Oper. Res. Hue T. Nguyen, Dung T. K. Ha, Canh V. Pham
2024	J	`jnl`	Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity. CoRR Canh V. Pham
2024	A*	`conf`	Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint. IJCAI Tan D. Tran, Canh V. Pham, Dung T. K. Ha, Phuong N. H. Pham
2024	J	`jnl`	Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint. CoRR Tan D. Tran, Canh V. Pham, Dung T. K. Ha, Phuong N. H. Pham
2024	J	`jnl`	Improved approximation algorithms for k-submodular maximization under a knapsack constraint. Comput. Oper. Res. Dung T. K. Ha, Canh V. Pham, Tan D. Tran
2023	J	`jnl`	A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities. Inf. Process. Lett. Canh V. Pham, Dung K. Ha
2023	—	`conf`	Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem. CSoNet Canh V. Pham, Quat V. Phu, Dung T. K. Ha
2023	—	`conf`	Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem. CSoNet Tan D. Tran, Canh V. Pham, Dung P. Trung, Uyen T. Nguyen
2023	A*	`conf`	Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. IJCAI Canh V. Pham, Tan D. Tran, Dung K. T. Ha, My T. Thai
2023	J	`jnl`	Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. CoRR Canh V. Pham, Tan D. Tran, Dung K. T. Ha, My T. Thai
2023	—	`conf`	Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint. SoICT Tan D. Tran, Canh V. Pham, Dung Ha
2023	J	`jnl`	Minimizing cost for influencing target groups in social network: A model and algorithmic approach. Comput. Commun. Phuong N. H. Pham, Canh V. Pham, Hieu V. Duong, Václav Snásel, Trung Thanh Nguyen
2023	—	`conf`	Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint. KSE Dung K. T. Ha, Canh V. Pham, Tan D. Tran, Huan X. Hoang
2023	J	`jnl`	Robust Approximation Algorithms for Non-monotone k-Submodular Maximization under a Knapsack Constraint. CoRR Dung T. K. Ha, Canh V. Pham, Tan D. Tran, Huan X. Hoang
2022	—	`conf`	A Heuristic Algorithm for Student-Project Allocation Problem. CSoNet Nguyen Thi Uyen, Giang L. Nguyen, Canh V. Pham, Tran Xuan Sang, Hoang Huu Viet
2022	B	`conf`	Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint. DSAA Canh V. Pham, Dung K. T. Ha, Huan X. Hoang, Tan D. Tran
2022	J	`jnl`	Maximizing k-submodular functions under budget constraint: applications and streaming algorithms. J. Comb. Optim. Canh V. Pham, Quang C. Vu, Dung K. Ha, Tai T. Nguyen, Nguyen D. Le
2022	J	`jnl`	Minimum budget for misinformation detection in online social networks with provable guarantees. Optim. Lett. Canh V. Pham, Dung V. Pham, Bao Q. Bui, Anh V. Nguyen
2022	J	`jnl`	Submodular Maximization Subject to a Knapsack Constraint Under Noise Models. Asia Pac. J. Oper. Res. Dung K. Ha, Canh V. Pham, Huan X. Hoang
2022	—	`conf`	k-Submodular Cover Problem: Application and Algorithms. SoICT Phuong N. H. Pham, Quy T. N. Co, Anh N. Su, Phuong T. Pham, Canh V. Pham, Václav Snásel
2021	—	`conf`	Efficient Algorithm for Multiple Benefit Thresholds Problem in Online Social Networks. RIVF Phuong N. H. Pham, Bich-Ngan T. Nguyen, Canh V. Pham, Nghia D. Nghia, Václav Snásel
2021	—	`conf`	Groups Influence with Minimum Cost in Social Networks. CSoNet Phuong N. H. Pham, Canh V. Pham, Hieu V. Duong, Trung Thanh Nguyen, My T. Thai
2021	—	`conf`	Streaming Algorithm for Submodular Cover Problem Under Noise. RIVF Bich-Ngan T. Nguyen, Phuong N. H. Pham, Canh V. Pham, Anh N. Su, Václav Snásel
2021	—	`conf`	Streaming Algorithms for Budgeted k-Submodular Maximization Problem. CSoNet Canh V. Pham, Quang C. Vu, Dung K. Ha, Tai T. Nguyen
2021	—	`conf`	Threshold Benefit for Groups Influence in Online Social Networks. FDSE Phuong N. H. Pham, Bich-Ngan T. Nguyen, Quy T. N. Co, Canh V. Pham, Václav Snásel
2020	J	`jnl`	Influence Maximization with Priority in Online Social Networks. Algorithms Canh V. Pham, Dung K. T. Ha, Quang C. Vu, Anh N. Su, Huan X. Hoang
2020	J	`jnl`	Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks. IEEE Access Dung V. Pham, Long Giang Nguyen, Ngoc-Tu Nguyen, Canh V. Pham, Anh V. Nguyen
2019	—	`conf`	Competitive Influence Maximization on Online Social Networks: A Deterministic Modeling Approach. RIVF Canh V. Pham, Nam V. Nguyen, Tuan X. Le, Huan X. Hoang
2019	—	`conf`	Importance Sample-Based Approximation Algorithm for Cost-Aware Targeted Viral Marketing. CSoNet Canh V. Pham, Hieu V. Duong, My T. Thai
2019	J	`jnl`	Importance Sample-based Approximation Algorithm for Cost-aware Targeted Viral Marketing. CoRR Canh V. Pham, Hieu V. Duong, My T. Thai
2019	J	`jnl`	Minimum budget for misinformation blocking in online social networks. J. Comb. Optim. Canh V. Pham, Quat V. Phu, Huan X. Hoang, Jun Pei, My T. Thai
2019	—	`conf`	Multiple Topics Misinformation blocking in Online Social Networks. KSE Dung V. Pham, Hieu V. Duong, Canh V. Pham, Bao Q. Bui, Anh V. Nguyen
2018	—	`conf`	Budgeted Competitive Influence Maximization on Online Social Networks. CSoNet Canh V. Pham, Hieu V. Duong, Bao Q. Bui, My T. Thai
2018	J	`jnl`	Maximizing misinformation restriction within time and budget constraints. J. Comb. Optim. Canh V. Pham, My T. Thai, Hieu V. Duong, Bao Q. Bui, Huan X. Hoang
2018	—	`conf`	Targeted Misinformation Blocking on Online Social Networks. ACIIDS (1) Canh V. Pham, Quat V. Phu, Huan X. Hoang
2017	—	`conf`	Limiting the Spread of Epidemics within Time Constraint on Online Social Networks. SoICT Canh V. Pham, Hoang M. Dinh, Hoa D. Nguyen, Huyen T. Dang, Huan X. Hoang
2016	—	`conf`	A new viral marketing strategy with the competition in the large-scale online social networks. RIVF Canh V. Pham, Dung K. Ha, Dung Q. Ngo, Quang C. Vu, Huan X. Hoang
2016	—	`conf`	Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks. CSoNet Canh V. Pham, My T. Thai, Dung K. Ha, Dung Q. Ngo, Huan X. Hoang
2015	—	`conf`	Preventing and Detecting Infiltration on Online Social Networks. CSoNet Canh V. Pham, Huan X. Hoang, Manh M. Vu