Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Canh V. Pham
@article{DBLP:journals/cor/HaPT24, author = {Dung T. K. Ha and Canh V. Pham and Tan D. Tran}, title = {Improved approximation algorithms for k-submodular maximization under a knapsack constraint}, journal = {Comput. Oper. Res.}, volume = {161}, pages = {106452}, year = {2024}, url = {https://doi.org/10.1016/j.cor.2023.106452}, doi = {10.1016/J.COR.2023.106452}, timestamp = {Sun, 10 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/HaPT24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comcom/PhamPDSN23, author = {Phuong N. H. Pham and Canh V. Pham and Hieu V. Duong and V{\'{a}}clav Sn{\'{a}}sel and Trung Thanh Nguyen}, title = {Minimizing cost for influencing target groups in social network: {A} model and algorithmic approach}, journal = {Comput. Commun.}, volume = {212}, pages = {182--197}, year = {2023}, url = {https://doi.org/10.1016/j.comcom.2023.09.022}, doi = {10.1016/J.COMCOM.2023.09.022}, timestamp = {Sat, 13 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comcom/PhamPDSN23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/PhamH23, author = {Canh V. Pham and Dung K. Ha}, title = {A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities}, journal = {Inf. Process. Lett.}, volume = {182}, pages = {106393}, year = {2023}, url = {https://doi.org/10.1016/j.ipl.2023.106393}, doi = {10.1016/J.IPL.2023.106393}, timestamp = {Fri, 09 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/PhamH23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csonet/PhamPH23, author = {Canh V. Pham and Quat V. Phu and Dung T. K. Ha}, editor = {Minh Ho{\`{a}}ng H{\`{a}} and Xingquan Zhu and My T. Thai}, title = {Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem}, booktitle = {Computational Data and Social Networks - 12th International Conference, CSoNet 2023, Hanoi, Vietnam, December 11-13, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14479}, pages = {186--197}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-981-97-0669-3\_18}, doi = {10.1007/978-981-97-0669-3\_18}, timestamp = {Mon, 11 Mar 2024 15:20:45 +0100}, biburl = {https://dblp.org/rec/conf/csonet/PhamPH23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csonet/TranPTN23, author = {Tan D. Tran and Canh V. Pham and Dung P. Trung and Uyen T. Nguyen}, editor = {Minh Ho{\`{a}}ng H{\`{a}} and Xingquan Zhu and My T. Thai}, title = {Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem}, booktitle = {Computational Data and Social Networks - 12th International Conference, CSoNet 2023, Hanoi, Vietnam, December 11-13, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14479}, pages = {222--233}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-981-97-0669-3\_21}, doi = {10.1007/978-981-97-0669-3\_21}, timestamp = {Mon, 11 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/csonet/TranPTN23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/PhamT0T23, author = {Canh V. Pham and Tan D. Tran and Dung K. T. Ha and My T. Thai}, title = {Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint}, booktitle = {Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao, SAR, China}, pages = {4127--4135}, publisher = {ijcai.org}, year = {2023}, url = {https://doi.org/10.24963/ijcai.2023/459}, doi = {10.24963/IJCAI.2023/459}, timestamp = {Thu, 08 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ijcai/PhamT0T23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/kse/HaPTH23, author = {Dung K. T. Ha and Canh V. Pham and Tan D. Tran and Huan X. Hoang}, editor = {Huynh Thi Thanh Binh and Van{-}Thuc Hoang and Le{-}Minh Nguyen and SyVinh Le and Thi{-}Dao Vu and Duy Trung Pham}, title = {Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint}, booktitle = {15th International Conference on Knowledge and Systems Engineering, {KSE} 2023, Hanoi, Vietnam, October 18-20, 2023}, pages = {1--6}, publisher = {{IEEE}}, year = {2023}, url = {https://doi.org/10.1109/KSE59128.2023.10299445}, doi = {10.1109/KSE59128.2023.10299445}, timestamp = {Tue, 21 Nov 2023 22:37:01 +0100}, biburl = {https://dblp.org/rec/conf/kse/HaPTH23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soict/TranPH23, author = {Tan D. Tran and Canh V. Pham and Dung Ha}, title = {Maximizing a {\textdollar}k{\textdollar}-Submodular Maximization Function under an Individual Knapsack Constraint}, booktitle = {Proceedings of the 12th International Symposium on Information and Communication Technology, {SOICT} 2023, Ho Chi Minh, Vietnam, December 7-8, 2023}, pages = {56--62}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3628797.3628843}, doi = {10.1145/3628797.3628843}, timestamp = {Wed, 27 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soict/TranPH23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2305-10292, author = {Canh V. Pham and Tan D. Tran and Dung K. T. Ha and My T. Thai}, title = {Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint}, journal = {CoRR}, volume = {abs/2305.10292}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.10292}, doi = {10.48550/ARXIV.2305.10292}, eprinttype = {arXiv}, eprint = {2305.10292}, timestamp = {Thu, 25 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-10292.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2309-12025, author = {Dung T. K. Ha and Canh V. Pham and Tan D. Tran and Huan X. Hoang}, title = {Robust Approximation Algorithms for Non-monotone k-Submodular Maximization under a Knapsack Constraint}, journal = {CoRR}, volume = {abs/2309.12025}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2309.12025}, doi = {10.48550/ARXIV.2309.12025}, eprinttype = {arXiv}, eprint = {2309.12025}, timestamp = {Mon, 25 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2309-12025.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apjor/HaPH22, author = {Dung K. Ha and Canh V. Pham and Huan X. Hoang}, title = {Submodular Maximization Subject to a Knapsack Constraint Under Noise Models}, journal = {Asia Pac. J. Oper. Res.}, volume = {39}, number = {6}, pages = {2250013:1--2250013:26}, year = {2022}, url = {https://doi.org/10.1142/S0217595922500130}, doi = {10.1142/S0217595922500130}, timestamp = {Thu, 20 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/apjor/HaPH22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/PhamVHNL22, author = {Canh V. Pham and Quang C. Vu and Dung K. Ha and Tai T. Nguyen and Nguyen D. Le}, title = {Maximizing k-submodular functions under budget constraint: applications and streaming algorithms}, journal = {J. Comb. Optim.}, volume = {44}, number = {1}, pages = {723--751}, year = {2022}, url = {https://doi.org/10.1007/s10878-022-00858-x}, doi = {10.1007/S10878-022-00858-X}, timestamp = {Thu, 04 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/PhamVHNL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ol/PhamPBN22, author = {Canh V. Pham and Dung V. Pham and Bao Q. Bui and Anh V. Nguyen}, title = {Minimum budget for misinformation detection in online social networks with provable guarantees}, journal = {Optim. Lett.}, volume = {16}, number = {2}, pages = {515--544}, year = {2022}, url = {https://doi.org/10.1007/s11590-021-01733-0}, doi = {10.1007/S11590-021-01733-0}, timestamp = {Fri, 25 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ol/PhamPBN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csonet/UyenNPSV22, author = {Nguyen Thi Uyen and Giang L. Nguyen and Canh V. Pham and Tran Xuan Sang and Hoang Huu Viet}, editor = {Thang N. Dinh and Minming Li}, title = {A Heuristic Algorithm for Student-Project Allocation Problem}, booktitle = {Computational Data and Social Networks - 11th International Conference, CSoNet 2022, Virtual Event, December 5-7, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13831}, pages = {280--291}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-26303-3\_25}, doi = {10.1007/978-3-031-26303-3\_25}, timestamp = {Thu, 16 Feb 2023 11:51:10 +0100}, biburl = {https://dblp.org/rec/conf/csonet/UyenNPSV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dsaa/PhamHHT22, author = {Canh V. Pham and Dung K. T. Ha and Huan X. Hoang and Tan D. Tran}, editor = {Joshua Zhexue Huang and Yi Pan and Barbara Hammer and Muhammad Khurram Khan and Xing Xie and Laizhong Cui and Yulin He}, title = {Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint}, booktitle = {9th {IEEE} International Conference on Data Science and Advanced Analytics, {DSAA} 2022, Shenzhen, China, October 13-16, 2022}, pages = {1--10}, publisher = {{IEEE}}, year = {2022}, url = {https://doi.org/10.1109/DSAA54385.2022.10032383}, doi = {10.1109/DSAA54385.2022.10032383}, timestamp = {Fri, 17 Feb 2023 18:27:26 +0100}, biburl = {https://dblp.org/rec/conf/dsaa/PhamHHT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soict/PhamCSPPS22, author = {Phuong N. H. Pham and Quy T. N. Co and Anh N. Su and Phuong T. Pham and Canh V. Pham and V{\'{a}}clav Sn{\'{a}}sel}, title = {k-Submodular Cover Problem: Application and Algorithms}, booktitle = {The 11th International Symposium on Information and Communication Technology, SoICT 2022, Hanoi, Vietnam, December 1-3, 2022}, pages = {442--449}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3568562.3568668}, doi = {10.1145/3568562.3568668}, timestamp = {Wed, 30 Nov 2022 15:53:29 +0100}, biburl = {https://dblp.org/rec/conf/soict/PhamCSPPS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csonet/PhamVHN21, author = {Canh V. Pham and Quang C. Vu and Dung K. Ha and Tai T. Nguyen}, editor = {David Mohaisen and Ruoming Jin}, title = {Streaming Algorithms for Budgeted k-Submodular Maximization Problem}, booktitle = {Computational Data and Social Networks - 10th International Conference, CSoNet 2021, Virtual Event, November 15-17, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13116}, pages = {27--38}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-91434-9\_3}, doi = {10.1007/978-3-030-91434-9\_3}, timestamp = {Thu, 09 Dec 2021 16:14:30 +0100}, biburl = {https://dblp.org/rec/conf/csonet/PhamVHN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csonet/PhamPDNT21, author = {Phuong N. H. Pham and Canh V. Pham and Hieu V. Duong and Trung Thanh Nguyen and My T. Thai}, editor = {David Mohaisen and Ruoming Jin}, title = {Groups Influence with Minimum Cost in Social Networks}, booktitle = {Computational Data and Social Networks - 10th International Conference, CSoNet 2021, Virtual Event, November 15-17, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13116}, pages = {231--242}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-91434-9\_21}, doi = {10.1007/978-3-030-91434-9\_21}, timestamp = {Tue, 12 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/csonet/PhamPDNT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fdse/PhamNCPS21, author = {Phuong N. H. Pham and Bich{-}Ngan T. Nguyen and Quy T. N. Co and Canh V. Pham and V{\'{a}}clav Sn{\'{a}}sel}, editor = {Tran Khanh Dang and Josef K{\"{u}}ng and Tai M. Chung and Makoto Takizawa}, title = {Threshold Benefit for Groups Influence in Online Social Networks}, booktitle = {Future Data and Security Engineering - 8th International Conference, {FDSE} 2021, Virtual Event, November 24-26, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13076}, pages = {53--67}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-91387-8\_4}, doi = {10.1007/978-3-030-91387-8\_4}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fdse/PhamNCPS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/rivf/NguyenPPSS21, author = {Bich{-}Ngan T. Nguyen and Phuong N. H. Pham and Canh V. Pham and Anh N. Su and V{\'{a}}clav Sn{\'{a}}sel}, title = {Streaming Algorithm for Submodular Cover Problem Under Noise}, booktitle = {{RIVF} International Conference on Computing and Communication Technologies, {RIVF} 2021, Hanoi, Vietnam, August 19-21, 2021}, pages = {1--6}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.1109/RIVF51545.2021.9642118}, doi = {10.1109/RIVF51545.2021.9642118}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/rivf/NguyenPPSS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/rivf/PhamNPNS21, author = {Phuong N. H. Pham and Bich{-}Ngan T. Nguyen and Canh V. Pham and Nghia D. Nghia and V{\'{a}}clav Sn{\'{a}}sel}, title = {Efficient Algorithm for Multiple Benefit Thresholds Problem in Online Social Networks}, booktitle = {{RIVF} International Conference on Computing and Communication Technologies, {RIVF} 2021, Hanoi, Vietnam, August 19-21, 2021}, pages = {1--6}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.1109/RIVF51545.2021.9642099}, doi = {10.1109/RIVF51545.2021.9642099}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/rivf/PhamNPNS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/access/PhamNNPN20, author = {Dung V. Pham and Long Giang Nguyen and Ngoc{-}Tu Nguyen and Canh V. Pham and Anh V. Nguyen}, title = {Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks}, journal = {{IEEE} Access}, volume = {8}, pages = {78879--78889}, year = {2020}, url = {https://doi.org/10.1109/ACCESS.2020.2989140}, doi = {10.1109/ACCESS.2020.2989140}, timestamp = {Wed, 15 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/access/PhamNNPN20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithms/PhamHVSH20, author = {Canh V. Pham and Dung K. T. Ha and Quang C. Vu and Anh N. Su and Huan X. Hoang}, title = {Influence Maximization with Priority in Online Social Networks}, journal = {Algorithms}, volume = {13}, number = {8}, pages = {183}, year = {2020}, url = {https://doi.org/10.3390/a13080183}, doi = {10.3390/A13080183}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithms/PhamHVSH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/PhamPHPT19, author = {Canh V. Pham and Quat V. Phu and Huan X. Hoang and Jun Pei and My T. Thai}, title = {Minimum budget for misinformation blocking in online social networks}, journal = {J. Comb. Optim.}, volume = {38}, number = {4}, pages = {1101--1127}, year = {2019}, url = {https://doi.org/10.1007/s10878-019-00439-5}, doi = {10.1007/S10878-019-00439-5}, timestamp = {Thu, 07 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/PhamPHPT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csonet/PhamDT19, author = {Canh V. Pham and Hieu V. Duong and My T. Thai}, editor = {Andrea Tagarelli and Hanghang Tong}, title = {Importance Sample-Based Approximation Algorithm for Cost-Aware Targeted Viral Marketing}, booktitle = {Computational Data and Social Networks - 8th International Conference, CSoNet 2019, Ho Chi Minh City, Vietnam, November 18-20, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11917}, pages = {120--132}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-34980-6\_14}, doi = {10.1007/978-3-030-34980-6\_14}, timestamp = {Wed, 13 Nov 2019 15:17:33 +0100}, biburl = {https://dblp.org/rec/conf/csonet/PhamDT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/kse/PhamDPBN19, author = {Dung V. Pham and Hieu V. Duong and Canh V. Pham and Bao Q. Bui and Anh V. Nguyen}, title = {Multiple Topics Misinformation blocking in Online Social Networks}, booktitle = {11th International Conference on Knowledge and Systems Engineering, {KSE} 2019, Da Nang, Vietnam, October 24-26, 2019}, pages = {1--6}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/KSE.2019.8919356}, doi = {10.1109/KSE.2019.8919356}, timestamp = {Thu, 30 Jan 2020 15:40:00 +0100}, biburl = {https://dblp.org/rec/conf/kse/PhamDPBN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/rivf/PhamNLH19, author = {Canh V. Pham and Nam V. Nguyen and Tuan X. Le and Huan X. Hoang}, title = {Competitive Influence Maximization on Online Social Networks: {A} Deterministic Modeling Approach}, booktitle = {2019 {IEEE-RIVF} International Conference on Computing and Communication Technologies, {RIVF} 2019, Danang, Vietnam, March 20-22, 2019}, pages = {1--6}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/RIVF.2019.8713676}, doi = {10.1109/RIVF.2019.8713676}, timestamp = {Wed, 16 Oct 2019 14:14:52 +0200}, biburl = {https://dblp.org/rec/conf/rivf/PhamNLH19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1910-04134, author = {Canh V. Pham and Hieu V. Duong and My T. Thai}, title = {Importance Sample-based Approximation Algorithm for Cost-aware Targeted Viral Marketing}, journal = {CoRR}, volume = {abs/1910.04134}, year = {2019}, url = {http://arxiv.org/abs/1910.04134}, eprinttype = {arXiv}, eprint = {1910.04134}, timestamp = {Wed, 16 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1910-04134.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/PhamTDBH18, author = {Canh V. Pham and My T. Thai and Hieu V. Duong and Bao Q. Bui and Huan X. Hoang}, title = {Maximizing misinformation restriction within time and budget constraints}, journal = {J. Comb. Optim.}, volume = {35}, number = {4}, pages = {1202--1240}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0252-3}, doi = {10.1007/S10878-018-0252-3}, timestamp = {Tue, 03 Apr 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/PhamTDBH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aciids/PhamPH18, author = {Canh V. Pham and Quat V. Phu and Huan X. Hoang}, editor = {Ngoc Thanh Nguyen and Duong Hung Hoang and Tzung{-}Pei Hong and Hoang Pham and Bogdan Trawinski}, title = {Targeted Misinformation Blocking on Online Social Networks}, booktitle = {Intelligent Information and Database Systems - 10th Asian Conference, {ACIIDS} 2018, Dong Hoi City, Vietnam, March 19-21, 2018, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {10751}, pages = {107--116}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-75417-8\_10}, doi = {10.1007/978-3-319-75417-8\_10}, timestamp = {Thu, 16 Mar 2023 20:00:29 +0100}, biburl = {https://dblp.org/rec/conf/aciids/PhamPH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csonet/PhamDBT18, author = {Canh V. Pham and Hieu V. Duong and Bao Q. Bui and My T. Thai}, editor = {Xuemin Chen and Arunabha Sen and Wei Wayne Li and My T. Thai}, title = {Budgeted Competitive Influence Maximization on Online Social Networks}, booktitle = {Computational Data and Social Networks - 7th International Conference, CSoNet 2018, Shanghai, China, December 18-20, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11280}, pages = {13--24}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-04648-4\_2}, doi = {10.1007/978-3-030-04648-4\_2}, timestamp = {Mon, 16 Sep 2019 15:24:23 +0200}, biburl = {https://dblp.org/rec/conf/csonet/PhamDBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soict/PhamDNDH17, author = {Canh V. Pham and Hoang M. Dinh and Hoa D. Nguyen and Huyen T. Dang and Huan X. Hoang}, title = {Limiting the Spread of Epidemics within Time Constraint on Online Social Networks}, booktitle = {Proceedings of the Eighth International Symposium on Information and Communication Technology, Nha Trang City, Viet Nam, December 7-8, 2017}, pages = {262--269}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3155133.3155157}, doi = {10.1145/3155133.3155157}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soict/PhamDNDH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csonet/PhamTHNH16, author = {Canh V. Pham and My T. Thai and Dung K. Ha and Dung Q. Ngo and Huan X. Hoang}, editor = {Hien T. Nguyen and V{\'{a}}clav Sn{\'{a}}sel}, title = {Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks}, booktitle = {Computational Social Networks - 5th International Conference, CSoNet 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9795}, pages = {111--122}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-42345-6\_10}, doi = {10.1007/978-3-319-42345-6\_10}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/csonet/PhamTHNH16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/rivf/PhamHNVH16, author = {Canh V. Pham and Dung K. Ha and Dung Q. Ngo and Quang C. Vu and Huan X. Hoang}, editor = {Tru Cao and Yo{-}Sung Ho}, title = {A new viral marketing strategy with the competition in the large-scale online social networks}, booktitle = {2016 {IEEE} {RIVF} International Conference on Computing {\&} Communication Technologies, Research, Innovation, and Vision for the Future, {RIVF} 2016, Hanoi, Vietnam, November 7-9, 2016}, pages = {1--6}, publisher = {{IEEE}}, year = {2016}, url = {https://doi.org/10.1109/RIVF.2016.7800260}, doi = {10.1109/RIVF.2016.7800260}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/rivf/PhamHNVH16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csonet/PhamHV15, author = {Canh V. Pham and Huan X. Hoang and Manh M. Vu}, editor = {My T. Thai and Nam P. Nguyen and Huawei Shen}, title = {Preventing and Detecting Infiltration on Online Social Networks}, booktitle = {Computational Social Networks - 4th International Conference, CSoNet 2015, Beijing, China, August 4-6, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9197}, pages = {60--73}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-21786-4\_6}, doi = {10.1007/978-3-319-21786-4\_6}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/csonet/PhamHV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.