The Algorithms & Combinatorial Optimization (ACO) Lab's research mainly focuses on designing efficient algorithms that can be used to solve difficult combinatorial optimization problems from real-world applications. ACOLab has developed approximation algorithms with theoretical analysis for well-known hard problems such as online shortest path, facility location, domination, and scheduling and packing problems. Other areas of interest include computational geometry, graph theory, and unsupervised learning. In particular, we also extended our study to systems biology; We proposed graph-theoretic algorithms for global alignment between multiple biological networks and conducted comparative analysis across species, leading to practical applications in social networking and knowledge graphs. In recent years, we put more attention on dynamic and online algorithms for the fundamental problems such as routing and data clustering, as well as their applications to AI manufacturing, anomaly detection, and generative knowledge graphs.