検索:
徳島大学 ⟩ 大学院社会産業理工学研究部 ⟩ 理工学域 ⟩ 数理科学系 ⟩ 数理情報分野 ⟩
徳島大学 ⟩ 理工学部 ⟩ 理工学科 ⟩ 数理科学コース ⟩ 数理情報講座 ⟩
徳島大学 ⟩ 教職教育センター ⟩ 		(researchmapへのインポート用ファイル) [PDF解説] [researchmapへの自動反映について]

研究活動

個人のホームページ

専門分野

○ 情報学基礎理論, グラフ理論 (Graph Theory), アルゴリズム論 (Algorithms)

研究テーマ

○ 超並列計算機の相互結合網を含む各種ネットワークの効率や耐故障性に関するグラフ理論的・アルゴリズム論的考察 (ネットワーク (network), グラフ (graph), アルゴリズム (algorithm), 相互結合網, 耐故障性)

著書・論文

著書:

1. 石丸 善康, 伊藤 伸一, 宇野 剛史, 岡村 康弘, 大平 健司, 小野 公輔, 掛井 秀一, 金西 計英, 澤田 麻衣子, 蓮沼 徹, 古屋 S. 玲, 松浦 健二, 松本 和幸, 土岐 順子, 阿部 香織, 山﨑 紅, 辰巳 丈夫, 勝村 幸博 :
情報科学入門,
日経BP社, 東京, 2019年4月.
2. 石丸 善康, 伊藤 伸一, 宇野 剛史, 岡村 康弘, 大平 健司, 小野 公輔, 掛井 秀一, 金西 計英, 澤田 麻衣子, 蓮沼 徹, 古屋 S. 玲, 松浦 健二, 松本 和幸, 土岐 順子, 阿部 香織, 山﨑 紅, 辰巳 丈夫, 勝村 幸博 :
情報科学入門,
日経BP社, 東京, 2018年4月.
3. 小野 公輔, 蓮沼 徹 :
新しく始める 線形代数,
サイエンス社, 東京, 2017年11月.
4. 石丸 善康, 伊藤 伸一, 宇野 剛史, 岡村 康弘, 大平 健司, 小野 公輔, 掛井 秀一, 金西 計英, 澤田 麻衣子, 蓮沼 徹, 古屋 S. 玲, 松浦 健二, 松本 和幸, 土岐 順子, 阿部 香織, 山﨑 紅, 辰巳 丈夫, 勝村 幸博 :
情報科学入門,
日経BP社, 東京, 2017年4月.

学術論文(審査論文):

1. Toru Hasunuma :
Completely independent spanning trees in line graphs,
Graphs and Combinatorics, Vol.39, No.5, 90, 2023.
(DOI: 10.1007/s00373-023-02688-y,   Elsevier: Scopus)
2. Toru Hasunuma :
Connectivity preserving trees in k-connected or k-edge-connected graphs,
Journal of Graph Theory, Vol.102, No.3, 423-435, 2023.
(DOI: 10.1002/jgt.22878,   Elsevier: Scopus)
3. Toru Hasunuma :
Connectivity keeping trees in 2-connected graphs with girth conditions,
Algorithmica, Vol.83, No.9, 2697-2718, 2021.
(DOI: 10.1007/s00453-021-00833-8,   Elsevier: Scopus)
4. Toru Hasunuma and Kosuke Ono :
Connectivity keeping trees in 2-connected graphs,
Journal of Graph Theory, Vol.94, No.1, 20-29, 2020.
(DOI: 10.1002/jgt.22504,   Elsevier: Scopus)
5. Toru Hasunuma :
Structural properties of subdivided-line graphs,
Journal of Discrete Algorithms, Vol.31, 69-86, 2015.
(DOI: 10.1016/j.jda.2015.01.008,   Elsevier: Scopus)
6. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno :
A linear time algorithm for L(2,1)-labeling of trees,
Algorithmica, Vol.66, No.3, 654-681, 2013.
(DOI: 10.1007/s00453-012-9657-z,   Elsevier: Scopus)
7. Toru Hasunuma and Chie Morisaka :
Completely independent spanning trees in torus networks,
Networks, Vol.60, No.1, 59-69, 2012.
(DOI: 10.1002/net.20460,   Elsevier: Scopus)
8. Toru Hasunuma and Mayu Otani :
On the (h,k)-domination numbers of iterated line digraphs,
Discrete Applied Mathematics, Vol.160, No.12, 1859-1863, 2012.
(DOI: 10.1016/j.dam.2012.03.024,   Elsevier: Scopus)
9. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno :
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs,
Journal of Discrete Algorithms, Vol.14, 189-206, 2012.
(DOI: 10.1016/j.jda.2011.12.020,   Elsevier: Scopus)
10. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno :
The (p,q)-total labeling problem for trees,
Discrete Mathematics, Vol.312, 1407-1420, 2012.
(DOI: 10.1016/j.disc.2012.01.007,   Elsevier: Scopus)
11. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno :
An O(n1.75) algorithm for L(2,1)-labeling of trees,
Theoretical Computer Science, Vol.410, No.38-40, 3702-3710, 2009.
(DOI: 10.1016/j.tcs.2009.04.025,   Elsevier: Scopus)
12. Toru Hasunuma :
Improved book-embeddings of incomplete hypercubes,
Discrete Applied Mathematics, Vol.157, No.7, 1423-1431, 2009.
(DOI: 10.1016/j.dam.2008.10.008,   Elsevier: Scopus)
13. Toru Hasunuma :
Queue layouts of iterated line directed graphs,
Discrete Applied Mathematics, Vol.155, No.9, 1141-1154, 2007.
(DOI: 10.1016/j.dam.2006.04.045,   Elsevier: Scopus)
14. Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori and Yukio Shibata :
On the number of cycles in generalized Kautz digraphs,
Discrete Mathematics, Vol.285, No.1, 127-140, 2004.
(DOI: 10.1016/j.disc.2004.01.014,   Elsevier: Scopus)
15. Toru Hasunuma :
Embedding iterated line digraphs in books,
Networks, Vol.40, No.2, 51-62, 2002.
(DOI: 10.1002/net.10032,   Elsevier: Scopus)
16. Toru Hasunuma and Hiroshi Nagamochi :
Independent spanning trees with small depths in iterated line digraphs,
Discrete Applied Mathematics, Vol.110, No.2-3, 189-211, 2001.
(DOI: 10.1016/S0166-218X(00)00269-9,   Elsevier: Scopus)
17. Toru Hasunuma :
Completely independent spanning trees in the underlying graph of a line digraph,
Discrete Mathematics, Vol.234, No.1-3, 149-157, 2001.
(DOI: 10.1016/S0012-365X(00)00377-0,   Elsevier: Scopus)
18. Hiroshi Nagamochi and Toru Hasunuma :
An efficient NC algorithm for a sparse k-edge-connectivity certificate,
Journal of Algorithms, Vol.38, No.2, 354-373, 2001.
(DOI: 10.1006/jagm.2000.1144,   Elsevier: Scopus)
19. Yukio Shibata, Toru Hasunuma and Sanae Fukuda :
Isomorphic factorization of de Bruijn digraphs,
Discrete Mathematics, Vol.218, No.1-3, 199-208, 2000.
(DOI: 10.1016/S0012-365X(99)00304-0,   Elsevier: Scopus)
20. Toru Hasunuma and Yukio Shibata :
Embedding de Bruijn, Kautz and shuffle-exchange networks in books,
Discrete Applied Mathematics, Vol.78, 103-116, 1997.
(DOI: 10.1016/S0166-218X(97)00009-7,   Elsevier: Scopus)
21. Toru Hasunuma and Yukio Shibata :
Counting small cycles in generalized de Bruijn digraphs,
Networks, Vol.29, 39-47, 1997.
(DOI: 10.1002/(SICI)1097-0037(199701)29:1<39::AID-NET4>3.0.CO;2-D,   Elsevier: Scopus)
22. Toru Hasunuma and Yukio Shibata :
Remarks on the placeability of isomorphic trees in a complete graph,
Journal of Graph Theory, Vol.21, 41-42, 1996.
(DOI: 10.1002/(SICI)1097-0118(199601)21:1<41::AID-JGT5>3.0.CO;2-M,   Elsevier: Scopus)
23. Toru Hasunuma and Yukio Shibata :
The number of labeled graphs placeable by a given permutation,
Journal of Graph Theory, Vol.21, 11-19, 1996.
(DOI: 10.1002/(SICI)1097-0118(199601)21:1<11::AID-JGT2>3.0.CO;2-P,   Elsevier: Scopus)

学術レター:

1. Toru Hasunuma and Misa Hirota :
An improved upper bound on the queuenumber of the hypercube,
Information Processing Letters, Vol.104, No.2, 41-44, 2007.
(DOI: 10.1016/j.ipl.2007.05.006,   Elsevier: Scopus)
2. Toru Hasunuma :
On edge-disjoint spanning trees with small depths,
Information Processing Letters, Vol.75, No.1-2, 71-74, 2000.
(DOI: 10.1016/S0020-0190(00)00078-8,   Elsevier: Scopus)
3. Toru Hasunuma and Yukio Shibata :
Containment of butterflies in networks constructed by the line digraph operation,
Information Processing Letters, Vol.61, 25-30, 1997.
(DOI: 10.1016/S0020-0190(96)00183-4,   Elsevier: Scopus)

国際会議:

1. Toru Hasunuma :
Exponentiation of Graphs,
Abstracts of Combinatorial Designs and Codes 2024 (July 8-12, 2024), 31, Sevilla, Spain, Jul. 2024.
2. Toru Hasunuma :
Connectivity preserving Hamiltonian cycles in k-connected Dirac graphs,
Abstracts of the 45th Australasian Combinatorics Conference 2023 (December 11-15, 2023), 35, Perth, Australia, Dec. 2023.
3. Toru Hasunuma :
Arbor-connectivity of the powers of trees,
Abstracts of Optimization 2023 (July 24-26, 2023), 168, Aveiro, Portugal, Jul. 2023.
4. Toru Hasunuma :
Augmenting a tree to a k-arbor-connected graph with pagenumber k,
Proceedings of 32nd International Workshop on Combinatorial Algorithms (5-7 July 2021, online), Lecture Notes in Computer Science, Vol.12757, 356-369, Ottawa, Canada, Jul. 2021.
(DOI: 10.1007/978-3-030-79987-8_25,   Elsevier: Scopus)
5. Toru Hasunuma :
Connectivity keeping trees in 2-connected graphs with girth conditions,
Proceedings of 31st International Workshop on Combinatorial Algorithms (8-10 June 2020, online), Lecture Notes in Computer Science, Vol.12126, 316-329, Bordeaux, France, Jun. 2020.
(DOI: 10.1007/978-3-030-48966-3_24,   Elsevier: Scopus)
6. Toru Hasunuma :
Augmenting a tree to a k-arbor-connected graph with pagenumber k,
Extended abstracts of 34th European Workshop on Computational Geometry (March 21-23, 2018), 27:1-6, Berlin, Germany, Mar. 2018.
7. Toru Hasunuma :
Completely independent spanning trees in the powers of sparse graphs,
Abstracts of the 40th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (Dec. 12-16, 2016), 23, Newcastle, Australia, Dec. 2016.
8. Toru Hasunuma :
Two generalized variants of dominating sets in subdivided-line graphs,
Abstracts of International Symposium on Combinatorial Optimisation 2016 (Sep. 1-3, 2016), 27, Canterbury, UK, Sep. 2016.
9. Toru Hasunuma :
Constructions of universalized Sierpinski graphs based on labeling manipulations,
Proceedings of the 9th International Workshop on Graph Labeling (July 7-9, 2016), Electronic Notes in Discrete Mathematics, Vol. 60, 47-54, Krakow, Poland, Jul. 2016.
(DOI: 10.1016/j.endm.2017.06.007,   Elsevier: Scopus)
10. Toru Hasunuma :
Minimum degree conditions and optimal graphs for completely independent spanning trees,
Proceedings of 26th International Workshop on Combinatorial Algorithms (October 5-7, 2015), Lecture Notes in Computer Science, Vol.9538, 260-273, Verona, Italy, Oct. 2015.
(DOI: 10.1007/978-3-319-29516-9_22,   Elsevier: Scopus)
11. Toru Hasunuma :
A linear-time algorithm for the queue-numbers of proper triangulated cacti,
Proceedings of 31st European Workshop on Computational Geometry (March 16-18, 2015), 61-64, Ljubljana, Slovenia, Mar. 2015.
12. Toru Hasunuma :
Colorings of iterated subdivided-line graphs,
Abstracts of Bordeaux Graph Workshop 2014 (November 19-22, 2014), 53-54, Bordeaux, France, Nov. 2014.
13. Toru Hasunuma :
Global defensive t-alliances in iterated subdivided-line graphs,
Abstracts of the Second Gdansk Workshop on Graph Theory (June 26-28, 2014), 14, Gdansk, Poland, Jun. 2014.
14. Toru Hasunuma :
Structural properties of subdivided-line graphs,
Proceedings of 24th International Workshop on Combinatorial Algorithms (July 10-12, 2013), Lecture Notes in Computer Science, Vol.8288, 216-229, Rouen, France, Jul. 2013.
(DOI: 10.1007/978-3-642-45278-9_19,   Elsevier: Scopus)
15. Toru Hasunuma :
Book-embeddings of iterated subdivided-line graphs,
Proceedings of 29th European Workshop on Computational Geometry (March 17-20, 2013), 131-134, Braunschweig, Germany, Mar. 2013.
16. Toru Hasunuma and Ayane Haruna :
A linear time algorithm for the queue-numbers of maximal outerplanar graphs,
Proceedings of 28th European Workshop on Computational Geometry (March 19-21, 2012), 37-40, Assisi, Italy, Mar. 2012.
17. Toru Hasunuma and Hiroshi Nagamochi :
Improved bounds for minimum fault-tolerant gossip graphs,
Proceedings of 37th International Workshop on Graph-Theoretic Concepts in Computer Science (June 21-24, 2011), Lecture Notes in Computer Science, Vol.6986, 203-214, Tepla, Czech Republic, Jun. 2011.
(DOI: 10.1007/978-3-642-25870-1_19,   Elsevier: Scopus)
18. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno :
The (p,q)-total labeling problem for trees,
Proceedings of 21th International Symposium on Algorithms and Computation (ISAAC 2010), Lecture Notes in Computer Science, Vol.6507, 49-60, Jeju Island, Korea, Dec. 2010.
(DOI: 10.1007/978-3-642-17514-5_5,   Elsevier: Scopus)
19. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno :
The (2,1)-total labeling number of outerplanar graphs is at mot Δ+2,
Proceedings of 21th International Workshop on Combinatorial Algorithms (IWOCA 2010), Lecture Notes in Computer Science, Vol.6460, 103-107, London, Jul. 2010.
(DOI: 10.1007/978-3-642-19222-7_11,   Elsevier: Scopus)
20. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno :
A linear time algorithm for L(2,1)-labeling of trees,
Proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009), Lecture Notes in Computer Science vol. 5757, pp. 35-46., Copenhagen, Denmark, Sep. 2009.
(DOI: 10.1007/978-3-642-04128-0_4,   Elsevier: Scopus)
21. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno :
An O(n^{1.75}) algorithm for L(2,1)-labeling of trees,
Proceedings of 11th Scandinavian Workshop on Algorithm Theory (SWAT2008), Lecture Notes in Computer Science, Vol.5124, 185-197, Gothenburg, Sweden, Jul. 2008.
(DOI: 10.1007/978-3-540-69903-3_18,   Elsevier: Scopus)
22. Toru Hasunuma :
Multilayer grid embeddings of iterated line digraphs,
Proceedings of 12th Australasian Theory Symposium (Jan. 16-19, 2006) Australian Computer Science Communications, Vol.28, No.4, 21-26, Hobart, Tasmania, Jan. 2006.
(Elsevier: Scopus)
23. Toru Hasunuma :
Laying out iterated line digraphs using queues,
Proceedings of 11th International Symposium on Graph Drawing (Sep. 21-24, 2003), Lecture Notes in Computer Science, Vol.2912, 202-213, Perugia, Italy, Sep. 2003.
(DOI: 10.1007/978-3-540-24595-7_19,   Elsevier: Scopus)
24. Toru Hasunuma :
Completely independent spanning trees in maximal planar graphs,
Proceedings of 28th International Workshop on Graph-Theoretic Concepts in Computer Science (June 13-15, 2002), Lecture Notes in Computer Science, Vol.2573, 235-245, Chesky Krumlov, Czech Republic, Jun. 2002.
(DOI: 10.1007/3-540-36379-3_21,   Elsevier: Scopus)
25. Toru Hasunuma :
Independent spanning cycle-rooted trees in the cartesian product of digraphs,
Proceedings of Brazilizan Symposium on Graphs, Algorithms and Combinatorics (March 17-19, 2001) Electronic Notes in Discrete Mathematics, Vol.7, 106-109, Fortaleza, Brazil, Mar. 2001.
(DOI: 10.1016/S1571-0653(04)00236-7,   Elsevier: Scopus)
26. Toru Hasunuma :
The pagenumber of de Bruijn and Kautz digraphs,
Proceedings of 5th Australasian Theory Symposium (Jan.18-21, 1999), Australian Computer Science Communications, Vol.21, No.3, 232-246, Auckland, Jan. 1999.
27. Hiroshi Nagamochi and Toru Hasunuma :
An efficient NC algorithm for a sparse k-edge-connectivity certificate,
Proceedings of 9th International Symposium on Algorithms and Computation (Taejon, Korea, Dec.14-16, 1998) Lecture Notes in Computer Science, Vol.1533, 447-456, Taejon, Dec. 1998.
(DOI: 10.1007/3-540-49381-6_47,   Elsevier: Scopus)
28. Toru Hasunuma and Hiroshi Nagamochi :
Independent spanning trees with small depths in iterated line digraphs,
Proceedings of 4th Australasian Theory Symposium (Perth, Australia, Feb. 2-3, 1998), Australian Computer Science Communications, Vol.20, No.3, 21-35, Perth, Feb. 1998.

科学研究費補助金 (KAKEN Grants Database @ NII.ac.jp)

  • ネットワークの耐故障性を考慮したグラフ構造的性質に関する研究 (研究課題/領域番号: 19K11829 )
  • 自己相似性をもつグラフ族の生成と構造的性質の解明及びその応用に関する研究 (研究課題/領域番号: 25330015 )
  • ネットワークの耐故障性に関するグラフ構造的性質の解明と改善アルゴリズムの設計 (研究課題/領域番号: 21500017 )
  • グラフの本型及び双対埋め込みとその応用に関する研究 (研究課題/領域番号: 17700018 )
  • グラフ・ネットワークの連結特性の解析とアルゴリズム設計への応用 (研究課題/領域番号: 17500008 )
  • グラフの本型および多層埋め込みとその応用に関する研究 (研究課題/領域番号: 14780196 )
  • グラフにおける完全独立全域木の存在性と構成法に関する研究 (研究課題/領域番号: 12780198 )
  • 計算機科学における下界の研究 (研究課題/領域番号: 10680342 )
  • 形式言語理論の自然言語処理への応用 (研究課題/領域番号: 10680341 )
  • 研究者番号（30313406）による検索