Toru Hasunuma

According to our database, Toru Hasunuma authored at least 40 papers between 1996 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Completely Independent Spanning Trees in Line Graphs.

Toru Hasunuma

Graphs Comb., August, 2023

Connectivity preserving trees in <i>k</i>-connected or <i>k</i>-edge-connected graphs.

Toru Hasunuma

J. Graph Theory, 2023

2021

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions.

Toru Hasunuma

Algorithmica, 2021

Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k.

Toru Hasunuma

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Connectivity keeping trees in 2-connected graphs.

Toru Hasunuma, Kosuke Ono

J. Graph Theory, 2020

2017

Constructions of universalized Sierpiński graphs based on labeling manipulations.

Toru Hasunuma

Electron. Notes Discret. Math., 2017

2015

Structural properties of subdivided-line graphs.

Toru Hasunuma

J. Discrete Algorithms, 2015

Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees.

Toru Hasunuma

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

Algorithmic aspects of distance constrained labeling: a survey.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Int. J. Netw. Comput., 2014

2013

A Linear Time Algorithm for L(2, 1)-Labeling of Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Algorithmica, 2013

2012

Completely independent spanning trees in torus networks.

Toru Hasunuma, Chie Morisaka

Networks, 2012

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

J. Discrete Algorithms, 2012

The (p, q)-total labeling problem for trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Discret. Math., 2012

On the (h, k)-domination numbers of iterated line digraphs.

Toru Hasunuma, Mayu Otani

Discret. Appl. Math., 2012

2011

Improved Bounds for Minimum Fault-Tolerant Gossip Graphs.

Toru Hasunuma, Hiroshi Nagamochi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

The (<i>p</i>, <i>q</i>)-total Labeling Problem for Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

An O(n^1.75) algorithm for L(2, 1)-labeling of trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Theor. Comput. Sci., 2009

Improved book-embeddings of incomplete hypercubes.

Toru Hasunuma

Discret. Appl. Math., 2009

A tight upper bound on the (2,1)-total labeling number of outerplanar graphs

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

CoRR, 2009

A Linear Time Algorithm for <i>L</i>(2, 1)-Labeling of Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Proceedings of the Algorithms, 2009

2008

A linear time algorithm for L(2,1)-labeling of trees

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

CoRR, 2008

An Algorithm for L(2, 1)-Labeling of Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Proceedings of the Algorithm Theory, 2008

2007

An improved upper bound on the queuenumber of the hypercube.

Toru Hasunuma, Misa Hirota

Inf. Process. Lett., 2007

Queue layouts of iterated line directed graphs.

Toru Hasunuma

Discret. Appl. Math., 2007

2004

On the number of cycles in generalized Kautz digraphs.

Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori, Yukio Shibata

Discret. Math., 2004

2003

Laying Out Iterated Line Digraphs Using Queues.

Toru Hasunuma

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Embedding iterated line digraphs in books.

Toru Hasunuma

Networks, 2002

Completely Independent Spanning Trees in Maximal Planar Graphs.

Toru Hasunuma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.

Hiroshi Nagamochi, Toru Hasunuma

J. Algorithms, 2001

Independent spanning cycle-rooted trees in the cartesian product of digraphs.

Toru Hasunuma

Electron. Notes Discret. Math., 2001

Completely independent spanning trees in the underlying graph of a line digraph.

Toru Hasunuma

Discret. Math., 2001

Independent spanning trees with small depths in iterated line digraphs.

Toru Hasunuma, Hiroshi Nagamochi

Discret. Appl. Math., 2001

2000

On edge-disjoint spanning trees with small depths.

Toru Hasunuma

Inf. Process. Lett., 2000

Isomorphic factorization of de Bruijn digraphs.

Yukio Shibata, Toru Hasunuma, Sanae Fukuda

Discret. Math., 2000

1997

Counting small cycles in generalized de Bruijn digraphs.

Toru Hasunuma, Yukio Shibata

Networks, 1997

Containment of Butterflies in Networks Constructed by the Line Digraph Operation.

Toru Hasunuma, Yukio Shibata

Inf. Process. Lett., 1997

Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books.

Toru Hasunuma, Yukio Shibata

Discret. Appl. Math., 1997

1996

Remarks on the placeability of isomorphic trees in a complete graph.

Toru Hasunuma, Yukio Shibata

J. Graph Theory, 1996

The number of labeled graphs placeable by a given permutation.

Toru Hasunuma, Yukio Shibata

J. Graph Theory, 1996