Toru Hasunuma

According to our database1, Toru Hasunuma authored at least 37 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Connectivity keeping trees in 2-connected graphs.
J. Graph Theory, 2020

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2017
Constructions of universalized Sierpiński graphs based on labeling manipulations.
Electron. Notes Discret. Math., 2017

2015
Structural properties of subdivided-line graphs.
J. Discrete Algorithms, 2015

Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Algorithmic aspects of distance constrained labeling: a survey.
Int. J. Netw. Comput., 2014

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

2012
Completely independent spanning trees in torus networks.
Networks, 2012

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

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

On the (h, k)-domination numbers of iterated line digraphs.
Discret. Appl. Math., 2012

2011
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

The (<i>p</i>, <i>q</i>)-total Labeling Problem for Trees.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
An O(n<sup>1.75</sup>) algorithm for L(2, 1)-labeling of trees.
Theor. Comput. Sci., 2009

Improved book-embeddings of incomplete hypercubes.
Discret. Appl. Math., 2009

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

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

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

An Algorithm for L(2, 1)-Labeling of Trees.
Proceedings of the Algorithm Theory, 2008

2007
An improved upper bound on the queuenumber of the hypercube.
Inf. Process. Lett., 2007

Queue layouts of iterated line directed graphs.
Discret. Appl. Math., 2007

2004
On the number of cycles in generalized Kautz digraphs.
Discret. Math., 2004

2003
Laying Out Iterated Line Digraphs Using Queues.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Embedding iterated line digraphs in books.
Networks, 2002

Completely Independent Spanning Trees in Maximal Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.
J. Algorithms, 2001

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

Completely independent spanning trees in the underlying graph of a line digraph.
Discret. Math., 2001

Independent spanning trees with small depths in iterated line digraphs.
Discret. Appl. Math., 2001

2000
On edge-disjoint spanning trees with small depths.
Inf. Process. Lett., 2000

Isomorphic factorization of de Bruijn digraphs.
Discret. Math., 2000

1997
Counting small cycles in generalized de Bruijn digraphs.
Networks, 1997

Containment of Butterflies in Networks Constructed by the Line Digraph Operation.
Inf. Process. Lett., 1997

Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books.
Discret. Appl. Math., 1997

1996
Remarks on the placeability of isomorphic trees in a complete graph.
J. Graph Theory, 1996

The number of labeled graphs placeable by a given permutation.
J. Graph Theory, 1996


  Loading...