Toru Hasunuma

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 9

Top Topics

Connected Graphs

Reachability Queries

Tree Structures

Minimum Spanning Trees

Top Venues

J. Graph Theory

Electron. Notes Discret. Math.

Publications

Toru Hasunuma
-edge-connected graphs. J. Graph Theory 102 (3) (2023)
Toru Hasunuma
Completely Independent Spanning Trees in Line Graphs. Graphs Comb. 39 (4) (2023)
Toru Hasunuma
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. Algorithmica 83 (9) (2021)
Toru Hasunuma
Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k. IWOCA (2021)
Toru Hasunuma, Kosuke Ono
Connectivity keeping trees in 2-connected graphs. J. Graph Theory 94 (1) (2020)
Toru Hasunuma
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. IWOCA (2020)
Toru Hasunuma
Constructions of universalized Sierpiński graphs based on labeling manipulations. Electron. Notes Discret. Math. 60 (2017)
Toru Hasunuma
Structural properties of subdivided-line graphs. J. Discrete Algorithms 31 (2015)
Toru Hasunuma
Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees. IWOCA (2015)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. 4 (2) (2014)
Toru Hasunuma
Structural Properties of Subdivided-Line Graphs. IWOCA (2013)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66 (3) (2013)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. J. Discrete Algorithms 14 (2012)
Toru Hasunuma, Mayu Otani
On the (h, k)-domination numbers of iterated line digraphs. Discret. Appl. Math. 160 (12) (2012)
Toru Hasunuma, Chie Morisaka
Completely independent spanning trees in torus networks. Networks 60 (1) (2012)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
The (p, q)-total labeling problem for trees. Discret. Math. 312 (8) (2012)
Toru Hasunuma, Hiroshi Nagamochi
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. WG (2011)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
)-total Labeling Problem for Trees. ISAAC (2) (2010)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA (2010)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs CoRR (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(2, 1)-Labeling of Trees. ESA (2009)
Toru Hasunuma
Improved book-embeddings of incomplete hypercubes. Discret. Appl. Math. 157 (7) (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci. 410 (38-40) (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A linear time algorithm for L(2,1)-labeling of trees CoRR (2008)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
An Algorithm for L(2, 1)-Labeling of Trees. SWAT (2008)
Toru Hasunuma
Queue layouts of iterated line directed graphs. Discret. Appl. Math. 155 (9) (2007)
Toru Hasunuma, Misa Hirota
An improved upper bound on the queuenumber of the hypercube. Inf. Process. Lett. 104 (2) (2007)
Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori, Yukio Shibata
On the number of cycles in generalized Kautz digraphs. Discret. Math. 285 (1-3) (2004)
Toru Hasunuma
Laying Out Iterated Line Digraphs Using Queues. Graph Drawing (2003)
Toru Hasunuma
Embedding iterated line digraphs in books. Networks 40 (2) (2002)
Toru Hasunuma
Completely Independent Spanning Trees in Maximal Planar Graphs. WG (2002)
Toru Hasunuma
Independent spanning cycle-rooted trees in the cartesian product of digraphs. Electron. Notes Discret. Math. 7 (2001)
Toru Hasunuma, Hiroshi Nagamochi
Independent spanning trees with small depths in iterated line digraphs. Discret. Appl. Math. 110 (2-3) (2001)
Hiroshi Nagamochi, Toru Hasunuma
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. J. Algorithms 38 (2) (2001)
Toru Hasunuma
Completely independent spanning trees in the underlying graph of a line digraph. Discret. Math. 234 (1-3) (2001)
Toru Hasunuma
On edge-disjoint spanning trees with small depths. Inf. Process. Lett. 75 (1-2) (2000)
Yukio Shibata, Toru Hasunuma, Sanae Fukuda
Isomorphic factorization of de Bruijn digraphs. Discret. Math. 218 (1-3) (2000)
Toru Hasunuma, Hiroshi Nagamochi
Independent Spanning Trees with Small Depths in Iterated Line Digraphs. CATS (1998)
Hiroshi Nagamochi, Toru Hasunuma
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. ISAAC (1998)
Toru Hasunuma, Yukio Shibata
Containment of Butterflies in Networks Constructed by the Line Digraph Operation. Inf. Process. Lett. 61 (1) (1997)
Toru Hasunuma, Yukio Shibata
Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. Discret. Appl. Math. 78 (1-3) (1997)
Toru Hasunuma, Yukio Shibata
Counting small cycles in generalized de Bruijn digraphs. Networks 29 (1) (1997)
Toru Hasunuma, Yukio Shibata
The number of labeled graphs placeable by a given permutation. J. Graph Theory 21 (1) (1996)
Toru Hasunuma, Yukio Shibata
Remarks on the placeability of isomorphic trees in a complete graph. J. Graph Theory 21 (1) (1996)