-: Lecturer, Department of Mathematics Education,  School of Education, Can Tho University, Viet Nam

Academic Degrees

: PhD in 

: Master in 

: Bachelor in 

Research interest

Computer Algebra

Combinatorial Optimization


Cited by
The inverse k-max combinatorial optimization problem
THN Nhan, KT Nguyen, NT Hung, NT Toan
Yugoslav Journal of Operations Research, 37-37
A linear time algorithm for connected p-centdian problem on block graphs
KT Nguyen, WC Teh, NT Hung, H Nguyen-Thu
Theoretical Computer Science 923, 318-326
1 2022
The connected -median problem on complete multi-layered graphs
KT Nguyen, THN Nhan, WC Teh, NT Hung
Discrete Mathematics, Algorithms and Applications 14 (03), 2150118
2 2022
The minmax regret inverse maximum weight problem
KT Nguyen, NT Hung
Applied Mathematics and Computation 407, 126328
1 2021
The reverse total weighted distance problem on networks with variable edge lengths
KT Nguyen, NT Hung
Filomat 35 (4), 1333-1342
Computational aspects of the inverse single facility location problem on trees under lk-norm
KT Nguyen, NT Hung
Theoretical Computer Science 844, 133-141
A linear time algorithm for the p-maxian problem on trees with distance constraint
TK Nguyen, NT Hung, H Nguyen-Thu
Journal of Combinatorial Optimization 40 (4), 1030-1043
1 2020
The inverse connected p-median problem on block graphs under various cost functions
KT Nguyen, NT Hung
Annals of Operations Research 292 (1), 97-112
7 2020
Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
KT Nguyen, H Nguyen-Thu, NT Hung
Acta Mathematica Vietnamica 44, 813-831
5 2019
On some inverse 1-center location problems
KT Nguyen, NT Hung, H Nguyen-Thu, TT Le, VH Pham
Optimization 68 (5), 999-1015
10 2019
On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
KT Nguyen, H Nguyen-Thu, NT Hung
Mathematical Methods of Operations Research 88, 147-159
12 2018
Combinations of Boolean Gröbner bases and SAT solvers
TH Nguyen
Technische Universität Kaiserslautern
6 2014
Improving Gröbner-based Clause Learning for SAT Solving Industrial-sized Boolean Problems
TH Nguyen, A Dreyer
Young Researcher Symposium (YRS) 2013, 72
3 2013
Improving Clause Learning of SAT Solver for Crypto System
TH Nguyen, A Dreyer



School of Education -  Can Tho University.

Address: Campus II, Can Tho University, 3/2 Street, Ninh Kieu District, Can Tho City, Viet Nam.

Phone number & Fax: +84.292.3830261.