This map shows the geographic impact of M. Yamamura'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 M. Yamamura with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. Yamamura more than expected).
This network shows the impact of papers produced by M. Yamamura. 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 M. Yamamura. The network helps show where M. Yamamura may publish in the future.
Co-authorship network of co-authors of M. Yamamura
This figure shows the co-authorship network connecting the top 25 collaborators of M. Yamamura.
A scholar is included among the top collaborators of M. Yamamura 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 M. Yamamura. M. Yamamura is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Yamamura, M., et al.. (2006). Spider algorithm for clustering time series. International Conference on Artificial Intelligence. 378–383.1 indexed citations
6.
Murata, Satoshi, et al.. (2003). Self-organizing Formation Algorithm for Active Elements. Tokyo Tech Research Repository (Tokyo Institute of Technology). 18(2). 83–95.1 indexed citations
7.
Yamamura, M., et al.. (2002). Robust Evolutionary Algorithms with toroidal search space conversion for function optimization. Tokyo Tech Research Repository (Tokyo Institute of Technology). 553–560.4 indexed citations
8.
Yamamura, M., et al.. (2000). Where should children be generated by crossover operator on function optimization. Tokyo Tech Research Repository (Tokyo Institute of Technology). 382–382.1 indexed citations
9.
Yamamura, M., et al.. (1999). A Genetic Algorithm without parameters tuning and its application on the floorplan design problem. Tokyo Tech Research Repository (Tokyo Institute of Technology). 620–627.7 indexed citations
10.
Tsutsui, Shigeyoshi, M. Yamamura, & Takahide Higuchi. (1999). Multi-parent recombination with simplex crossover in real coded genetic algorithms. Tokyo Tech Research Repository (Tokyo Institute of Technology). 657–664.236 indexed citations
Miyazaki, Kazuteru, M. Yamamura, & Shigenobu Kobayashi. (1996). l-Certainty Exploration Method: An Action Selector to Identify the Environment by an Agent : An Extension of k-Certainty Exploration Method to Stochastic MDPs. 11(5). 804–808.1 indexed citations
13.
Kobayashi, Shigenobu, Isao Ono, & M. Yamamura. (1995). An Efficient Genetic Algorithm for Job Shop Scheduling Problems. international conference on Genetic algorithms. 506–511.89 indexed citations
Yamamura, M. & Shigenobu Kobayashi. (1991). An augmented EBL and its application to the utility problem. International Joint Conference on Artificial Intelligence. 623–629.3 indexed citations
19.
Kise, Yoshifumi, et al.. (1990). Effect of dietary molybdenum on esophageal carcinogenesis in rats induced by N-methyl-N-benzylnitrosamine.. PubMed. 50(8). 2418–22.17 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.