معرفی
Dr. Jing Huang is a Professor in the Department of Mathematics and Statistics at the University of Victoria. He holds a PhD from Simon Fraser University. His research focuses on graph theory, algorithms, and computational complexity, with a particular emphasis on graph structures and their algorithmic applications. Notable contributions include the lexicographic method for graph orientations and a dichotomy theorem for list homomorphism problems.
- Education: PhD, Simon Fraser University
Research interests span structural graph theory, orientation algorithms, and algorithmic characterizations of graph classes such as interval graphs, chordal graphs, and circular arc graphs. Recent work addresses orientation completion problems and cocomparability graph properties. Courses taught include discrete mathematics and graph theory. His work bridges theoretical insights with practical algorithm design, often involving collaboration with leading researchers in the field.
Advising & Grants: No student advisees listed; grants and collaborations are central to his research trajectory. His lab focuses on advancing graph theory through algorithmic innovation.
