Citations per year, relative to Kenji Onaga Kenji Onaga (= 1×)
peers
Richard Van Slyke
Countries citing papers authored by Kenji Onaga
Since
Specialization
Citations
This map shows the geographic impact of Kenji Onaga'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 Kenji Onaga with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kenji Onaga more than expected).
This network shows the impact of papers produced by Kenji Onaga. 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 Kenji Onaga. The network helps show where Kenji Onaga may publish in the future.
Co-authorship network of co-authors of Kenji Onaga
This figure shows the co-authorship network connecting the top 25 collaborators of Kenji Onaga.
A scholar is included among the top collaborators of Kenji Onaga 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 Kenji Onaga. Kenji Onaga is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Matsuda, Yoshitaka, et al.. (2002). Designing of Multi-tier GIS Architecture with Sematics Filter. ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications. 823–826.4 indexed citations
2.
Matsuda, Yoshitaka, et al.. (2002). A Design of Semantics Filter for GIS. ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications. 587–590.1 indexed citations
3.
Nakamura, Morikazu, et al.. (2001). An Autonomous Distributed Scheduling Scheme for Parallel Machine Problems. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 84(3). 763–770.1 indexed citations
4.
Nakamura, Morikazu, et al.. (1998). A Parallel and Distributed Genetic Algorithm on Loosely-Coupled Multiprocessor Systems(Special Section on Concurrent Systems Technology). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(4). 540–546.4 indexed citations
5.
Ombuki, Beatrice M., Morikazu Nakamura, & Kenji Onaga. (1998). An Evolutionary Scheduling Scheme Based on gkGA Approach to the job Shop Scheduling Problem(Special Section of Papers Selected from ITC-CSCC'97). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(6). 1063–1071.5 indexed citations
6.
Nakamura, Morikazu, et al.. (1998). A Parallel and Distributed Genetic Algorithm on Loosely-Coupled Multiprocessor Systems. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 540–546.18 indexed citations
7.
Ombuki, Beatrice M., Morikazu Nakamura, & Kenji Onaga. (1997). A Hybridized GA Approach to the Job Shop Problem. ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications. 483–486.1 indexed citations
8.
Onaga, Kenji, et al.. (1996). On Verification of Token Self-Cleanness of Data-Flow Program Nets. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 79(6). 812–817.2 indexed citations
9.
Nakamura, Makoto, et al.. (1996). A Distributed Genetic Algorithm for the Multiple Knapsack Problem Using PVM. ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications. 899–902.2 indexed citations
10.
Nakamura, Morikazu, et al.. (1995). A Genetic Algorithm for Multiprocessor Scheduling Problems. 94(476). 53–59.1 indexed citations
11.
Onaga, Kenji, et al.. (1995). On Verification of Token Self-Cleanness of Data-Flow Program Nets. International Symposium on Circuits and Systems. 746–749.1 indexed citations
12.
Onaga, Kenji, et al.. (1993). Design of a Dynamic Mutual Exclusion Algorithm for a Distributed Network of Autonomous Nodes (Special Section on the 5th Karuizawa Workshop on Circuits and Systems). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 76(3). 387–398.1 indexed citations
13.
Onaga, Kenji, Manuel Silva, & Toshimasa Watanabe. (1993). Qualitative Analysis of Periodic Schedules for Deterministically Timed Petri Net Systems (Special Section on Discrete Mathematics and Its Applications). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 76(4). 580–592.3 indexed citations
14.
Watanabe, Toshimasa, et al.. (1992). A Linear-Time Algorithm for Computing All 3-Edge-Connected Components of a Multigraph. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 75(3). 410–424.14 indexed citations
15.
Onaga, Kenji, et al.. (1992). A Method for Tumor Shape Extraction from X-Ray Mammography.. Machine Vision and Applications. 133–136.1 indexed citations
16.
Onaga, Kenji, et al.. (1992). Proof Procedures and Axiom Sets in Petri Net Models of Horn Clause Propositional Logic --Provability and Axiom Sets --. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 425–435.2 indexed citations
17.
Watanabe, Toshimasa, et al.. (1989). Time complexity of legal firing sequence and related problems of Petri nets. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 72(12). 1400–1409.21 indexed citations
18.
Watanabe, Toshimasa, et al.. (1989). Minimum Initial Marking Problems of Petri Nets. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 72(12). 1390–1399.14 indexed citations
Onaga, Kenji, et al.. (1986). A wavefront algorithm for LU decomposition of a partitioned matrix on VLSI processor. Journal of Parallel and Distributed Computing. 3(2). 158–182.2 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.