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

Toru Hasunuma Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: The (p, q)-total labeling problem for trees. Discrete Mathematics 312(8): 1407-1420 (2012)
2011
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Hiroshi Nagamochi: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. WG 2011: 203-214
2010
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: The (p, q)-total Labeling Problem for Trees. ISAAC (2) 2010: 49-60
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA 2010: 103-106
2009
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A Linear Time Algorithm for L(2, 1)-Labeling of Trees. ESA 2009: 35-46
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A tight upper bound on the (2,1)-total labeling number of outerplanar graphs CoRR abs/0911.4590: (2009)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma: Improved book-embeddings of incomplete hypercubes. Discrete Applied Mathematics 157(7): 1423-1431 (2009)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru 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
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: An Algorithm for L(2, 1)-Labeling of Trees. SWAT 2008: 185-197
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A linear time algorithm for L(2,1)-labeling of trees CoRR abs/0810.0906: (2008)
2007
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma: Queue layouts of iterated line directed graphs. Discrete Applied Mathematics 155(9): 1141-1154 (2007)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Misa Hirota: An improved upper bound on the queuenumber of the hypercube. Inf. Process. Lett. 104(2): 41-44 (2007)
2004
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru 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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma: Laying Out Iterated Line Digraphs Using Queues. Graph Drawing 2003: 202-213
2002
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma: Completely Independent Spanning Trees in Maximal Planar Graphs. WG 2002: 235-245
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma: Embedding iterated line digraphs in books. Networks 40(2): 51-62 (2002)
2001
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Hiroshi Nagamochi: Independent spanning trees with small depths in iterated line digraphs. Discrete Applied Mathematics 110(2-3): 189-211 (2001)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma: Completely independent spanning trees in the underlying graph of a line digraph. Discrete Mathematics 234(1-3): 149-157 (2001)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma: Independent spanning cycle-rooted trees in the cartesian product of digraphs. Electronic Notes in Discrete Mathematics 7: 106-109 (2001)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHiroshi Nagamochi, Toru Hasunuma: An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. J. Algorithms 38(2): 354-373 (2001)
2000
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYukio Shibata, Toru Hasunuma, Sanae Fukuda: Isomorphic factorization of de Bruijn digraphs. Discrete Mathematics 218(1-3): 199-208 (2000)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma: On edge-disjoint spanning trees with small depths. Inf. Process. Lett. 75(1-2): 71-74 (2000)
1998
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Hiroshi Nagamochi: Independent Spanning Trees with Small Depths in Iterated Line Digraphs. CATS 1998: 21-36
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHiroshi Nagamochi, Toru Hasunuma: An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. ISAAC 1998: 447-456
1997
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Yukio Shibata: Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. Discrete Applied Mathematics 78(1-3): 103-116 (1997)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru Hasunuma, Yukio Shibata: Containment of Butterflies in Networks Constructed by the Line Digraph Operation. Inf. Process. Lett. 61(1): 25-30 (1997)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToru 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] [20] [22] [23] [24] [25] [27]
4Yosuke Kikuchi [15]
5Takeshi Mori [15]
6Hiroshi Nagamochi [4] [5] [8] [11] [26]
7Hirotaka Ono [18] [19] [20] [22] [23] [24] [25] [27]
8Yukio Shibata [1] [2] [3] [7] [15]
9Yushi Uno [18] [19] [20] [22] [23] [24] [25] [27]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page