This map shows the geographic impact of Azuma Ohuchi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Azuma Ohuchi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Azuma Ohuchi more than expected).
This network shows the impact of papers produced by Azuma Ohuchi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Azuma Ohuchi. The network helps show where Azuma Ohuchi may publish in the future.
Co-authorship network of co-authors of Azuma Ohuchi
This figure shows the co-authorship network connecting the top 25 collaborators of Azuma Ohuchi.
A scholar is included among the top collaborators of Azuma Ohuchi based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Azuma Ohuchi. Azuma Ohuchi is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kawamura, Hidenori, Koichi Kurumatani, & Azuma Ohuchi. (2004). Modeling of Theme Park Problem with Multiagent for Mass User Support. Lecture notes in computer science. 48–69.7 indexed citations
3.
Kataoka, Takashi, Hidenori Kawamura, Koichi Kurumatani, & Azuma Ohuchi. (2004). Effect of Congestion Information in Theme Park Problem. 103(725). 47–52.2 indexed citations
4.
Kawamura, Hidenori, Koichi Kurumatani, & Azuma Ohuchi. (2003). A Study on Coordination Scheduling Algorithm for Theme Park Problem with Multiagent. 102(613). 25–30.3 indexed citations
5.
Kawamura, Hidenori, et al.. (2003). Vision-based Control of Autonomous Flying Airship Robot. ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications. 628–631.3 indexed citations
6.
Kawamura, Hidenori, et al.. (2002). Emergence of Key Currency in International Trade by Production and Trader Agents.. 1073–1076.1 indexed citations
7.
Nakatsugawa, Masashi & Azuma Ohuchi. (2002). A Study on Selection of the Terms in MTS Algorithm. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(4). 434–441.2 indexed citations
Kawamura, Hidenori, et al.. (2000). Multiple Ant Colonies Algorithm Based on Colony Level Interactions. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 83(2). 371–379.27 indexed citations
Yamamoto, Masahito, et al.. (1998). Evaluation of the Image Retrieval System Using Interactive Genetic Algorithm("Interactive Evolutionary Computing"). 13(5). 720–727.4 indexed citations
14.
Kawamura, Hidenori, et al.. (1998). Cooperative Search Based on Pheromone Communication for Vehicle Routing Problems. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(6). 1089–1096.10 indexed citations
15.
Ohuchi, Azuma, et al.. (1998). Evolutionary Acquisition of Weight Modifyer for Neural Network Design. ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications. 1045–1048.
16.
Kurihara, Masahito & Azuma Ohuchi. (1995). Decomposable Termination of Composable Term Rewriting Systems. IEICE Transactions on Information and Systems. 78(4). 314–320.4 indexed citations
17.
Kurihara, Masahito & Azuma Ohuchi. (1991). Modular term rewriting systems with shared constructors. Journal of information processing. 14(3). 357–358.4 indexed citations
18.
Ohuchi, Azuma, et al.. (1990). 30周年記念論文 佳作:Modularity of Simple Termination of Term Rewriting Systems. 31(5). 633–642.12 indexed citations
Kurihara, Masahito, et al.. (1984). Generalized Transitive Embedding in ISM. IEEJ Transactions on Electronics Information and Systems. 104(1). 1–8.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.