Toshihide Ibaraki

Home * People * Toshihide Ibaraki



Toshihide Ibaraki, a Japanese mathematician, computer scientist, president of The Kyoto College of Graduate Studies for Informatics, professor emeritus at Kyoto University, and former professor Kwansei Gakuin University, Sanda. His research spans operations research, graph theory and game theory, metaheuristics applied to combinatorial optimization problems, and search algorithms such as SSS* and parallel search.

=Selected Publications=

1970 ...

 * Toshihide Ibaraki, Saburo Muroga (1970). Adaptive Linear Classifier by Linear Programming. IEEE Transactions Systems Science and Cybernetics, Vol. 6, No. 1
 * Toshihide Ibaraki (1971). Gate-Interconnection Minimization of Switching Networks Using Negative Gates. IEEE Transactions on Computers, Vol. 20, No. 6
 * Toshihide Ibaraki (1974). Classes of Discrete Optimization Problems and Their Decision Problems. Journal of Computer and System Sciences, Vol. 8, No. 1
 * Toshihide Ibaraki (1975). Minimal Representations of Some Classes of Dynamic Programming. Information and Control, Vol. 27, No. 4
 * Toshihide Ibaraki (1976). Computational Efficiency of Approximate Branch-and-Bound Algorithms. Mathematics of Operations Research, Vol. 1, No. 3
 * Toshihide Ibaraki (1976). Theoretical comparisons of search strategies in branch-and-bound algorithms. International Journal of Parallel Programming, Vol. 5, No. 4
 * Toshihide Ibaraki (1978). Depth-m search in branch-and-bound algorithms. International Journal of Parallel Programming, Vol. 7, No. 4

1980 ...

 * Naoki Katoh, Toshihide Ibaraki, Hisashi Mine (1982). An efficient algorithm for K shortest simple paths. Networks, Vol. 12, No. 4
 * Toshihide Ibaraki (1986). Generalization of Alpha-Beta and SSS* Search Procedures. Artificial Intelligence, Vol. 29
 * Toshihide Ibaraki (1987). Game Solving Procedure H* Is Unsurpassed. Discrete Algorithms and Complexity, Proceedings of the Japan–US Joint Seminar
 * Hiromoto Usui, Masafumi Yamashita, Masaharu Imai, Toshihide Ibaraki (1987). Parallel Searches of Game Tree. Systems and Computers in Japan, Vol. 18, No. 8
 * Yoshiroh Katoh, Toshihide Ibaraki (1988). Game Solving Procedure SSS* is Unsurpassed. Systems and Computers in Japan, Vol. 19, No. 7

1990 ...

 * Toshihide Ibaraki, Naoki Katoh (1990). Searching Minimax Game Trees Under Memory Space Constraint. Annals of Mathematics and Artificial Intelligence, Vol. 1, Nos. 1-4
 * Naoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki (1992). Optimal strategies for some team games. Discrete Applied Mathematics, Vol. 35, No. 3, pdf
 * Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi (1997). Combinatorial Optimization Games. SODA 1997
 * Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi (1999). Algorithmic Aspects of the Core of Combinatorial Optimization Games. Mathematics of Operations Research, Vol. 24, No. 3

2000 ...

 * Toshihide Ibaraki (2003). Towards the General Engine for Solving Real World Combinatorial Problems. APORS Conference, IFORS Distinguished Lecture
 * Toshihide Ibaraki, Koji Nonobe, Mutsunori Yagiura (eds.) (2005) Metaheuristics: Progress as Real Problem Solvers. Operations Research / Computer Science Interfaces Series, Vol. 32, Springer
 * Hiroshi Nagamochi, Toshihide Ibaraki (2008). Algorithmic Aspects of Graph Connectivities. Cambridge University Press

=External Links=
 * Toshihide Ibaraki's Home Page
 * Operations Research, Operational Research - IFORS » Toshihide Ibaraki
 * Bai Ruibin - Activities (Some Photos)
 * ACM Fellows - Toshihide Ibaraki
 * Toshihide Ibaraki - The Mathematics Genealogy Project

=References= Up one level