Becoming a Golden Hawk means more than just cheering on our (really good) varsity teams – it means being a student who cares about your community, who works hard in the classroom, and who takes advantage of all the learning opportunities that can happen outside the classroom, too.
I received my PhD in Computer Science at McGill University in 1986.
Prior to joining Laurier, I was assistant, associate and full professor at Lakehead University from 1991 to 2000, a Humboldt fellow at the University of Bonn from 1989 to 1991, and an assistant professor at Rutgers University from 1985 to 1989.
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.
Alexander von Humboldt Fellowship (1999, 2000).
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. “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).