I pursue research in the theoretical aspects of Discrete Optimization.Optimization Problem is a problem of finding a solution maximizing (or minimizing) an objective function among all feasible solutions. Discrete Optimization includes a broad class of optimization problems. My main research topic is to derive algorithms for these discrete optimization problems by using submodularity that is discrete analogue of convexity and polyhedral approaches based on duality.

Furthermore, my research field includes Graph Theory and Computational Complexity that are deeply related to Discrete Optimization. I am also interested in applications of optimization techniques to real world problems arising from urban planning, transportation system and social networks.