Satoru Iwata

Profile

Satoru Iwata 
Satoru Iwata

Department of Mathematical Informatics
Graduate School of Information Science and Technology
The University of Tokyo
Professor

Hongo 7-3-1, Bunkyo-ku, Tokyo 113-8656, Japan
Tel: +81 3 5841 7430 (ext. 27430) 

E-mail:iwata@mist.i.u-tokyo.ac.jp

[ Personal Site ]

Biography

March 1991 Bachelor of Engineering, Department of Mathematical Engineering and Information Physics, School of Engineering, The University of Tokyo
March 1993 Master of Engineering, Department of Mathematical Engineering and Information Physics, Graduate School of Engineering, The University of Tokyo
April 1994 Research Associate, Research Institute for Mathematical Sciences, Kyoto University
April 1997 Lecturer, Graduate School of Engineering Science, Osaka University
April 2000 Associate Professor, Department of Mathematical Engineering and Information Physics, Graduate School of Engineering, The University of Tokyo
April 2001 Associate Professor, Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo
April 2006 Associate Professor, Research Institute for Mathematical Sciences, Kyoto University
April 2008 Professor, Research Institute for Mathematical Sciences, Kyoto University
February 2013 Professor, Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo

Research Topics

Solving Fundamental Problems in Mathematical Engineering
Discrete Optimization: Design and Analysis of Efficient Algorithms on Matroids and Submodular Functions
Discrete Mathematical Engineering: Engineering Applications of Discrete Optimization Methods (Systems Analysis and Chemoinformatics)

Selected Publications

S. Iwata and M. Takamatsu: Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation, Mathematical Programming, 103 (2010), 105-121.
J. F. Geelen, S. Iwata, and K. Murota: The linear delta-matroid parity problem, Journal of Combinatorial Theory, B88 (2003), 377-398.
S. Iwata, L. Fleischer, and S. Fujishige: A combinatorial strongly polynomial algorithm for minimizing submodular functions, Journal of the ACM, 48 (2001), 761-777.

 

Suri7-Tanigawa

Profile

Shin-ichi Tanigawa
Shin-ichi Tanigawa

Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo
Associate Professor

7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-8656 Eng. 6 Bldg. Room 340
Tel: 03-5841-6906, ext. 26906
Fax:

E-mail:tanigawa@mist.i.u-tokyo.ac.jp

[Home Page]

 

Curriculum Vitae

Mar. 2005 Graduated from the Department of Architecture and Architectural Engineering, Faculty of Engineering, Kyoto University
Mar. 2007 Graduated from the Master Course of the Department of Architecture and Architectural Engineering, Graduate School of Engineering, Kyoto University
Mar. 2010 Graduated from the the Doctor Course of the Department of Architecture and Architectural Engineering, Graduate School of Engineering, Kyoto University
Apr. 2010 – May 2011 Postdoctoral Fellow of Japan Society for the Promotion of Science
Jun. 2011 – Mar. 2017 Assistant Professor, Research Institute for Mathematical Sciences, Kyoto University
Apr. 2017 – Associate Professor, Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo

Research Themes

● Discrete and Computational Geometry
Design and analysis of algorithms for geometric problems in engineering. Topics of particular interest are: rigidity theory and geometric graph theory.  

● Discrete Algorithms
Design and analysis of algorithms for discrete optimization problems. Topics of particular interest are: graph algorithms and combinatorial optimization.

Selected Publications

Satoru Fujishige and Shin-ichi Tanigawa: Polynomial combinatorial algorithms for skew-bisubmodular function minimization, Mathematical Programming, to appear, 2017.

Shin-ichi Tanigawa: Singularity degree of the positive semidefinite matrix completion problem, SIAM Journal on Optimization, 27, 986–1009, 2017.

Bill Jackson, Tibor Jordan and Shin-ichi Tanigawa: Unique low rank completability of partially filled matrices, Journal of Combinatorial Theory, Series B, 121, 432-462, 2016.

Shin-ichi Tanigawa: Sufficient conditions for globally rigidity of graphs, Journal of Combinatorial Theory Series B, 113: 123–140, 2015.

Shin-ichi Tanigawa: Matroids of gain graphs in applied discrete geometry. Transactions of the American Mathematical Society, 367, 8597-8641, 2015.

 

 

Mathematical Informatics 7th Laboratory

Computational Informatics Lab (Mathematical Informatics 7th Lab)
– Solve “troubles” in society –
Webpage of Lab→
Satoru Iwata
Satoru Iwata

Professor
Shinichi Tanigawa
Shinichi Tanigawa

Associate Professor
Optimal Modeling
Modeling is the first step for solving real-world problems and understanding complex phenomena via a mathematical approach. However, there could be enormous different models to the same phenomenon. Furthermore, even in essentially equivalent models, the difficulty of the numerical computation varies due to variable choices and freedom in mathematical expressions in these models. Exploiting techniques from discrete mathematics, optimization, and statistics, we aim to establish a systematic methodology for selecting an optimal model from enormous possible models.

Discrete Computational Geometry
Computational geometry studies algorithms for solving geometric problems. Our particular interest is to understand the discrete structures behind geometric graphs and networks in engineering topics such as robotics, structural mechanics, and bioinformatics, and establish mathematical foundations for efficient algorithms.