Toru Araki

514 total citations
32 papers, 372 citations indexed

About

Toru Araki is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Toru Araki has authored 32 papers receiving a total of 372 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 14 papers in Computer Networks and Communications and 10 papers in Electrical and Electronic Engineering. Recurrent topics in Toru Araki's work include Advanced Graph Theory Research (19 papers), Interconnection Networks and Systems (11 papers) and Complexity and Algorithms in Graphs (10 papers). Toru Araki is often cited by papers focused on Advanced Graph Theory Research (19 papers), Interconnection Networks and Systems (11 papers) and Complexity and Algorithms in Graphs (10 papers). Toru Araki collaborates with scholars based in Japan. Toru Araki's co-authors include Yukio Shibata, Yota Otachi, Yuuki Tanaka, Masao Mukaidono, F. Yamamoto, Kosuke Nakamura, Yoshiaki Kikuchi, Kenji Onaga, Takao Watanabe and Kunihiko Iwamoto and has published in prestigious journals such as Information Sciences, IEEE Transactions on Computers and Networks.

In The Last Decade

Toru Araki

27 papers receiving 367 citations

Peers

Toru Araki

CNC

CTM

EEE

HA

GT

Chin-Wen Ho Taiwan

Junming Xu China

Zhizhang Shen United States

Tzu-Liang Kung Taiwan

Hyeong-Seok Lim South Korea

S.A. Choudum India

Lih-Hsing Hsu Taiwan

Jinn‐Shyong Yang Taiwan

Shyue-Ming Tang Taiwan

Marc J. Lipman United States

Chin-Wen Ho Taiwan

Toru Araki

348 ×1.3

CNC

230 ×1.2

CTM

146 ×1.1

EEE

88 ×1.5

HA

23 ×0.5

GT

Citations per year, relative to Toru Araki Toru Araki (= 1×) peers Chin-Wen Ho

Countries citing papers authored by Toru Araki

Since Specialization

Citations

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

Fields of papers citing papers by Toru Araki

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Toru Araki

This figure shows the co-authorship network connecting the top 25 collaborators of Toru Araki. A scholar is included among the top collaborators of Toru Araki 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 Toru Araki. Toru Araki is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Araki, Toru, et al.. (2023). Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang. Discrete Applied Mathematics. 334. 139–144.

2.

Nakamura, Kosuke & Toru Araki. (2020). Partitioning vertices into in- and out-dominating sets in digraphs. Discrete Applied Mathematics. 285. 43–54. 1 indexed citations

3.

Araki, Toru, et al.. (2019). Secure domination in cographs. Discrete Applied Mathematics. 262. 179–184. 6 indexed citations

4.

Araki, Toru, et al.. (2018). Secure domination in proper interval graphs. Discrete Applied Mathematics. 247. 70–76. 13 indexed citations

5.

Araki, Toru, et al.. (2017). On the secure domination numbers of maximal outerplanar graphs. Discrete Applied Mathematics. 236. 23–29. 14 indexed citations

6.

Araki, Toru, et al.. (2015). Completely independent spanning trees in (partial) k-trees. Discussiones Mathematicae Graph Theory. 35(3). 427–427. 22 indexed citations

7.

Araki, Toru. (2013). Dirac's Condition for Completely Independent Spanning Trees. Journal of Graph Theory. 77(3). 171–179. 48 indexed citations

8.

Araki, Toru. (2009). Labeling bipartite permutation graphs with a condition at distance two. Discrete Applied Mathematics. 157(8). 1677–1686. 11 indexed citations

9.

Araki, Toru. (2009). Connected k-tuple twin domination in de Bruijn and Kautz digraphs. Discrete Mathematics. 309(21). 6229–6234. 2 indexed citations

10.

Araki, Toru, et al.. (2008). RFID localization for the visually impaired. World Automation Congress. 1–6. 9 indexed citations

11.

Araki, Toru. (2008). The k-tuple twin domination in de Bruijn and Kautz digraphs. Discrete Mathematics. 308(24). 6406–6413. 11 indexed citations

12.

Araki, Toru. (2007). A linear time algorithm for finding the minimum paired-dominating set in series-parallel graphs. IPSJ SIG Notes. 2007(40). 15–22. 3 indexed citations

13.

Araki, Toru. (2007). On the k-tuple domination of de Bruijn and Kautz digraphs. Information Processing Letters. 104(3). 86–90. 11 indexed citations

14.

Kikuchi, Yoshiaki & Toru Araki. (2006). Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs. e88 a. 46–51. 2 indexed citations

15.

Araki, Toru. (2006). Hyper hamiltonian laceability of Cayley graphs generated by transpositions. Networks. 48(3). 121–124. 34 indexed citations

16.

Araki, Toru & Yukio Shibata. (2003). (t, k)-diagnosable system: a generalization of the pmc models. IEEE Transactions on Computers. 52(7). 972–976. 45 indexed citations

17.

Araki, Toru & Yukio Shibata. (2002). Optimal Diagnosable Systems on Cayley Graphs. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(2). 455–462. 2 indexed citations

18.

Araki, Toru & Yukio Shibata. (2000). Diagnosability of Networks Represented by the Cartesian Product. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 83(3). 465–470. 9 indexed citations

19.

Araki, Toru & Yukio Shibata. (1999). Isomorphic factorization of complete bipartite graph into forest.. Ars Combinatoria. 53. 1 indexed citations

20.

Araki, Toru, et al.. (1978). Analysis of latch-up in CMOS IC. Electronics and Communications in Japan. 61. 105–113.

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