My current work concerns graph theory, data privacy, and the design, analysis, implementation and performance evaluation of algorithms.
Graph theory: Graphs model many important applications and are also tools to solve many other theoretical problems. We often start with probing fundamental theoretical problems such as the structures of graphs with certain properties. With these properties, we then usually design efficient algorithms and solve applications. One example we are working on is the graph connectivity augmentation problem. In this problem, a minimum set of edges are required to add to a graph such that the connectivity of the resulting graph increases. This problem has applications on many problems, such as the design of reliable networks, the security of statistical tables and the drawing of planar graphs. One other example is on Computer Chinese chess. We use graph-theoretical techniques to efficient construct large endgame databases. We also use graph theory to model Chinese chess tie-breaking rules.
Design, analysis, implementation and performance evaluation of algorithms: Algorithms is one of the cores of computer sciences. We are interested in all aspects of researches in algorithms which include finding new algorithms for interesting problems and designing efficient implementations to solve real-world applications. We are interested in both sequential, parallel and distributed algorithms.
Privacy protection: We are in the process of designing formal models for privacy protection and pricing mechanisms for privacy leakage. We wish to find efficient algorithms for checking and preventing privacy leakage.