25,161
edits
Changes
Created page with "'''Home * People * Toshihide Ibaraki''' FILE:ToshihideIbaraki.jpg|border|right|thumb| Toshihide Ibaraki <ref>[https://global.kcg.edu/faculty/professors pr..."
'''[[Main Page|Home]] * [[People]] * Toshihide Ibaraki'''
[[FILE:ToshihideIbaraki.jpg|border|right|thumb| Toshihide Ibaraki <ref>[https://global.kcg.edu/faculty/professors professors | The Kyoto College of Graduate Studies for Informatics]</ref> ]]
'''Toshihide Ibaraki''',<br/>
a Japanese mathematician, computer scientist, president of [https://en.wikipedia.org/wiki/The_Kyoto_College_of_Graduate_Studies_for_Informatics The Kyoto College of Graduate Studies for Informatics], professor emeritus at [https://en.wikipedia.org/wiki/Kyoto_University Kyoto University], and former professor [https://en.wikipedia.org/wiki/Kwansei_Gakuin_University Kwansei Gakuin University], [https://en.wikipedia.org/wiki/Sanda,_Hyogo Sanda].
His research spawns [https://en.wikipedia.org/wiki/Operations_research operations research], [https://en.wikipedia.org/wiki/Graph_theory graph theory] and [https://en.wikipedia.org/wiki/Game_theory game theory], [https://en.wikipedia.org/wiki/Metaheuristic metaheuristics] applied to [https://en.wikipedia.org/wiki/Combinatorial_optimization combinatorial optimization] problems, and [[Search|search]] algorithms such as [[SSS* and Dual*|SSS*]] and [[Parallel Search|parallel search]].
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/i/Ibaraki:Toshihide dblp: Toshihide Ibaraki]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==1970 ...==
* [[Toshihide Ibaraki]], [[Mathematician#SMuroga|Saburo Muroga]] ('''1970'''). ''Adaptive Linear Classifier by Linear Programming''. [[IEEE#SMC|IEEE Transactions Systems Science and Cybernetics]], Vol. 6, No. 1
* [[Toshihide Ibaraki]] ('''1971'''). ''[https://ieeexplore.ieee.org/document/1671924 Gate-Interconnection Minimization of Switching Networks Using Negative Gates]''. [[IEEE#TOC|IEEE Transactions on Computers]], Vol. 20, No. 6
* [[Toshihide Ibaraki]] ('''1974'''). ''[https://www.sciencedirect.com/science/article/pii/S0022000074800243 Classes of Discrete Optimization Problems and Their Decision Problems]''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 8, No. 1
* [[Toshihide Ibaraki]] ('''1975'''). ''[https://www.sciencedirect.com/science/article/pii/S0019995875901515 Minimal Representations of Some Classes of Dynamic Programming]''. [https://en.wikipedia.org/wiki/Information_and_Computation Information and Control], Vol. 27, No. 4
* [[Toshihide Ibaraki]] ('''1976'''). ''[https://pubsonline.informs.org/doi/abs/10.1287/moor.1.3.287?journalCode=moor Computational Efficiency of Approximate Branch-and-Bound Algorithms]''. [https://en.wikipedia.org/wiki/Mathematics_of_Operations_Research Mathematics of Operations Research], Vol. 1, No. 3
* [[Toshihide Ibaraki]] ('''1976'''). ''[https://link.springer.com/article/10.1007/BF00998631 Theoretical comparisons of search strategies in branch-and-bound algorithms]''. [https://link.springer.com/journal/10766 International Journal of Parallel Programming], Vol. 5, No. 4
* [[Toshihide Ibaraki]] ('''1978'''). ''[https://link.springer.com/article/10.1007/BF00991818 Depth-m search in branch-and-bound algorithms]''. [https://link.springer.com/journal/10766 International Journal of Parallel Programming], Vol. 7, No. 4
==1980 ...==
* [[Naoki Katoh]], [[Toshihide Ibaraki]], [https://dblp.uni-trier.de/pers/hd/m/Mine:Hisashi Hisashi Mine] ('''1982'''). ''[https://onlinelibrary.wiley.com/doi/abs/10.1002/net.3230120406 An efficient algorithm for K shortest simple paths]''. Networks, Vol. 12, No. 4
* [[Toshihide Ibaraki]] ('''1986'''). ''[https://www.sciencedirect.com/science/article/abs/pii/0004370286900925 Generalization of Alpha-Beta and SSS* Search Procedures]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 29
* [[Toshihide Ibaraki]] ('''1987'''). ''[https://www.sciencedirect.com/science/article/pii/B9780123868701500174?via%3Dihub 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'''). ''[https://onlinelibrary.wiley.com/doi/pdf/10.1002/scj.4690180810 Parallel Searches of Game Tree]''. [https://onlinelibrary.wiley.com/journal/1520684x Systems and Computers in Japan], Vol. 18, No. 8
* [https://dblp.uni-trier.de/pers/hd/k/Katoh:Yoshiroh Yoshiroh Katoh], [[Toshihide Ibaraki]] ('''1988'''). ''[https://onlinelibrary.wiley.com/doi/pdf/10.1002/scj.4690190710 Game Solving Procedure SSS* is Unsurpassed]''. [https://onlinelibrary.wiley.com/journal/1520684x Systems and Computers in Japan], Vol. 19, No. 7
==1990 ...==
* [[Toshihide Ibaraki]], [[Naoki Katoh]] ('''1990'''). ''[https://link.springer.com/article/10.1007/BF01531075 Searching Minimax Game Trees Under Memory Space Constraint]''. [https://link.springer.com/journal/10472 Annals of Mathematics and Artificial Intelligence], Vol. 1, Nos. 1-4
* [[Naoki Katoh]], [https://dblp.uni-trier.de/pers/hd/k/Koyanagi:Junji Junji Koyanagi], [https://dblp.uni-trier.de/pers/hd/o/Ohnishi:Masamitsu Masamitsu Ohnishi], [[Toshihide Ibaraki]] ('''1992'''). ''[https://www.sciencedirect.com/science/article/pii/0166218X9290250E Optimal strategies for some team games]''. [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 35, No. 3, [https://core.ac.uk/download/pdf/82149932.pdf pdf]
* [[Mathematician#XDeng|Xiaotie Deng]], [[Toshihide Ibaraki]], [[Mathematician#HNagamochi|Hiroshi Nagamochi]] ('''1997'''). ''[https://dl.acm.org/citation.cfm?id=314428 Combinatorial Optimization Games]''. [https://dblp.uni-trier.de/db/conf/soda/soda97.html SODA 1997]
* [[Mathematician#XDeng|Xiaotie Deng]], [[Toshihide Ibaraki]], [[Mathematician#HNagamochi|Hiroshi Nagamochi]] ('''1999'''). ''[https://pubsonline.informs.org/doi/10.1287/moor.24.3.751 Algorithmic Aspects of the Core of Combinatorial Optimization Games]''. [https://en.wikipedia.org/wiki/Mathematics_of_Operations_Research Mathematics of Operations Research], Vol. 24, No. 3 <ref>[https://en.wikipedia.org/wiki/Core_(game_theory) Core (game theory) from Wikipedia]</ref>
==2000 ...==
* [[Toshihide Ibaraki]] ('''2003'''). ''[http://ifors.org/web/toshihide-ibaraki/ Towards the General Engine for Solving Real World Combinatorial Problems]''. APORS Conference, [https://en.wikipedia.org/wiki/International_Federation_of_Operational_Research_Societies IFORS] Distinguished Lecture
* [[Toshihide Ibaraki]], [https://dblp.uni-trier.de/pers/hd/n/Nonobe:Koji Koji Nonobe], [https://dblp.uni-trier.de/pers/hd/y/Yagiura:Mutsunori Mutsunori Yagiura] (eds.) ('''2005''') ''[https://link.springer.com/book/10.1007/b107306 Metaheuristics: Progress as Real Problem Solvers]''. [https://link.springer.com/bookseries/6375 Operations Research / Computer Science Interfaces Series], Vol. 32, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Mathematician#HNagamochi|Hiroshi Nagamochi]], [[Toshihide Ibaraki]] ('''2008'''). ''[https://www.cambridge.org/us/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/algorithmic-aspects-graph-connectivity?format=HB Algorithmic Aspects of Graph Connectivities]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
=External Links=
* [http://web1.kcg.edu/~t_ibaraki/indexe.html Toshihide Ibaraki's Home Page]
* [http://ifors.org/web/toshihide-ibaraki/ Operations Research, Operational Research - IFORS » Toshihide Ibaraki]
* [http://www.cs.nott.ac.uk/~rzb/activities.shtml Bai Ruibin - Activities] (Some Photos)
* [https://awards.acm.org/award_winners/ibaraki_1089572 ACM Fellows - Toshihide Ibaraki]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=191074 Toshihide Ibaraki - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Ibaraki]]
[[Category:Researcher|Ibaraki]]
[[FILE:ToshihideIbaraki.jpg|border|right|thumb| Toshihide Ibaraki <ref>[https://global.kcg.edu/faculty/professors professors | The Kyoto College of Graduate Studies for Informatics]</ref> ]]
'''Toshihide Ibaraki''',<br/>
a Japanese mathematician, computer scientist, president of [https://en.wikipedia.org/wiki/The_Kyoto_College_of_Graduate_Studies_for_Informatics The Kyoto College of Graduate Studies for Informatics], professor emeritus at [https://en.wikipedia.org/wiki/Kyoto_University Kyoto University], and former professor [https://en.wikipedia.org/wiki/Kwansei_Gakuin_University Kwansei Gakuin University], [https://en.wikipedia.org/wiki/Sanda,_Hyogo Sanda].
His research spawns [https://en.wikipedia.org/wiki/Operations_research operations research], [https://en.wikipedia.org/wiki/Graph_theory graph theory] and [https://en.wikipedia.org/wiki/Game_theory game theory], [https://en.wikipedia.org/wiki/Metaheuristic metaheuristics] applied to [https://en.wikipedia.org/wiki/Combinatorial_optimization combinatorial optimization] problems, and [[Search|search]] algorithms such as [[SSS* and Dual*|SSS*]] and [[Parallel Search|parallel search]].
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/i/Ibaraki:Toshihide dblp: Toshihide Ibaraki]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==1970 ...==
* [[Toshihide Ibaraki]], [[Mathematician#SMuroga|Saburo Muroga]] ('''1970'''). ''Adaptive Linear Classifier by Linear Programming''. [[IEEE#SMC|IEEE Transactions Systems Science and Cybernetics]], Vol. 6, No. 1
* [[Toshihide Ibaraki]] ('''1971'''). ''[https://ieeexplore.ieee.org/document/1671924 Gate-Interconnection Minimization of Switching Networks Using Negative Gates]''. [[IEEE#TOC|IEEE Transactions on Computers]], Vol. 20, No. 6
* [[Toshihide Ibaraki]] ('''1974'''). ''[https://www.sciencedirect.com/science/article/pii/S0022000074800243 Classes of Discrete Optimization Problems and Their Decision Problems]''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 8, No. 1
* [[Toshihide Ibaraki]] ('''1975'''). ''[https://www.sciencedirect.com/science/article/pii/S0019995875901515 Minimal Representations of Some Classes of Dynamic Programming]''. [https://en.wikipedia.org/wiki/Information_and_Computation Information and Control], Vol. 27, No. 4
* [[Toshihide Ibaraki]] ('''1976'''). ''[https://pubsonline.informs.org/doi/abs/10.1287/moor.1.3.287?journalCode=moor Computational Efficiency of Approximate Branch-and-Bound Algorithms]''. [https://en.wikipedia.org/wiki/Mathematics_of_Operations_Research Mathematics of Operations Research], Vol. 1, No. 3
* [[Toshihide Ibaraki]] ('''1976'''). ''[https://link.springer.com/article/10.1007/BF00998631 Theoretical comparisons of search strategies in branch-and-bound algorithms]''. [https://link.springer.com/journal/10766 International Journal of Parallel Programming], Vol. 5, No. 4
* [[Toshihide Ibaraki]] ('''1978'''). ''[https://link.springer.com/article/10.1007/BF00991818 Depth-m search in branch-and-bound algorithms]''. [https://link.springer.com/journal/10766 International Journal of Parallel Programming], Vol. 7, No. 4
==1980 ...==
* [[Naoki Katoh]], [[Toshihide Ibaraki]], [https://dblp.uni-trier.de/pers/hd/m/Mine:Hisashi Hisashi Mine] ('''1982'''). ''[https://onlinelibrary.wiley.com/doi/abs/10.1002/net.3230120406 An efficient algorithm for K shortest simple paths]''. Networks, Vol. 12, No. 4
* [[Toshihide Ibaraki]] ('''1986'''). ''[https://www.sciencedirect.com/science/article/abs/pii/0004370286900925 Generalization of Alpha-Beta and SSS* Search Procedures]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 29
* [[Toshihide Ibaraki]] ('''1987'''). ''[https://www.sciencedirect.com/science/article/pii/B9780123868701500174?via%3Dihub 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'''). ''[https://onlinelibrary.wiley.com/doi/pdf/10.1002/scj.4690180810 Parallel Searches of Game Tree]''. [https://onlinelibrary.wiley.com/journal/1520684x Systems and Computers in Japan], Vol. 18, No. 8
* [https://dblp.uni-trier.de/pers/hd/k/Katoh:Yoshiroh Yoshiroh Katoh], [[Toshihide Ibaraki]] ('''1988'''). ''[https://onlinelibrary.wiley.com/doi/pdf/10.1002/scj.4690190710 Game Solving Procedure SSS* is Unsurpassed]''. [https://onlinelibrary.wiley.com/journal/1520684x Systems and Computers in Japan], Vol. 19, No. 7
==1990 ...==
* [[Toshihide Ibaraki]], [[Naoki Katoh]] ('''1990'''). ''[https://link.springer.com/article/10.1007/BF01531075 Searching Minimax Game Trees Under Memory Space Constraint]''. [https://link.springer.com/journal/10472 Annals of Mathematics and Artificial Intelligence], Vol. 1, Nos. 1-4
* [[Naoki Katoh]], [https://dblp.uni-trier.de/pers/hd/k/Koyanagi:Junji Junji Koyanagi], [https://dblp.uni-trier.de/pers/hd/o/Ohnishi:Masamitsu Masamitsu Ohnishi], [[Toshihide Ibaraki]] ('''1992'''). ''[https://www.sciencedirect.com/science/article/pii/0166218X9290250E Optimal strategies for some team games]''. [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 35, No. 3, [https://core.ac.uk/download/pdf/82149932.pdf pdf]
* [[Mathematician#XDeng|Xiaotie Deng]], [[Toshihide Ibaraki]], [[Mathematician#HNagamochi|Hiroshi Nagamochi]] ('''1997'''). ''[https://dl.acm.org/citation.cfm?id=314428 Combinatorial Optimization Games]''. [https://dblp.uni-trier.de/db/conf/soda/soda97.html SODA 1997]
* [[Mathematician#XDeng|Xiaotie Deng]], [[Toshihide Ibaraki]], [[Mathematician#HNagamochi|Hiroshi Nagamochi]] ('''1999'''). ''[https://pubsonline.informs.org/doi/10.1287/moor.24.3.751 Algorithmic Aspects of the Core of Combinatorial Optimization Games]''. [https://en.wikipedia.org/wiki/Mathematics_of_Operations_Research Mathematics of Operations Research], Vol. 24, No. 3 <ref>[https://en.wikipedia.org/wiki/Core_(game_theory) Core (game theory) from Wikipedia]</ref>
==2000 ...==
* [[Toshihide Ibaraki]] ('''2003'''). ''[http://ifors.org/web/toshihide-ibaraki/ Towards the General Engine for Solving Real World Combinatorial Problems]''. APORS Conference, [https://en.wikipedia.org/wiki/International_Federation_of_Operational_Research_Societies IFORS] Distinguished Lecture
* [[Toshihide Ibaraki]], [https://dblp.uni-trier.de/pers/hd/n/Nonobe:Koji Koji Nonobe], [https://dblp.uni-trier.de/pers/hd/y/Yagiura:Mutsunori Mutsunori Yagiura] (eds.) ('''2005''') ''[https://link.springer.com/book/10.1007/b107306 Metaheuristics: Progress as Real Problem Solvers]''. [https://link.springer.com/bookseries/6375 Operations Research / Computer Science Interfaces Series], Vol. 32, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Mathematician#HNagamochi|Hiroshi Nagamochi]], [[Toshihide Ibaraki]] ('''2008'''). ''[https://www.cambridge.org/us/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/algorithmic-aspects-graph-connectivity?format=HB Algorithmic Aspects of Graph Connectivities]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
=External Links=
* [http://web1.kcg.edu/~t_ibaraki/indexe.html Toshihide Ibaraki's Home Page]
* [http://ifors.org/web/toshihide-ibaraki/ Operations Research, Operational Research - IFORS » Toshihide Ibaraki]
* [http://www.cs.nott.ac.uk/~rzb/activities.shtml Bai Ruibin - Activities] (Some Photos)
* [https://awards.acm.org/award_winners/ibaraki_1089572 ACM Fellows - Toshihide Ibaraki]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=191074 Toshihide Ibaraki - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Ibaraki]]
[[Category:Researcher|Ibaraki]]
