Our research group focuses on combinatorial mathematics (discrete mathematics) and related areas such as coding theory and cryptography, mathematical statistics, mathematical optimization, and constraint logic programming. We investigate the combinatorial structures and computational issues that arise in discrete mathematical models, and use these insights to develop efficient algorithms and tools that broaden the applications of combinatorial mathematics.

In recent years, 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.