The SCEAS System
| |||||||

## Search the dblp DataBase
Toru Hasunuma:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Toru Hasunuma
**Laying Out Iterated Line Digraphs Using Queues.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2003, pp:202-213 [Conf] - Hiroshi Nagamochi, Toru Hasunuma
**An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.**[Citation Graph (0, 0)][DBLP] ISAAC, 1998, pp:447-456 [Conf] - Toru Hasunuma
**Completely Independent Spanning Trees in Maximal Planar Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2002, pp:235-245 [Conf] - Toru Hasunuma, Hiroshi Nagamochi
**Independent spanning trees with small depths in iterated line digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:189-211 [Journal] - Toru Hasunuma, Yukio Shibata
**Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:103-116 [Journal] - Toru Hasunuma
**Queue layouts of iterated line directed graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:9, pp:1141-1154 [Journal] - Toru Hasunuma
**Completely independent spanning trees in the underlying graph of a line digraph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:234, n:1-3, pp:149-157 [Journal] - Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori, Yukio Shibata
**On the number of cycles in generalized Kautz digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:285, n:1-3, pp:127-140 [Journal] - Yukio Shibata, Toru Hasunuma, Sanae Fukuda
**Isomorphic factorization of de Bruijn digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:218, n:1-3, pp:199-208 [Journal] - Toru Hasunuma
**On edge-disjoint spanning trees with small depths.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:1-2, pp:71-74 [Journal] - Toru Hasunuma, Yukio Shibata
**Containment of Butterflies in Networks Constructed by the Line Digraph Operation.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:25-30 [Journal] - Hiroshi Nagamochi, Toru Hasunuma
**An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:38, n:2, pp:354-373 [Journal] - Toru Hasunuma
**Embedding iterated line digraphs in books.**[Citation Graph (0, 0)][DBLP] Networks, 2002, v:40, n:2, pp:51-62 [Journal] - Toru Hasunuma, Yukio Shibata
**Counting small cycles in generalized de Bruijn digraphs.**[Citation Graph (0, 0)][DBLP] Networks, 1997, v:29, n:1, pp:39-47 [Journal] - Toru Hasunuma, Misa Hirota
**An improved upper bound on the queuenumber of the hypercube.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:104, n:2, pp:41-44 [Journal] **Independent Spanning Trees with Small Depths in Iterated Line Digraphs.**[Citation Graph (, )][DBLP]**A Linear Time Algorithm for**[Citation Graph (, )][DBLP]*L*(2, 1)-Labeling of Trees.**An Algorithm for L(2, 1)-Labeling of Trees.**[Citation Graph (, )][DBLP]**A linear time algorithm for L(2,1)-labeling of trees**[Citation Graph (, )][DBLP]**A tight upper bound on the (2,1)-total labeling number of outerplanar graphs**[Citation Graph (, )][DBLP]**Improved book-embeddings of incomplete hypercubes.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |