Welcome to visit Chung-Shou Liao’s lab! Our research mainly focuses on designing efficient combinatorial algorithms that can be used to solve hard optimization problems from real applications. We are interested in developing approximation algorithms with theoretical analysis for network and location problems such as online shortest path, facility location, scheduling and packing problems and so on. Other areas of interest include computational geometry, graph theory, and machine learning. In particular, we also extend to systems biology for global alignment between multiple biological networks. In recent years, we put more attention on dynamic and online algorithms for the fundamental problems such as data clustering and classification, as well as their applications to AI manufacturing.