| * | 2009 |
|---|
| 22 | EE | Toru Hasunuma,
Toshimasa Ishii,
Hirotaka Ono,
Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees.
ESA 2009: 35-46 |
| 21 | EE | Toru Hasunuma:
Improved book-embeddings of incomplete hypercubes.
Discrete Applied Mathematics 157(7): 1423-1431 (2009) |
| 20 | EE | Toru Hasunuma,
Toshimasa Ishii,
Hirotaka Ono,
Yushi Uno:
An O(n1.75) algorithm for L(2, 1)-labeling of trees.
Theor. Comput. Sci. 410(38-40): 3702-3710 (2009) |
| 2008 |
|---|
| 19 | EE | Toru Hasunuma,
Toshimasa Ishii,
Hirotaka Ono,
Yushi Uno:
An Algorithm for L(2, 1)-Labeling of Trees.
SWAT 2008: 185-197 |
| 18 | EE | Toru Hasunuma,
Toshimasa Ishii,
Hirotaka Ono,
Yushi Uno:
A linear time algorithm for L(2,1)-labeling of trees
CoRR abs/0810.0906: (2008) |
| 2007 |
|---|
| 17 | EE | Toru Hasunuma:
Queue layouts of iterated line directed graphs.
Discrete Applied Mathematics 155(9): 1141-1154 (2007) |
| 16 | EE | Toru Hasunuma,
Misa Hirota:
An improved upper bound on the queuenumber of the hypercube.
Inf. Process. Lett. 104(2): 41-44 (2007) |
| 2004 |
|---|
| 15 | EE | Toru Hasunuma,
Yosuke Kikuchi,
Takeshi Mori,
Yukio Shibata:
On the number of cycles in generalized Kautz digraphs.
Discrete Mathematics 285(1-3): 127-140 (2004) |
| 2003 |
|---|
| 14 | EE | Toru Hasunuma:
Laying Out Iterated Line Digraphs Using Queues.
Graph Drawing 2003: 202-213 |
| 2002 |
|---|
| 13 | EE | Toru Hasunuma:
Completely Independent Spanning Trees in Maximal Planar Graphs.
WG 2002: 235-245 |
| 12 | EE | Toru Hasunuma:
Embedding iterated line digraphs in books.
Networks 40(2): 51-62 (2002) |
| 2001 |
|---|
| 11 | | Toru Hasunuma,
Hiroshi Nagamochi:
Independent spanning trees with small depths in iterated line digraphs.
Discrete Applied Mathematics 110(2-3): 189-211 (2001) |
| 10 | EE | Toru Hasunuma:
Completely independent spanning trees in the underlying graph of a line digraph.
Discrete Mathematics 234(1-3): 149-157 (2001) |
| 9 | EE | Toru Hasunuma:
Independent spanning cycle-rooted trees in the cartesian product of digraphs.
Electronic Notes in Discrete Mathematics 7: 106-109 (2001) |
| 8 | | Hiroshi Nagamochi,
Toru Hasunuma:
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.
J. Algorithms 38(2): 354-373 (2001) |
| 2000 |
|---|
| 7 | EE | Yukio Shibata,
Toru Hasunuma,
Sanae Fukuda:
Isomorphic factorization of de Bruijn digraphs.
Discrete Mathematics 218(1-3): 199-208 (2000) |
| 6 | EE | Toru Hasunuma:
On edge-disjoint spanning trees with small depths.
Inf. Process. Lett. 75(1-2): 71-74 (2000) |
| 1998 |
|---|
| 5 | | Toru Hasunuma,
Hiroshi Nagamochi:
Independent Spanning Trees with Small Depths in Iterated Line Digraphs.
CATS 1998: 21-36 |
| 4 | EE | Hiroshi Nagamochi,
Toru Hasunuma:
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.
ISAAC 1998: 447-456 |
| 1997 |
|---|
| 3 | EE | Toru Hasunuma,
Yukio Shibata:
Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books.
Discrete Applied Mathematics 78(1-3): 103-116 (1997) |
| 2 | EE | Toru Hasunuma,
Yukio Shibata:
Containment of Butterflies in Networks Constructed by the Line Digraph Operation.
Inf. Process. Lett. 61(1): 25-30 (1997) |
| 1 | EE | Toru Hasunuma,
Yukio Shibata:
Counting small cycles in generalized de Bruijn digraphs.
Networks 29(1): 39-47 (1997) |
