Toru Hasunuma

546 total citations
27 papers, 241 citations indexed

About

Toru Hasunuma is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Geometry and Topology. According to data from OpenAlex, Toru Hasunuma has authored 27 papers receiving a total of 241 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 15 papers in Computer Networks and Communications and 8 papers in Geometry and Topology. Recurrent topics in Toru Hasunuma's work include Advanced Graph Theory Research (19 papers), Interconnection Networks and Systems (13 papers) and Graph Labeling and Dimension Problems (9 papers). Toru Hasunuma is often cited by papers focused on Advanced Graph Theory Research (19 papers), Interconnection Networks and Systems (13 papers) and Graph Labeling and Dimension Problems (9 papers). Toru Hasunuma collaborates with scholars based in Japan. Toru Hasunuma's co-authors include Yukio Shibata, Hirotaka Ono, Yushi Uno, Kosuke Ono and Sanae Fukuda and has published in prestigious journals such as Theoretical Computer Science, Networks and Discrete Applied Mathematics.

In The Last Decade

Toru Hasunuma

25 papers receiving 226 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Toru Hasunuma Japan 8 160 151 91 37 23 27 241
Yota Otachi Japan 9 196 1.2× 104 0.7× 26 0.3× 36 1.0× 21 0.9× 66 244
Paul Bonsma Germany 9 218 1.4× 164 1.1× 42 0.5× 27 0.7× 31 1.3× 27 279
Adele A. Rescigno Italy 10 97 0.6× 235 1.6× 139 1.5× 16 0.4× 3 0.1× 44 318
Zhengke Miao China 8 224 1.4× 44 0.3× 63 0.7× 49 1.3× 61 2.7× 61 253
Paul Dorbec France 11 341 2.1× 89 0.6× 65 0.7× 43 1.2× 88 3.8× 31 375
Curtiss E. Wall United States 4 225 1.4× 62 0.4× 35 0.4× 61 1.6× 69 3.0× 8 277
Zevi Miller United States 9 184 1.1× 63 0.4× 67 0.7× 89 2.4× 71 3.1× 29 261
Ko‐Wei Lih Taiwan 10 206 1.3× 30 0.2× 50 0.5× 63 1.7× 110 4.8× 24 260
Jonathan F. Buss Canada 8 215 1.3× 98 0.6× 33 0.4× 16 0.4× 48 2.1× 20 314
Luérbio Faria Brazil 8 175 1.1× 61 0.4× 37 0.4× 36 1.0× 49 2.1× 56 212

Countries citing papers authored by Toru Hasunuma

Since Specialization
Citations

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

Fields of papers citing papers by Toru Hasunuma

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Toru Hasunuma

This figure shows the co-authorship network connecting the top 25 collaborators of Toru Hasunuma. A scholar is included among the top collaborators of Toru Hasunuma 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 Hasunuma. Toru Hasunuma 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.
Hasunuma, Toru. (2023). Completely Independent Spanning Trees in Line Graphs. Graphs and Combinatorics. 39(5). 1 indexed citations
2.
Hasunuma, Toru & Kosuke Ono. (2019). Connectivity keeping trees in 2‐connected graphs. Journal of Graph Theory. 94(1). 20–29. 11 indexed citations
3.
Hasunuma, Toru. (2017). Constructions of universalized Sierpiński graphs based on labeling manipulations. Electronic Notes in Discrete Mathematics. 60. 47–54. 2 indexed citations
4.
Hasunuma, Toru. (2015). Structural properties of subdivided-line graphs. Journal of Discrete Algorithms. 31. 69–86. 18 indexed citations
5.
Hasunuma, Toru, et al.. (2012). On the (h,k)-domination numbers of iterated line digraphs. Discrete Applied Mathematics. 160(12). 1859–1863. 1 indexed citations
6.
Hasunuma, Toru, et al.. (2012). The (p,q)-total labeling problem for trees. Discrete Mathematics. 312(8). 1407–1420. 6 indexed citations
7.
Hasunuma, Toru, et al.. (2012). A Linear Time Algorithm for L(2,1)-Labeling of Trees. Algorithmica. 66(3). 654–681. 15 indexed citations
8.
Hasunuma, Toru, et al.. (2011). Completely independent spanning trees in torus networks. Networks. 60(1). 59–69. 45 indexed citations
9.
Hasunuma, Toru, et al.. (2011). A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. Journal of Discrete Algorithms. 14. 189–206. 4 indexed citations
10.
Hasunuma, Toru, et al.. (2009). An O(n1.75) algorithm for L(2,1)-labeling of trees. Theoretical Computer Science. 410(38-40). 3702–3710. 10 indexed citations
11.
Hasunuma, Toru, et al.. (2008). An Algorithm for L(2, 1)-Labeling of Trees.. 185–197. 1 indexed citations
12.
Hasunuma, Toru. (2008). Improved book-embeddings of incomplete hypercubes. Discrete Applied Mathematics. 157(7). 1423–1431. 1 indexed citations
13.
Hasunuma, Toru, et al.. (2007). An improved upper bound on the queuenumber of the hypercube. Information Processing Letters. 104(2). 41–44. 6 indexed citations
14.
Hasunuma, Toru. (2006). Queue layouts of iterated line directed graphs. Discrete Applied Mathematics. 155(9). 1141–1154. 6 indexed citations
15.
Hasunuma, Toru, et al.. (2004). On the number of cycles in generalized Kautz digraphs. Discrete Mathematics. 285(1-3). 127–140. 5 indexed citations
16.
Hasunuma, Toru. (2001). Completely independent spanning trees in the underlying graph of a line digraph. Discrete Mathematics. 234(1-3). 149–157. 59 indexed citations
17.
Hasunuma, Toru. (2000). On edge-disjoint spanning trees with small depths. Information Processing Letters. 75(1-2). 71–74. 6 indexed citations
18.
Shibata, Yukio, Toru Hasunuma, & Sanae Fukuda. (2000). Isomorphic factorization of de Bruijn digraphs. Discrete Mathematics. 218(1-3). 199–208. 4 indexed citations
19.
Hasunuma, Toru & Yukio Shibata. (1997). Containment of butterflies in networks constructed by the line digraph operation. Information Processing Letters. 61(1). 25–30. 2 indexed citations
20.
Hasunuma, Toru & Yukio Shibata. (1997). Counting small cycles in generalized de Bruijn digraphs. Networks. 29(1). 39–47. 6 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 Yota Otachi Breakdown of academic impact, for papers by Paul Bonsma Breakdown of academic impact, for papers by Adele A. Rescigno Breakdown of academic impact, for papers by Zhengke Miao Breakdown of academic impact, for papers by Paul Dorbec Breakdown of academic impact, for papers by Curtiss E. Wall Breakdown of academic impact, for papers by Zevi Miller Breakdown of academic impact, for papers by Ko‐Wei Lih Breakdown of academic impact, for papers by Jonathan F. Buss Breakdown of academic impact, for papers by Luérbio Faria
Rankless by CCL
2026