dblp.uni-trier.dewww.uni-trier.de

Toru Hasunuma

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
19EEToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: An Algorithm for L(2, 1)-Labeling of Trees. SWAT 2008: 185-197
18EEToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A linear time algorithm for L(2,1)-labeling of trees CoRR abs/0810.0906: (2008)
2007
17EEToru Hasunuma: Queue layouts of iterated line directed graphs. Discrete Applied Mathematics 155(9): 1141-1154 (2007)
16EEToru Hasunuma, Misa Hirota: An improved upper bound on the queuenumber of the hypercube. Inf. Process. Lett. 104(2): 41-44 (2007)
2004
15EEToru 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
14EEToru Hasunuma: Laying Out Iterated Line Digraphs Using Queues. Graph Drawing 2003: 202-213
2002
13EEToru Hasunuma: Completely Independent Spanning Trees in Maximal Planar Graphs. WG 2002: 235-245
12EEToru 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)
10EEToru Hasunuma: Completely independent spanning trees in the underlying graph of a line digraph. Discrete Mathematics 234(1-3): 149-157 (2001)
9EEToru 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
7EEYukio Shibata, Toru Hasunuma, Sanae Fukuda: Isomorphic factorization of de Bruijn digraphs. Discrete Mathematics 218(1-3): 199-208 (2000)
6EEToru 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
4EEHiroshi Nagamochi, Toru Hasunuma: An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. ISAAC 1998: 447-456
1997
3EEToru Hasunuma, Yukio Shibata: Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. Discrete Applied Mathematics 78(1-3): 103-116 (1997)
2EEToru Hasunuma, Yukio Shibata: Containment of Butterflies in Networks Constructed by the Line Digraph Operation. Inf. Process. Lett. 61(1): 25-30 (1997)
1EEToru Hasunuma, Yukio Shibata: Counting small cycles in generalized de Bruijn digraphs. Networks 29(1): 39-47 (1997)

Coauthor Index

1Sanae Fukuda [7]
2Misa Hirota [16]
3Toshimasa Ishii [18] [19]
4Yosuke Kikuchi [15]
5Takeshi Mori [15]
6Hiroshi Nagamochi [4] [5] [8] [11]
7Hirotaka Ono [18] [19]
8Yukio Shibata [1] [2] [3] [7] [15]
9Yushi Uno [18] [19]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)