The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Toru Hasunuma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Toru Hasunuma
    Laying Out Iterated Line Digraphs Using Queues. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:202-213 [Conf]
  2. 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]
  3. Toru Hasunuma
    Completely Independent Spanning Trees in Maximal Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:235-245 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. Toru Hasunuma
    Embedding iterated line digraphs in books. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:2, pp:51-62 [Journal]
  14. 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]
  15. 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]

  16. Independent Spanning Trees with Small Depths in Iterated Line Digraphs. [Citation Graph (, )][DBLP]


  17. A Linear Time Algorithm for L(2, 1)-Labeling of Trees. [Citation Graph (, )][DBLP]


  18. An Algorithm for L(2, 1)-Labeling of Trees. [Citation Graph (, )][DBLP]


  19. A linear time algorithm for L(2,1)-labeling of trees [Citation Graph (, )][DBLP]


  20. A tight upper bound on the (2,1)-total labeling number of outerplanar graphs [Citation Graph (, )][DBLP]


  21. Improved book-embeddings of incomplete hypercubes. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002