معرفی
Joseph Cheriyan is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo. His research focuses on combinatorial optimization and approximation algorithms, with recent work on topics such as the Traveling Tournament Problem and spectral graph theory. He has taught courses such as CO 351 (Network Flow Theory), CO 327 (Deterministic OR Models), and graduate-level courses like CO 754 (Approximation Algorithms) and CO 759 (Algorithms and Spectral Graph Theory). His research interests include algorithmic approaches to NP-hard problems, graph partitioning, and spectral methods. Cheriyan's work has been published in venues like DBLP and arXiv, though specific article details are not listed here. He has also organized events like the Fulkerson 100 workshop in 2024.
His teaching history includes both undergraduate and graduate courses, spanning topics from network flow theory to advanced spectral graph techniques. Course materials and lecture notes reflect his engagement with cutting-edge topics such as Cheeger’s inequality, electric networks in graphs, and maximum flow algorithms. Cheriyan’s affiliations include active participation in the Combinatorics & Optimization Department, where he contributes to both research and educational initiatives.
