preloader
  • Home
  • Pham Van Canh, Ph.D.

Pham Van Canh, Ph.D.

Pham Van Canh, Ph.D.

OR Program Chair
  • Post-Doc (Computer Science, Phenikaa University, 2020-2022)
  • Ph.D. (Computer Science, University of Engineering and Technology, Vietnam National University, Hanoi, Vietnam, 2020)
  • M.Sc. (Computer Science, University of Engineering and Technology, Vietnam National University, Hanoi, Vietnam, 2016)
  • B.Sc. (Information Technology, People’s Security Academy, Vietnam, 2012)
CONTACT:

Pham Van Canh

RESEARCH INTERESTS

  • Combinatorial Optimization
  • Social Network Analysis
  • Approximation Algorithms
  • Optimization in Machine Learning
  • Computational Theory

SELECTED PUBLICATIONS

  • Dung Ha, Canh V. Pham, Huan X. Hoang, “Submodular Maximization Subject to a Knapsack Constraint Under Noise Models”, Asia-Pacific Journal of Operational Research, 2021.
  • Canh V. Pham, Quang C. Vu, Dung K. T. Ha, Tai T. Nguyen, Nguyen D. Le, “Maximizing k-submodular functions under budget constraint: applications and streaming algorithms”, Journal of Combinatorial Optimization, 44, 723–751, 2022.
  • Canh V. Pham, Pham, D.V., Bui, B.Q, Anh V. Nguyen. “Minimum budget for misinformation detection in online social networks with provable guarantees”. Optimization Letters, 16, 515–544.
  • Canh V. Pham, QV Phu, HX Hoang, J Pei, MT Thai. “Minimum budget for misinformation blocking in online social networks”. Journal of Combinatorial Optimization, 2019, 38, 1101–1127.
  • Canh V. Pham, My T Thai, Hieu V Duong, Bao Q Bui, Huan X Hoang. “Maximizing misinformation restriction within time and budget constraints”. Journal of Combinatorial Optimization 35 (4), 1202-1240

AWARDS & HONOURS

  • First prize in Vietnam Mathematics Olympiad for Student, 2011
  • Outstanding youth award of Vietnam National University, 2021

TEACHING COURSES