Yoichi Iwata

1.6k total citations
26 papers, 492 citations indexed

About

Yoichi Iwata is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Yoichi Iwata has authored 26 papers receiving a total of 492 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computer Networks and Communications, 14 papers in Computational Theory and Mathematics and 8 papers in Electrical and Electronic Engineering. Recurrent topics in Yoichi Iwata's work include Advanced Data Storage Technologies (9 papers), Complexity and Algorithms in Graphs (8 papers) and Advanced Graph Theory Research (6 papers). Yoichi Iwata is often cited by papers focused on Advanced Data Storage Technologies (9 papers), Complexity and Algorithms in Graphs (8 papers) and Advanced Graph Theory Research (6 papers). Yoichi Iwata collaborates with scholars based in Japan, South Korea and United Kingdom. Yoichi Iwata's co-authors include Takuya Akiba, Yuichi Yoshida, F. Masuoka, R. Shirota, Ken‐ichi Kawarabayashi, Takanori Maehara, Magnus Wahlström, Takashi Ida, Y. Itoh and Takanori Hayashi and has published in prestigious journals such as IEEE Journal of Solid-State Circuits, Journal of Applied Crystallography and SIAM Journal on Computing.

In The Last Decade

Yoichi Iwata

25 papers receiving 473 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Yoichi Iwata Japan 11 249 155 127 122 121 26 492
Joseph G. Peters Canada 13 372 1.5× 119 0.8× 186 1.5× 31 0.3× 59 0.5× 48 559
Stéphane Pérennès France 12 409 1.6× 159 1.0× 239 1.9× 47 0.4× 31 0.3× 70 573
Jovan Dj. Golić Serbia 12 152 0.6× 117 0.8× 93 0.7× 47 0.4× 267 2.2× 57 577
Mingyu Xiao China 13 191 0.8× 45 0.3× 255 2.0× 37 0.3× 94 0.8× 82 504
Muyuan Li United States 13 154 0.6× 227 1.5× 93 0.7× 53 0.4× 49 0.4× 28 824
Arya Mazumdar United States 11 362 1.5× 144 0.9× 165 1.3× 32 0.3× 36 0.3× 66 589
Rajat Aggarwal United States 8 152 0.6× 491 3.2× 44 0.3× 50 0.4× 79 0.7× 14 691
Panagiotis Rizomiliotis Greece 11 152 0.6× 135 0.9× 60 0.5× 19 0.2× 54 0.4× 43 363
Fabio Checconi United States 16 389 1.6× 115 0.7× 35 0.3× 28 0.2× 153 1.3× 38 693
Mohsen Ghaffari Switzerland 15 392 1.6× 55 0.4× 380 3.0× 18 0.1× 40 0.3× 77 610

Countries citing papers authored by Yoichi Iwata

Since Specialization
Citations

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

Fields of papers citing papers by Yoichi Iwata

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Yoichi Iwata

This figure shows the co-authorship network connecting the top 25 collaborators of Yoichi Iwata. A scholar is included among the top collaborators of Yoichi Iwata 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 Yoichi Iwata. Yoichi Iwata 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.
Iwata, Yoichi & Yutaro Yamaguchi. (2022). Finding a Shortest Non-Zero Path in Group-Labeled Graphs. COMBINATORICA. 42(S2). 1253–1282. 1 indexed citations
2.
Iwata, Yoichi & Yusuke Kobayashi. (2021). Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. Algorithmica. 83(8). 2503–2520. 4 indexed citations
3.
Iwata, Yoichi & Yusuke Kobayashi. (2019). Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. Kyoto University Research Information Repository (Kyoto University). 2 indexed citations
4.
Iwata, Yoichi, et al.. (2018). On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 96. 14. 4 indexed citations
5.
Akiba, Takuya, et al.. (2016). Cut Tree Construction from Massive Graphs. 775–780. 3 indexed citations
6.
Iwata, Yoichi, Magnus Wahlström, & Yuichi Yoshida. (2016). Half-integrality, LP-branching, and FPT Algorithms. SIAM Journal on Computing. 45(4). 1377–1411. 22 indexed citations
7.
Akiba, Takuya & Yoichi Iwata. (2015). Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover. Theoretical Computer Science. 609. 211–225. 58 indexed citations
8.
Akiba, Takuya, et al.. (2015). Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. Proceedings of the AAAI Conference on Artificial Intelligence. 29(1). 19 indexed citations
9.
Maehara, Takanori, Takuya Akiba, Yoichi Iwata, & Ken‐ichi Kawarabayashi. (2014). Computing personalized PageRank quickly by exploiting graph structures. Proceedings of the VLDB Endowment. 7(12). 1023–1034. 46 indexed citations
10.
Akiba, Takuya, Yoichi Iwata, & Yuichi Yoshida. (2014). Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. 237–248. 60 indexed citations
11.
Akiba, Takuya, Yoichi Iwata, & Yuichi Yoshida. (2013). Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction. 909–918. 36 indexed citations
12.
Iwata, Yoichi & Yuichi Yoshida. (2013). Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
13.
Akiba, Takuya, et al.. (2013). Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. 1601–1606. 45 indexed citations
14.
Iwata, Yoichi, Yusuke Hayashi, Yoshifumi Morita, et al.. (2009). 303 Verification of effectiveness of reducing fatigue of waist by vibration sheet. 2009.58(0). 161–162. 1 indexed citations
15.
Imamiya, K., Yoichi Iwata, Hiroshi Nakamura, et al.. (2002). A 35 ns-cycle-time 3.3 V-only 32 Mb NAND flash EEPROM. 130–131,. 7 indexed citations
16.
Iwata, Yoichi, K. Imamiya, Hiroshi Nakamura, et al.. (1995). A 35 ns cycle time 3.3 V only 32 Mb NAND flash EEPROM. IEEE Journal of Solid-State Circuits. 30(11). 1157–1164. 10 indexed citations
17.
Iwata, Yoichi, Tomoharu Tanaka, Y. Itoh, et al.. (1990). A high-density NAND EEPROM with block-page programming for microcomputer applications. IEEE Journal of Solid-State Circuits. 25(2). 417–424. 10 indexed citations
18.
Iwata, Yoichi, et al.. (1989). A high density NAND EEPROM with block-page programming for microcomputer applications. 10.1/1–10.1/4. 3 indexed citations
19.
Itoh, Y., Ryo Nakayama, Satoshi Inoue, et al.. (1988). New NAND cell for ultra high density 5v-only EEPROMs.. Symposium on VLSI Technology. 33–34. 7 indexed citations
20.
Masuoka, F., et al.. (1987). New ultra high density EPROM and flash EEPROM with NAND structure cell. 552–555. 110 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

Breakdown of academic impact, for papers by Joseph G. Peters Breakdown of academic impact, for papers by Stéphane Pérennès Breakdown of academic impact, for papers by Jovan Dj. Golić Breakdown of academic impact, for papers by Mingyu Xiao Breakdown of academic impact, for papers by Muyuan Li Breakdown of academic impact, for papers by Arya Mazumdar Breakdown of academic impact, for papers by Rajat Aggarwal Breakdown of academic impact, for papers by Panagiotis Rizomiliotis Breakdown of academic impact, for papers by Fabio Checconi Breakdown of academic impact, for papers by Mohsen Ghaffari
Rankless by CCL
2026