default search action
Canh V. Pham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j12]Bich-Ngan T. Nguyen
, Phuong N. H. Pham
Fast bicriteria streaming algorithms for submodular cover problem under noise models. Comput. Stand. Interfaces 91: 103883 (2025) - [j11]Canh V. Pham
Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity. J. Comb. Optim. 49(1): 2 (2025) - 2024
- [j10]Dung T. K. Ha
Improved approximation algorithms for k-submodular maximization under a knapsack constraint. Comput. Oper. Res. 161: 106452 (2024) - [c23]Tan D. Tran, Canh V. Pham, Dung T. K. Ha, Phuong N. H. Pham:
Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint. IJCAI 2024: 1961-1969 - [i5]Canh V. Pham:
Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity. CoRR abs/2405.12252 (2024) - [i4]Tan D. Tran, Canh V. Pham, Dung T. K. Ha, Phuong N. H. Pham:
Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint. CoRR abs/2409.04415 (2024) - 2023
- [j9]Phuong N. H. Pham
Minimizing cost for influencing target groups in social network: A model and algorithmic approach. Comput. Commun. 212: 182-197 (2023) - [j8]Canh V. Pham, Dung K. Ha:
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities. Inf. Process. Lett. 182: 106393 (2023) - [c22]Canh V. Pham, Quat V. Phu, Dung T. K. Ha:
Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem. CSoNet 2023: 186-197 - [c21]Tan D. Tran, Canh V. Pham, Dung P. Trung, Uyen T. Nguyen:
Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem. CSoNet 2023: 222-233 - [c20]Canh V. Pham, Tan D. Tran, Dung K. T. Ha, My T. Thai:
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. IJCAI 2023: 4127-4135 - [c19]Dung K. T. Ha, Canh V. Pham, Tan D. Tran, Huan X. Hoang:
Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint. KSE 2023: 1-6 - [c18]Tan D. Tran
Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint. SoICT 2023: 56-62 - [i3]Canh V. Pham, Tan D. Tran, Dung K. T. Ha, My T. Thai:
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. CoRR abs/2305.10292 (2023) - [i2]Dung T. K. Ha, Canh V. Pham, Tan D. Tran, Huan X. Hoang:
Robust Approximation Algorithms for Non-monotone k-Submodular Maximization under a Knapsack Constraint. CoRR abs/2309.12025 (2023) - 2022
- [j7]Dung K. Ha, Canh V. Pham, Huan X. Hoang:
Submodular Maximization Subject to a Knapsack Constraint Under Noise Models. Asia Pac. J. Oper. Res. 39(6): 2250013:1-2250013:26 (2022) - [j6]Canh V. Pham, Quang C. Vu, Dung K. Ha, Tai T. Nguyen, Nguyen D. Le:
Maximizing k-submodular functions under budget constraint: applications and streaming algorithms. J. Comb. Optim. 44(1): 723-751 (2022) - [j5]Canh V. Pham, Dung V. Pham, Bao Q. Bui, Anh V. Nguyen:
Minimum budget for misinformation detection in online social networks with provable guarantees. Optim. Lett. 16(2): 515-544 (2022) - [c17]Nguyen Thi Uyen, Giang L. Nguyen, Canh V. Pham, Tran Xuan Sang, Hoang Huu Viet:
A Heuristic Algorithm for Student-Project Allocation Problem. CSoNet 2022: 280-291 - [c16]Canh V. Pham, Dung K. T. Ha, Huan X. Hoang, Tan D. Tran:
Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint. DSAA 2022: 1-10 - [c15]Phuong N. H. Pham, Quy T. N. Co, Anh N. Su, Phuong T. Pham, Canh V. Pham, Václav Snásel:
k-Submodular Cover Problem: Application and Algorithms. SoICT 2022: 442-449 - 2021
- [c14]Canh V. Pham, Quang C. Vu, Dung K. Ha, Tai T. Nguyen:
Streaming Algorithms for Budgeted k-Submodular Maximization Problem. CSoNet 2021: 27-38 - [c13]Phuong N. H. Pham
Groups Influence with Minimum Cost in Social Networks. CSoNet 2021: 231-242 - [c12]Phuong N. H. Pham
Threshold Benefit for Groups Influence in Online Social Networks. FDSE 2021: 53-67 - [c11]Bich-Ngan T. Nguyen
Streaming Algorithm for Submodular Cover Problem Under Noise. RIVF 2021: 1-6 - [c10]Phuong N. H. Pham
Efficient Algorithm for Multiple Benefit Thresholds Problem in Online Social Networks. RIVF 2021: 1-6 - 2020
- [j4]Dung V. Pham, Long Giang Nguyen
Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks. IEEE Access 8: 78879-78889 (2020) - [j3]Canh V. Pham, Dung K. T. Ha, Quang C. Vu, Anh N. Su, Huan X. Hoang:
Influence Maximization with Priority in Online Social Networks. Algorithms 13(8): 183 (2020)
2010 – 2019
- 2019
- [j2]Canh V. Pham, Quat V. Phu, Huan X. Hoang, Jun Pei, My T. Thai
Minimum budget for misinformation blocking in online social networks. J. Comb. Optim. 38(4): 1101-1127 (2019) - [c9]Canh V. Pham, Hieu V. Duong, My T. Thai:
Importance Sample-Based Approximation Algorithm for Cost-Aware Targeted Viral Marketing. CSoNet 2019: 120-132 - [c8]Dung V. Pham, Hieu V. Duong, Canh V. Pham, Bao Q. Bui, Anh V. Nguyen:
Multiple Topics Misinformation blocking in Online Social Networks. KSE 2019: 1-6 - [c7]Canh V. Pham, Nam V. Nguyen, Tuan X. Le, Huan X. Hoang:
Competitive Influence Maximization on Online Social Networks: A Deterministic Modeling Approach. RIVF 2019: 1-6 - [i1]Canh V. Pham, Hieu V. Duong, My T. Thai:
Importance Sample-based Approximation Algorithm for Cost-aware Targeted Viral Marketing. CoRR abs/1910.04134 (2019) - 2018
- [j1]Canh V. Pham, My T. Thai, Hieu V. Duong, Bao Q. Bui, Huan X. Hoang:
Maximizing misinformation restriction within time and budget constraints. J. Comb. Optim. 35(4): 1202-1240 (2018) - [c6]Canh V. Pham, Quat V. Phu, Huan X. Hoang:
Targeted Misinformation Blocking on Online Social Networks. ACIIDS (1) 2018: 107-116 - [c5]Canh V. Pham, Hieu V. Duong, Bao Q. Bui, My T. Thai:
Budgeted Competitive Influence Maximization on Online Social Networks. CSoNet 2018: 13-24 - 2017
- [c4]Canh V. Pham, Hoang M. Dinh, Hoa D. Nguyen, Huyen T. Dang, Huan X. Hoang:
Limiting the Spread of Epidemics within Time Constraint on Online Social Networks. SoICT 2017: 262-269 - 2016
- [c3]Canh V. Pham, My T. Thai, Dung K. Ha, Dung Q. Ngo, Huan X. Hoang:
Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks. CSoNet 2016: 111-122 - [c2]Canh V. Pham, Dung K. Ha, Dung Q. Ngo, Quang C. Vu, Huan X. Hoang:
A new viral marketing strategy with the competition in the large-scale online social networks. RIVF 2016: 1-6 - 2015
- [c1]Canh V. Pham, Huan X. Hoang, Manh M. Vu:
Preventing and Detecting Infiltration on Online Social Networks. CSoNet 2015: 60-73
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: