TRAN DINH TAN
-
M.Sc. (Information Systems, Posts and Telecommunications Institute of Technology, Vietnam, 2020)
-
B.Sc. (Information Technology, People’s Security Academy, Vietnam, 2015)
M.Sc. Tran Dinh Tan is a Lecturer and Researcher at Phenikaa University, appointed in 2024 after nearly a decade of teaching at the People’s Security Academy. His research focuses on submodular optimization, particularly under constraints, contributing to advanced algorithmic strategies for resource allocation in distributed and constrained systems.
He has published widely in top-tier conferences such as IJCAI and IEEE DSAA and journals like Computers & Operations Research and Optimization Letters. Mr. Tan also actively advises student research, capstone projects, and programming activities. In addition to his academic role, he consults for Phenikaa S, focusing on applied AI systems.
RESEARCH INTERESTS
-
Submodular Maximization under Constraints
-
Streaming and Approximation Algorithms
-
Optimization for Resource-Constrained Environments
-
Distributed Data Analytics and Decision Systems
SELECTED PUBLICATIONS
- Pham, C. V., Ha, D. K. T., Hoang, H. X., & Tran, T. D. (2022). Fast streaming algorithms for k-submodular maximization under a knapsack constraint. Proceedings of the 2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA), 1–10. IEEE.
- Pham, C. V., Tran, T. D., Ha, D. T. K., & Thai, M. T. (2023). Linear query approximation algorithms for non-monotone submodular maximization under knapsack constraint. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI), 4127–4135.I
- Ha, D. T. K., Pham, C. V., & Tran, T. D. (2024). Improved approximation algorithms for k-submodular maximization under a knapsack constraint. Computers & Operations Research, 161, 106452.
- Ha, D. T. K., Pham, C. V., Tran, T. D., & Hoang, H. X. (2023). Robust approximation algorithms for non-monotone k-submodular maximization under a knapsack constraint. Proceedings of the 2023 15th International Conference on Knowledge and Systems Engineering (KSE), 1–6. IEEE.
- Tran,, Pham, C., & Ha, D. (2023). Maximizing a k-submodular maximization function under an individual knapsack constraint. Proceedings of the 12th International Symposium on Information and Communication Technology, 56–62.
- Tran, T. D., Pham, C. V., Trung, D. P., & Nguyen, U. T. (2023). Improved streaming algorithm for minimum cost submodular cover problem. In International Conference on Computational Data and Social Networks, 222–233. Springer.
- Tran, T. D., Pham, C. V., Ha, D. T. K., & Pham, P. N. H. (2024). Improved parallel algorithm for non-monotone submodular maximization under knapsack constraint Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI).
- Pham, C. V., Tran, T. D., Ha, D. T. K., & Phu, Q. V. (2025). Practical algorithm for minimum cost submodular cover problem with performance guarantees. Optimization Letters, 1–24. Springer.
PROFESSIONAL CERTIFICATIONS
- Certificate in University Teaching
COURSES TAUGHT
- CSE703024 – Discrete mathematics
- CSE703052 – Algorithms and Complexity
15 Floor, A9 Building
Phenikaa University
Nguyen Van Trac, Yen Nghia
Ha Noi, Viet Nam