We use cookies on this site to enhance your experience.
By selecting “Accept” and continuing to use this website, you consent to the use of cookies.
B Eng, Electrical and Computer Engineering, Mc Gill University.
MSc Computer Science, McGill University.
PhD Computer Science, McGill University.
I hold faculty positions at Rutgers University in New Jersey, and Lakehead University in Ontario. I was a Humboldt fellow at the University of Bonn, Germany. I was visiting professor at Université Paris-Sud (France), Université de Grenoble (France), and Polytechnic University of Catalonia (Spain). I am currently Professor in the Department of Physics and Computer Science at Wilfrid Laurier University. I has taught mobile programming since 2010. This teaching effort on mobile programming has been supported by Apple, Telus, and many local companies. The main focus of my research is structured graph theory and algorithms on graphs. My research is supported by NSERC.
The main focus of my research is structured graph theory and algorithms on graphs. I am interested in exploring the boundary between NP-complete and polynomial-time solvable graph recognition and optimization problems.
I have research assistantships opportunities for undergraduate and graduate students interested in discrete mathematics and theoretical computer science. Contact me for more information.
I am willing to supervise graduate students in the areas of algorithmic graph theory.
- C. T. Hoàng, C. Robin. "A closure lemma for tough graphs and Hamiltonian degree conditions." Discrete Mathematics 347(4), April 2024 https://doi.org/10.1016/j.disc.2024.113872 .
- C. T. Hoàng. “The complexity of finding a sun in a graph.” SIAM Journal on Discrete Mathematics 23(4), 2156-2162 (2010).
- C. T. Hoàng, M. Kamiński, V. Lozin, J. Sawada, X. Shu.” Deciding k-colourability of P5-free graphs in polynomial time.” Algorithmica 57:1, 74-81 (2010).
- K. Cameron, E. M. Eschen, C. T. Hoàng and R. Sritharan. The complexity of list partition problems for graphs. SIAM Journal on Discrete Mathematics 21(4), 900-929 (2008).
- K. Cameron, E. M. Eschen, C. T. Hoàng and R. Sritharan. “The List Partition Problem for Graphs.” Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, January 2004, New Orleans, Louisiana.
- A. Brandstädt and C. T. Hoàng. “On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem.” Eleventh Conference on Integer Programming and Combinatorial Optimization, June 2005.
- R. Hayward, C. T. Hoàng and F. Maffray. “Optimizing weakly triangulated graphs.” Graphs and Combinatorics 5, 339-349 (1989).