The number of labeled graphs placeable by a given permutation. - Toru Hasunuma; Yukio Shibata (J. Graph Theory, 1996)

Remarks on the placeability of isomorphic trees in a complete graph. - Toru Hasunuma; Yukio Shibata (J. Graph Theory, 1996)

Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. - Toru Hasunuma; Yukio Shibata (Discret. Appl. Math., 1997)

Containment of Butterflies in Networks Constructed by the Line Digraph Operation. - Toru Hasunuma; Yukio Shibata (Inf. Process. Lett., 1997)

Counting small cycles in generalized de Bruijn digraphs. - Toru Hasunuma; Yukio Shibata (Networks, 1997)

Isomorphic factorization of de Bruijn digraphs. - Yukio Shibata; Toru Hasunuma; Sanae Fukuda (Discret. Math., 2000)

On edge-disjoint spanning trees with small depths. - Toru Hasunuma (Inf. Process. Lett., 2000)

Independent spanning trees with small depths in iterated line digraphs. - Toru Hasunuma; Hiroshi Nagamochi (Discret. Appl. Math., 2001)

Completely independent spanning trees in the underlying graph of a line digraph. - Toru Hasunuma (Discret. Math., 2001)

Independent spanning cycle-rooted trees in the cartesian product of digraphs. - Toru Hasunuma (Electron. Notes Discret. Math., 2001)

An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. - Hiroshi Nagamochi; Toru Hasunuma (J. Algorithms, 2001)

Completely Independent Spanning Trees in Maximal Planar Graphs. - Toru Hasunuma (WG, 2002)

Embedding iterated line digraphs in books. - Toru Hasunuma (Networks, 2002)

Laying Out Iterated Line Digraphs Using Queues. - Toru Hasunuma (GD, 2003)

On the number of cycles in generalized Kautz digraphs. - Toru Hasunuma; Yosuke Kikuchi; Takeshi Mori; Yukio Shibata (Discret. Math., 2004)

Queue layouts of iterated line directed graphs. - Toru Hasunuma (Discret. Appl. Math., 2007)

An improved upper bound on the queuenumber of the hypercube. - Toru Hasunuma; Misa Hirota (Inf. Process. Lett., 2007)

An Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (SWAT, 2008)

A linear time algorithm for L(2,1)-labeling of trees - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (CoRR, 2008)

A Linear Time Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (ESA, 2009)

A tight upper bound on the (2,1)-total labeling number of outerplanar graphs - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (CoRR, 2009)

Improved book-embeddings of incomplete hypercubes. - Toru Hasunuma (Discret. Appl. Math., 2009)

An O(n1.75) algorithm for L(2, 1)-labeling of trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Theor. Comput. Sci., 2009)

The (p, q)-total Labeling Problem for Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (ISAAC (2), 2010)

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (IWOCA, 2010)

Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. - Toru Hasunuma; Hiroshi Nagamochi (WG, 2011)

On the (h, k)-domination numbers of iterated line digraphs. - Toru Hasunuma; Mayu Otani (Discret. Appl. Math., 2012)

The (p, q)-total labeling problem for trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Math., 2012)

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (J. Discrete Algorithms, 2012)

Completely independent spanning trees in torus networks. - Toru Hasunuma; Chie Morisaka (Networks, 2012)

A Linear Time Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Algorithmica, 2013)

Algorithmic aspects of distance constrained labeling: a survey. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Int. J. Netw. Comput., 2014)

Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees. - Toru Hasunuma (IWOCA, 2015)

Structural properties of subdivided-line graphs. - Toru Hasunuma (J. Discrete Algorithms, 2015)

Constructions of universalized Sierpiński graphs based on labeling manipulations. - Toru Hasunuma (Electron. Notes Discret. Math., 2017)

Connectivity keeping trees in 2-connected graphs. - Toru Hasunuma; Kosuke Ono (J. Graph Theory, 2020)

Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k. - Toru Hasunuma (IWOCA, 2021)

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. - Toru Hasunuma (Algorithmica, 2021)

Connectivity preserving trees in k-connected or k-edge-connected graphs. - Toru Hasunuma (J. Graph Theory, 2023)

Completely Independent Spanning Trees in Line Graphs. - Toru Hasunuma (Graphs Comb., 2023)

Connectivity Preserving Hamiltonian Cycles in k-Connected Dirac Graphs. - Toru Hasunuma (Graphs Comb., 2025)

Exponentiation of Graphs. - Toru Hasunuma (Math. Comput. Sci., 2025)