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

CoCommunication networks play a vital role in the day-to-day routine of all sectors of our society. Unfortunately, these systems are often greatly affected by several uncertain factors, including external natural or man-made interferences (e.g., severe weather and enemy/malicious attacks.) The failure of a few key nodes that play a vital role in maintaining the network’s connectivity can break down its operation.

• Finding the set of disruptors who play a key role in maintaining the network connectivity, thus it can serve as a fundamental framework for the design of network topology, network vulnerability and reliability.
• Investigate what role the power-law distribution plays in the complexity and approximation of solutions

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.  We focuses on complex, dynamic, and evolving over time, yet often greatly affected by uncertain factors, which may arise in many forms, including natural or man-made interferences. 

• Develop mathematical models and efficient approximation algorithms to determine the community structure of a given network;
• Handle the dynamic and evolution of community structures; provide a mathematical framework for several existing problems in dynamic networks such as routing protocols in DTN and MANETs, network design and management.

Social network applications on Facebook, MySpace, Bebo, etc. are excellent examples of viral marketing. The spreading of an application starts with one user installing the application, then the application sends ‘Invitations’ to all friends of the user. Furthermore, for every activity of the application the application will notify friends with a mini-story or feed. In turn, friends of the users get curious about the application, install it and continue the exponentially viral growing process. The more initial users selected, the faster the application will spread through the network. However, due to limits on resources companies often want to target a small group of the most influential users so that after a chain-reaction of influence the company can reach to users in the whole network or a
sesegment of the network.

• Investigate how vulnerability propagates under different diffusion models based on network structures.
• Investigate Cascading Failures in Power Grids and how to efficiently isolate failures inside communities/clusters.

1. T. N. Dinh, M. T. Thai, and D. T. Nguyen, A Unified Approach for Domination Problems on Different Network Topologies, Handbook of Combinatorial Optimization, (P. Pardalos, D. Du, and R. Graham eds), Springer Publisher



2. M. T. Thai, T. N. Dinh, and Y. Shen, Hardness and Approximation of Network Vulnerability, Handbook of Combinatorial Optimization, (P. Pardalos, D. Du, and R. Graham eds), Springer Publisher



3. T. N. Dinh, I. Shin, N. K. Thai, M. T. Thai, and T. Znati, A General Approach for Modules Identification in Evolving Networks, Dynamics of Information Systems: Theory and Applications, (M. Hirsh, P. Pardalos, and R. Murphey eds), Springer Publisher, 2010.

4. T. N. Dinh, D. T. Nguyen, M. T. Thai, Cheap, Easy, and Massively Effective Viral Marketing in Social Networks: Truth or Fiction?. in Proceedings of the ACM Hypertext and Social Media Conference (Hypertext), 2012.



5. T. N. Dinh, Y. Xuan, M. T. Thai, and P. M. Pardalos, On New Approaches of Assessing Network Vulnerability: Hardness and Approximation. IEEE/ ACM Transactions on Networking (ToN), (DOI:10.1109/TNET.2011.2170849), 2011. [PDF]



6. R. Tiwari, T. N. Dinh, and M. T. Thai, On Centralized and Localized approximation algo- rithms for Interference-Aware Broadcast Scheduling, IEEE Transaction on Mobile Computing (TMC), (to appear), 2011.
   


7. T. N. Dinh and M. T. Thai, Precise Structural Vulnerability Assessment Via Mathematical Programming, in Proceedings of the IEEE Military Communications Conference, (MILCOM) 2011.
   
   
8. N. P. Nguyen, T. N. Dinh, D. T. Nguyen and M. T. Thai, Overlapping Community Struc- tures and Their Detection on Social Networks, in Proceedings of the 3rd IEEE International Conference on Social Computing (SOCIALCOM) 2011.



9. T. N. Dinh and M. T. Thai, Finding Community Structure with Performance Guarantees in Complex Networks, in Proceedings of the 3rd IEEE International Conference on Social Computing (SOCIALCOM) 2011.



10. N. P. Nguyen, T. N. Dinh, S. Tokala, and M. T. Thai, Overlapping Communities in Dynamic Networks: Their Detection and Mobile Applications, in Proceedings of the 17th Annual Inter- national Conference on Mobile Computing and Networking (MOBICOM) 2011.



11. N. P. Nguyen, T. N. Dinh, Y. Xuan, M. T. Thai, Adaptive Algorithms for Detecting Community Structure in Dynamic Social Networks, in Proceedings of the IEEE Conference on Computer Communications (INFOCOM), 2011.



12. Ferhat Ay-Thang N. Dinh, My T. Thai, T. Kahveci, Identification of Dynamic Modules in Biological Regulatory Networks, 10th IEEE International Conference on Bioinformatics & Bioengineering (BIBE), 2010 (Co-first author)



13. T. N. Dinh, Y. Xuan, M. T. Thai, E. K. Park, and T. Znati, On Approximation of New Optimization Methods for Assessing Network Vulnerability, in Proceedings of the IEEE Conference on Computer Communications (INFOCOM), 2010.



14. Thang N. Dinh, Ying Xuan, and My T. Thai, Towards Social-aware Routing in Dynamic Communication Networks, in Proceedings of the 28th IEEE International Performance Computing and Communications Conference(IPCCC), 2009.



15. R. Tiwari, T. N. Dinh, anh M. T. Thai, On Approximation Algoirthms for Interfence-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor Networks, in Proceedings of Int. Conf. on Wireless Algorithms, Systems and Applications(WASA) 2009. [PDF]



16. T. N. Dinh, V. S. Le, and H. 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]

• T. N. Dinh, M. T. Thai, An Exact Approach and Bounding Techniques for Network Vulnerability Assessment, Technical Report , 2011. [PDF]


• T. N. Dinh, N. H. Pham, An approach to Vietnamese Spelling Check, In Proceedings National Informatics Conference, Dalat, 2006
  
  
• N. H. Pham, Y. H. Le, T. N. Dinh, D. H. Thi, Evaluation of Vietnamese Word Segmentation Methods, In Proceedings of National Informatics Conference, Haiphong, 2005

• TPC member: IEEE SOCIALCOM 2012
• Reviewer for Optimization Letters, Social Network Analysis and Mining (SNAM), Journal of Combinatorial Optimization (JOCO), IEEE SOCIALCOM 2011
  
  
• External reviewer for IEEE TMC, INFOCOM, ISAAC, COCOON, COCOA, CCNET, SIMPLEX.
  
  
• Web-master, The 16th Annual International Computing and Combinatorics Conference (COCOON 2010).

• COT 5405, Analysis of Algorithms
• COP 5536, Advanced Data Structure
• COT 3100, Discrete Mathematics
• CGS 3460, Programming Using C
• CGS 2531, Problem Solving Using Computer Software
• Introduction to Bioinformatics, VNUH
• Coach of Vietnam's team for International Olympiads in Informatics (IOI) (in a committee of 2-4 coaches).

• "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

• My Erdos number is 3 via the following path: Paul Erdos --> Ronald Graham --> Panos Pardalos.
• Member of 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)