My current research interests focus mainly on two areas: graph Algorithms and Chinese character recognition. With graph algorithms, I am particularly interested in graphs that have some “geometric” properties. For example, interval graph, permutation graph, etc. In the past, I have developed algorithms for recognizing several classes of graphs. These algorithms are either new or more efficient than the existing algorithms. I am also interested in solving various combinatorial optimization problems in these classes of graphs. To this end, I am trying to find new properties, or take a new approach to solve some old problems, in various types of graphs. One problem I can currently focused on is the vertex connectivity augmentation problem. Using a non-traditional approach, I have devised simpler and more efficient algorithms on two and three vertex connectivity augmentation algorithms. I am trying to extend this novel approach to more complicated problems. With reference to Chinese character recognition, I have developed two prototypes. TLH is an on-line hand writing recognition system and Ning is a recognition core for printed characters. Both systems are based on the template matching approach, instead of the more traditional structural analysis method. I believe that, as the technology in personal computers advances, a lot of new approaches that were not feasible in the past, deserve to be looked at from a new standpoint.