Discrete Optimization, Graph Theory, Computational Complexity
I pursue research on Discrete Optimization, Graph Theory and Computational Complexity.Especially, my research interests include matroid structure and submodularlity in discrete optimization problems, good characterizations related to packing problems in graphs, and mathematical programming approaches to proving limits of computation. Furthermore, I pursue research on application of these theories to urban/social system design.
Educational Activities
I give lectures on mathematics in the departments of mathematics and engineering. Especially, I give lectures on informatics and optimization in the department of mathematics, and on complex analysis and ordinary differential equation in the department of engineering. Furthermore, I supervise several students in the department of mathematics through seminars.
Professional and Outreach Activities
I aim at spreading mathematics through articles and seminars. Furthermore, I serve as programming committees of several international conferences..