Our research group concentrates on combinatorics (discrete mathematics) and combinatorial algorithms, as well as theoretical aspects on coding theory and cryptography, which are fundamental theories underpinning information communication and security. Furthermore, our research also includes the application of SAT (satisfiability problems) and CSP (Constraint Satisfaction Problems) techniques to various combinatorial problems.

Recently, we have placed special emphasis on two research directions: group testing and combinatorial interaction testing. Group testing is a framework for efficiently identifying a small set of defective items from a large population using a minimal number of tests, making it particularly useful in applications such as medical diagnostics and network security. In the context of software testing, combinatorial interaction testing aims to systematically detect faults caused by interactions between system components while using a limited number of test cases, thereby improving testing efficiency and effectiveness.

If you are interested in discrete mathematics, combinatorial algorithms, optimization, or the mathematical foundations of communication and security, we welcome you to join us!