Koichi Wada

797 total citations
52 papers, 246 citations indexed

About

Koichi Wada is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Mechanical Engineering. According to data from OpenAlex, Koichi Wada has authored 52 papers receiving a total of 246 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computer Networks and Communications, 13 papers in Computational Theory and Mathematics and 13 papers in Mechanical Engineering. Recurrent topics in Koichi Wada's work include Optimization and Search Problems (17 papers), Modular Robots and Swarm Intelligence (13 papers) and Energy Efficient Wireless Sensor Networks (10 papers). Koichi Wada is often cited by papers focused on Optimization and Search Problems (17 papers), Modular Robots and Swarm Intelligence (13 papers) and Energy Efficient Wireless Sensor Networks (10 papers). Koichi Wada collaborates with scholars based in Japan, United States and Malaysia. Koichi Wada's co-authors include Taisuke Izumi, Tomoko Saito, A. K. M. Muzahidul Islam, Tomohiro Shibata, K. Tanie, Yoshiaki Katayama, Nobuhiro Inuzuka, Samia Souissi, Xavier Défago and Wei Chen and has published in prestigious journals such as SIAM Journal on Computing, Robotics and Autonomous Systems and Theoretical Computer Science.

In The Last Decade

Koichi Wada

43 papers receiving 235 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Koichi Wada Japan 9 165 53 41 33 27 52 246
Christos Ampatzis Belgium 7 75 0.5× 85 1.6× 12 0.3× 65 2.0× 25 0.9× 18 192
Giovanni C. Pettinaro Switzerland 6 124 0.8× 186 3.5× 16 0.4× 47 1.4× 14 0.5× 13 269
Abraham Prieto Spain 8 34 0.2× 62 1.2× 18 0.4× 118 3.6× 16 0.6× 26 207
Volker Strobel Belgium 6 137 0.8× 37 0.7× 15 0.4× 43 1.3× 3 0.1× 11 223
Onur Soysal United States 6 194 1.2× 103 1.9× 50 1.2× 22 0.7× 4 0.1× 9 228
Cheryl B. Schrader United States 8 28 0.2× 28 0.5× 17 0.4× 14 0.4× 32 1.2× 46 334
A.M. Tyrrell United Kingdom 10 35 0.2× 23 0.4× 28 0.7× 119 3.6× 38 1.4× 27 251
C.-C. Shen United States 8 236 1.4× 5 0.1× 132 3.2× 23 0.7× 6 0.2× 18 297
Naveen Goela United States 9 158 1.0× 37 0.7× 142 3.5× 75 2.3× 24 0.9× 21 380
Robert Gmyr Germany 10 101 0.6× 98 1.8× 13 0.3× 104 3.2× 12 0.4× 24 244

Countries citing papers authored by Koichi Wada

Since Specialization
Citations

This map shows the geographic impact of Koichi Wada'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 Koichi Wada with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Koichi Wada more than expected).

Fields of papers citing papers by Koichi Wada

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Koichi Wada. 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 Koichi Wada. The network helps show where Koichi Wada may publish in the future.

Co-authorship network of co-authors of Koichi Wada

This figure shows the co-authorship network connecting the top 25 collaborators of Koichi Wada. A scholar is included among the top collaborators of Koichi Wada 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 Koichi Wada. Koichi Wada 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.
Défago, Xavier, et al.. (2023). Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space. Robotics and Autonomous Systems. 163. 104378–104378. 4 indexed citations
2.
Okumura, Takashi, Koichi Wada, & Xavier Défago. (2019). Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 2 indexed citations
3.
Wada, Koichi, et al.. (2019). Efficient circuit simulation in MapReduce. Repository for Publications and Research Data (ETH Zurich). 1 indexed citations
4.
Dolev, Shlomi, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, & Koichi Wada. (2019). Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
5.
Izumi, Taisuke, Tomoko Izumi, Hirotaka Ono, & Koichi Wada. (2015). Approximability of minimum certificate dispersal with tree structures. Theoretical Computer Science. 591. 5–14. 2 indexed citations
6.
Izumi, Tomoko, et al.. (2014). Space-efficient self-stabilizing counting population protocols on mobile sensor networks. Theoretical Computer Science. 552. 99–108. 9 indexed citations
7.
Mansoor, Nafees, A. K. M. Muzahidul Islam, Sabariah Baharun, Shozo Komaki, & Koichi Wada. (2013). CoAd: A cluster based adhoc cognitive radio networks architecture with broadcasting protocol. 50. 1–6. 7 indexed citations
8.
Islam, A. K. M. Muzahidul, et al.. (2012). A better dynamic cluster-based structure of wireless sensor network for efficient routing. International journal of innovative computing, information & control. 8. 6747–6760. 10 indexed citations
9.
Hromkovič, Juraj, et al.. (2011). On the approximability and hardness of minimum topic connected overlay and its special instances. Theoretical Computer Science. 429. 144–154. 4 indexed citations
10.
Izumi, Tomoko, Taisuke Izumi, Hirotaka Ono, & Koichi Wada. (2010). Approximability and inapproximability of the minimum certificate dispersal problem. Theoretical Computer Science. 411(31-33). 2773–2783. 2 indexed citations
11.
Souissi, Samia, Taisuke Izumi, & Koichi Wada. (2010). Oracle-based flocking of mobile robots in crash-recovery model. Theoretical Computer Science. 412(33). 4350–4360. 3 indexed citations
12.
Katayama, Yoshiaki, et al.. (2008). Construction and Maintenance of a Novel Cluster-based Architecture for Ad Hoc Sensor Networks.. Ad Hoc & Sensor Wireless Networks. 6. 1–31. 15 indexed citations
13.
Chen, Wei, et al.. (2007). Acknowledged broadcasting and gossiping in ad hoc radio networks. Theoretical Computer Science. 377(1-3). 43–54. 2 indexed citations
14.
Wada, Koichi & Wei Chen. (2004). Optimal fault-tolerant routings with small routing tables for k-connected graphs. Journal of Discrete Algorithms. 2(4). 517–530. 3 indexed citations
15.
Wada, Koichi & Makoto Katoh. (2002). Emotional Memory System using Self-Organizing Maps for Intelligent Robots. 18. 65–68.
16.
Chen, Wei, et al.. (2002). Robust algorithms for constructing strongly convex hulls in parallel. Theoretical Computer Science. 289(1). 277–295. 3 indexed citations
17.
Nakano, Koji, et al.. (2000). Parallel Algorithms for Convex Hull Problems and Their Paradigm. IEICE Transactions on Information and Systems. 83(3). 519–529. 1 indexed citations
18.
Wada, Koichi, et al.. (1998). Efficient algorithms for a mixed k-partition problem of graphs without specifying bases. Theoretical Computer Science. 201(1-2). 233–248. 1 indexed citations
19.
Wada, Koichi. (1994). Efficient algorithms for triconnected graphs and 3-edge-connected graphs. 132–143. 4 indexed citations
20.
Wada, Koichi, et al.. (1992). Efficient fault-tolerant fixed routings on (k+1)-connected digraphs. Discrete Applied Mathematics. 37-38. 539–552. 5 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026