Lecturer
M.S. Viet-Dung Nguyen
M.S. Viet-Dung Nguyen won a silver medal at IOI 2015 and competed in the 46th ICPC World Finals in 2024. He earned his Bachelor's degree from the Korea Advanced Institute of Science and Technology (KAIST) in 2019, then completed a Master's in Data Science and Artificial Intelligence at Hanoi University of Science and Technology in 2022, followed by a Master's in Psychology at the University of Nottingham, United Kingdom, in 2025. His master's thesis, titled "Optimal Deployment of Intelligent Mobile Air Quality Systems," studied sensor placement solutions on buses in Hanoi to maximize air quality monitoring coverage. He is currently focused on research in combinatorial optimization and the application of machine learning to problems such as psychotherapy and air quality monitoring.
Publications:
| No. | Article | Journal/Conference | Year |
| 1 | Constant approximation for opportunistic sensing in mobile air quality monitoring system. | Computer Networks, volume 202, page 108646. Elsevier, 2022. | 2022 |
| 2 | Efficient algorithms for maximum induced matching problem in permutation and trapezoid graphs. | Fundamenta Informaticae, volume 182. Episciences. org, 2021. | 2021 |
| 3 | Cycle time enhancement by simulated annealing for a practical assembly line balancing problem. | Informatica, volume 44, 2020. | 2020 |
| 4 | An (e−1)/(2e−1)-approximation algorithm for maximizing coverage capability in mobile air quality monitoring systems. | 2020 IEEE 19th International Symposium on Network Computing and Applications (NCA), pages 1–4. IEEE | 2020 |
| 5 | A 1/2-approximation algorithm for target coverage problem in mobile air quality monitoring systems. | GLOBECOM 2020-2020 IEEE Global Communications Conference | 2020 |
| 6 | Quadratic time algorithm for maximum induced matching problem in trapezoid graphs. | Proceedings of the 2nd International Conference on Information Science and Systems (ICISS), pages 185–189, 2019 | 2019 |
| 7 | Simulated annealing for the assembly line balancing problem in the garment industry. | Proceedings of the 10th International Symposium on Information and Communication Technology (SOICT), pages 36–42, 2019. | 2019 |
| 8 | A dynamic programming algorithm for the maximum induced matching problem in permutation graphs. | Proceedings of the 9th International Symposium on Information and Communication Technology (SOICT), pages 92–97, 2018. | 2018 |
Trụ sở chính
Học viện cơ sở tại TP. Hồ Chí Minh
Cơ sở đào tạo tại Hà Nội
Cơ sở đào tạo tại TP Hồ Chí Minh
© Copyright 2024 HocVienCongNgheBuuChinhVienThong, All rights reserved ® Học viện Công nghệ Bưu chính Viễn thông giữ bản quyền nội dung trên website này