Toru Hasunuma

Profile Information

Affiliation: Research Associate, Former Institution /Organization Faculty of Electro-Communications Department of Computer Science

Degree: 博士(工学)(群馬大学)

J-GLOBAL ID: 200901051699725392
researchmap Member ID: 1000281839

Research Areas

Informatics / Information theory /

Research History

May, 2017 - Present

The University of Tokushima
Apr, 2004

Faculty of Integrated Arts and Sciences, Department of Mathematical and Natural Sciences, The University of Tokushima
Feb, 1999 - Mar, 2004

電気通信大学情報工学科助手
Apr, 1997 - Jan, 1999

Graduate School of Engineering, Kyoto University
Apr, 1992 - Mar, 1993

Hitachi, Ltd.,

Education

- 1996

Gunma University
- 1996

Graduate School, Division of Engineering, Gunma University
- 1992

Gunma University
- 1992

Graduate School, Division of Engineering, Gunma University
- 1990

Gunma University
- 1990

Faculty of Engineering, Gunma University

Papers

Constructions of universalized Sierpiński graphs based on labeling manipulations

Toru Hasunuma

Electronic Notes in Discrete Mathematics, 60 47-54, Jul 1, 2017 Peer-reviewed
Minimum degree conditions and optimal graphs for completely independent spanning trees

Toru Hasunuma

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9538 260-273, 2016 Peer-reviewed
Structural properties of subdivided-line graphs

Toru Hasunuma

Journal of Discrete Algorithms, 31 69-86, Mar 1, 2015 Peer-reviewed
A Linear Time Algorithm for L(2,1)-Labeling of Trees

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

ALGORITHMICA, 66(3) 654-681, Jul, 2013 Peer-reviewed
Structural properties of subdivided-line graphs

Toru Hasunuma

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8288 216-229, 2013 Peer-reviewed
Completely independent spanning trees in torus networks

Toru Hasunuma, Chie Morisaka

NETWORKS, 60(1) 59-69, Aug, 2012 Peer-reviewed
On the (h, k)-domination numbers of iterated line digraphs

Toru Hasunuma, Mayu Otani

DISCRETE APPLIED MATHEMATICS, 160(12) 1859-1863, Aug, 2012 Peer-reviewed
A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Journal of Discrete Algorithms, 14 189-206, Jul, 2012 Peer-reviewed
The (p, q)-total labeling problem for trees

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

DISCRETE MATHEMATICS, 312(8) 1407-1420, Apr, 2012 Peer-reviewed
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs.

Toru Hasunuma, Hiroshi Nagamochi

Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, 203-214, 2011 Peer-reviewed
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, 103-106, 2010 Peer-reviewed
The (p, q)-total Labeling Problem for Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II, 49-60, 2010 Peer-reviewed
An O(n(1.75)) algorithm for L(2,1)-labeling of trees

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

THEORETICAL COMPUTER SCIENCE, 410(38-40) 3702-3710, Sep, 2009 Peer-reviewed
Improved book-embeddings of incomplete hypercubes

Toru Hasunuma

DISCRETE APPLIED MATHEMATICS, 157(7) 1423-1431, Apr, 2009 Peer-reviewed
A Linear Time Algorithm for L(2, 1)-Labeling of Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 35-46, 2009 Peer-reviewed
An Algorithm for L(2, 1)-Labeling of Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, 185-197, 2008 Peer-reviewed
An improved upper bound on the queuenumber of the hypercube

Toru Hasunuma, Misa Hirota

INFORMATION PROCESSING LETTERS, 104(2) 41-44, Oct, 2007 Peer-reviewed
Queue layouts of iterated line directed graphs

Toru Hasunuma

DISCRETE APPLIED MATHEMATICS, 155(9) 1141-1154, May, 2007 Peer-reviewed
On the number of cycles in generalized Kautz digraphs

T Hasunuma, Y Kikuchi, T Mori, Y Shibata

DISCRETE MATHEMATICS, 285(1-3) 127-140, Aug, 2004 Peer-reviewed
Laying Out Iterated Line Digraphs Using Queues.

Toru Hasunuma

Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers, 202-213, 2003 Peer-reviewed

Misc.

Independent spanning trees with small depths in iterated line digraphs

Toru Hasunuma, Hiroshi Nagamochi

Discrete Applied Mathematics, 110(2-3) 189-211, Jun 15, 2001
Completely independent spanning trees in the underlying graph of a line digraph

Toru Hasunuma

Discrete Mathematics, 234(1-3) 149-157, May 6, 2001
Independent spanning cycle-rooted trees in the cartesian product of digraphs

Electronic Notes in Discrete Mathematics, Proceedings of Brazilian Symposium on Graphs, Algorithms and Combinatiorics, 7, Mar, 2001
Finding completely independent spanning trees in maximal planar graphs

Jan, 2001
An Efficient script N signScript C sign Algorithm for a Sparse k-Edge-Connectivity Certificate

Hiroshi Nagamochi, Toru Hasunuma

Journal of Algorithms, 38(2) 354-373, 2001
On edge-disjoint spanning trees with small depths

Information Processing Letters, 75(1/2) 71-74, Jul, 2000
Isomorphic factorization of de Bruijn digraphs

Y Shibata, T Hasunuma, S Fukuda

DISCRETE MATHEMATICS, 218(1-3) 199-208, May, 2000
Completely independent spanning trees in the underlying graph of a line digraph

41-48, Jan, 2000
The pagenumber of de Bruijn and Kautz digraphs

HASUNUMA T.

Australian Computer Science Communications Vol. 21, NO. 3 Combinatorics, Computation and Logic (Proceedings of DMTCS'99 and CATS'99), Springer-Verlag, 21(3) 232-246, 1999
An efficient NC algorithm for a sparse k-edge-connectivity certificate(共著)

Lecture Notes in Computer Science 1533, Algorithms and Computation(Proceedings of ISAAC'98), Springer-Verlag, 447-456, 1998
Independent spanning trees with small depths in iterated line digraphs(共著)

Australian Computer Communications Vol. 20, No. 3 Computing Theory (Proceedings of CATS'98), Springer-Verlag, 20(3) 21-35, 1998
Embedding de Bruijn, Kautz and shuffle-exchange networks in books(共著)

Discrete Applied Mathematics, 78 103-116, 1997
Containment of butterflies in networks constructed by the line digraph operation(共著)

Information Processing Letters, 61(1) 25-30, 1997
Counting small cycles in generalized de Bruijn digraphs(共著)

Networks, 29(1) 39-47, 1997
Remarks on the placeability of isomorphic trees in a complete graph

T Hasunuma, Y Shibata

JOURNAL OF GRAPH THEORY, 21(1) 41-42, Jan, 1996
The number of labeled graphs placeable by a given permutation(共著)

Journal of Graph Theory, 21 11-19, 1996

Profile Information

Research Areas

Research History

Education

Papers

Misc.

Research Projects

Menu