Generate a tailored SOP for Dr. Ben Li. Improve your application with a focused, well-structured draft.
Ben Li is an Associate Professor in the Department of Computer Science at the University of Manitoba. His research interests encompass combinatorics and theoretical computer science with a focus on combinatorial design theory and graph theory. Dr. Li has conducted extensive work on combinatorial optimization problems, specifically examining vertex cover, matchings, and developing approximation algorithms for NP-Hard problems. Additionally, he delves into properties of combinatorial designs such as Steiner triple systems, Balanced Incomplete Block Designs, difference sets, and covering designs. His research includes analyzing the enumeration of non-isomorphic designs based on specific parameters and investigating the existence of various combinatorial designs. He has also studied subclasses of NP-Hard problems that can be solved in polynomial time, contributing significantly to the understanding of algorithmic efficiency in combinatorial contexts.
Streams include Education, Administration, or Clinical.