• Awarded Bronze Medal, 15^th International Olympiad in Informatics, Wisconsin, US, 2003
• Certificate of merit, Vietnam Youth Union Central Committee on Information Technology Development in Rural Area, 2004
• Best Paper Award, Scientific Research Contest, College of Technology, Vietnam National University, Hanoi, 2005 and 2006
• Microsoft Scholarship, Awarded by Bill Gates for Top Ten Outstanding Vietnamese Students in Computer Science, 2006
• Distinguished Academic Achievement Award, Vietnam National University, 2007
• The Honda Young Engineer and Scientist Award, Honda Foundation and The National Institute for Science and Technology, 2007
• Alumni Fellowship Award, CISE Department, University of Florida, 2008

Community structure is defined as a subgraph such that there is a higher density of edges within the subgraph than between them. This has applications in many domains, not only in computer networks, but also in computational biology, social research, life sciences and physics. Being able to identify these communities could help us to understand and exploit the networks more effectively. It also helps to reveal the hidden structure of complex networks. In addition, community structure can be used as a graph-based model to present the relationship of concepts in different domains or to identify the virtual organization.

Objectives: Develop mathematical models and efficient approximation algorithms to determine the community structure of a given network; handle the dynamic and evolution of community structures; develop a weighted directed graph-based model to better represent the network and its properties, such as context-dependent dynamic relationship.

Dynamic network analysis is an emergent scientific field that brings together traditional social network analysis (SNA), link analysis (LA) and multi-agent systems (MAS). There are two aspects of this field. The first is the statistical analysis of DNA data.

Objective: Develope algorithms to analyze large and dynamic networks like World Wide Web Networks, Network of collaboration, .etc

1. Thang N. Dinh, Vinh S. Le, Huan X. Hoang, A Fast Algorithm for Genome Pairwise Alignment with Rearrangements, In Proceedings of KLLBI Workshop in the 10^th Pacific Rim International Conference on Artificial Intelligence (PRICAI-08), Hanoi 2008 [PDF]
2. Thang N. Dinh, Pairwise Genome Alignment with Rearrangemnents in Minutes, Graduation Thesis, 2007 [PDF]
3. Thang N. Dinh, Nguyen H. Pham, An approach to Vietnamese Spelling Check, In Proceedings National Informatics Conference, Dalat, 2006 (In Vietnamese)
4. Nguyen H. Pham, Yen H. Le, Thang N. Dinh, Diep H. Thi, Evaluation of Vietnamese Word Segmentation Methods, In Proceedings of National Informatics Conference, Haiphong, 2005 (In Vietnamese)

• TA, CGS 2531, Problem Solving Using Computer Software, University of Florida, 2008
• TA, Introduction to Bioinformatics, College of Technology, Vietnam National University, 2008
• Train, Data Structure and Algorithms, Training Vietnamese Team for International Olympiad in Informatics (IOI)

• "I can resist anything but temptation." - Oscar Wilde
• "You Ain't Gonna Need It"
• "Stay hungry, stay foolish" - Steve Jobs
• "Only two things are infinite, the universe and human stupidity, and I'm not sure about the former." - Albert Einstein
• “We cannot change the cards we are dealt, just how we play the hand.” - Randy Pausch
• "We can only see a short distance ahead, but we can see plenty there that needs to be done." - Alan Turing
• "I never did a day's work in my life. It was all fun". - Thomas A. Edison

• Alumni Representative Committee, High School for Gifted Students, Vietnam National University, 2005 - Present
• FPT Centre for Young Talents 2003 – 2005

• Advice to a Beginning Graduate Student, by Professor Manuel Blum
• MIT Open Courseware - Electrical Engineering and Computer Science
• The last lecture: Randy Pausch: Achieving Your Childhood Dreams (Video on Youtube)