hasunuma toru 蓮沼徹

… Alternative Names

蓮沼徹ハスヌマトオル

Hasunuma Toru 蓮沼徹

HASUNUMA Toru 蓮沼徹

Less

Researcher Number	30313406
Other IDs
Affiliation (Current)	2025: 徳島大学, 大学院社会産業理工学研究部(理工学域), 教授
Affiliation (based on the past Project Information) *help	2019 – 2023: 徳島大学, 大学院社会産業理工学研究部(理工学域), 教授 2016: 徳島大学, 大学院理工学研究部, 准教授 2013 – 2015: 徳島大学, 大学院ソシオ・アーツ・アンド・サイエンス研究部, 准教授 2009 – 2011: The University of Tokushima, 大学院・ソシオ・アーツ・アンド・サイエンス研究部, 准教授 2007: The University of Thkushima, Faculty of integrated Arts and Sciences, Associate Professor 2005 – 2006: 徳島大学, 総合科学部, 助教授 1999 – 2003: 電気通信大学, 電気通信学部, 助手
Review Section/Research Field	Principal Investigator Fundamental theory of informatics / 計算機科学 / Basic Section 60010:Theory of informatics-related / Theory of informatics Except Principal Investigator 計算機科学 / Fundamental theory of informatics
Keywords	Principal Investigator グラフ / 耐故障性 / 相互結合網 / アルゴリズム / 完全独立全域木 / ネットワーク / キューレイアウト / スタックレイアウト / 反復ラインダイグラフ / VLSIレイアウト … More / 多層埋め込み / 本型埋め込み / 独立全域木 / 樹連結性 / キャタピラ / Mader予想 / 重複内周 / 内周 / 二股擬単峰キャタピラ / 増大問題 / 本型埋込 / ページナンバー / k-樹連結グラフ / 連結度保存木 / 木 / 辺連結度 / 完全グラフ / 連結度 / ライングラフ / 中継数 / 辺素ハミルトン閉路 / L(2,1)-ラベリング / 全彩色 / 辺彩色 / 点彩色 / 広域防衛同盟 / 反復細分線グラフ / 最適グラフ / 最小次数条件 / 冪グラフ / 辺素因子 / 因子分解 / 彩色 / 普遍化シェルピンスキーグラフ / 連結支配集合 / 連結防衛同盟 / シェルピンスキーグラフ / 細分線グラフ演算 / グラフ理論 / de Bruijnダイグラフ / メビウスキューブ / 不完全ハイパーキューブ / ハイパーキューブ / Kautzダイグラフ / de Bruijn ダイグラフ / 極大平面グラフ / ラインダイグラフ / 計算の複雑さ … More Except Principal Investigator Complexity / TAG / Connectivity / Approximation Algorithm / Network / Graph Theory / Fundamentals of Informatics / Mathematical Engineering / Applied Mathematics / Algorithm / グラフ増大問題 / グラフの直径 / グラフ分割 / 最小カット / 連結度 / ネットワーク設計 / 連結特性 / 近似アルゴリズム / ネットワーク / グラフ理論 / 情報基礎 / 数理工学 / 応用数学 / アルゴリズム / Merging Network / Computation / Lower Bound / コンピュータによる計算 / 理論的 / 下界を求める計算 / 下界定理 / 下界理論 / 計算機科学 / マージングネットワーク / 計算 / 下界 / 複雑さ / Context-Free / Natural Languages / Tree Automata / Automata / Formal Languages / プッシュダウン・木オートマトン / プシュダウン木オートマトン / プッシュダウン木オートマトン / プッシュダウンオートマトン / 文脈自由木オート・マトン / 計算量 / プシュダウンオートマトン / 文脈自由木オートマトン / 機械翻訳 / 木オートマトン / 形式言語理論 Less

ネットワークの耐故障性を考慮したグラフ構造的性質に関する研究Principal Investigator
- Principal Investigator
  
  蓮沼徹
- Project Period (FY)
  2019 – 2024
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  The University of Tokushima
Studies on generation of graph classes with self-similar stuructures and investigation of their structural properties with applicationsPrincipal Investigator
- Principal Investigator
  
  Hasunuma Toru
- Project Period (FY)
  2013 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  The University of Tokushima
Studies of Graph-Structural Properties on Fault-Tolerance of Networks and Design of Improved Algorithms.Principal Investigator
- Principal Investigator
  
  HASUNUMA Toru
- Project Period (FY)
  2009 – 2011
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  The University of Tokushima
グラフの本型及び双対埋め込みとその応用に関する研究Principal Investigator
- Principal Investigator
  
  蓮沼徹
- Project Period (FY)
  2005 – 2006
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  The University of Tokushima
Analysis of properties on the connectivity of graphs and networks and its applications to design of algorithms
- Principal Investigator
  
  NAGAMOCHI Hiroshi
- Project Period (FY)
  2005 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University
グラフの本型および多層埋め込みとその応用に関する研究Principal Investigator
- Principal Investigator
  
  蓮沼徹
- Project Period (FY)
  2002 – 2003
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications
グラフにおける完全独立全域木の存在性と構成法に関する研究Principal Investigator
- Principal Investigator
  
  蓮沼徹
- Project Period (FY)
  2000 – 2001
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications
The application of Formal Language Theory to Natural Language Processing
- Principal Investigator
  
  KASAI Takumi
- Project Period (FY)
  1998 – 2001
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications
Lower Bounds in Computer Science
- Principal Investigator
  
  IWATA Shigeki
- Project Period (FY)
  1998 – 2001
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications

All 2023 2021 2020 2016 2015 2013 2012 2011 2010 2009 2007 Other

All Journal Article Presentation

[Journal Article] Completely independent spanning trees in line graphs2023
- Author(s)
  Toru Hasunuma
- Journal Title
  
  Graphs and Combinatorics
  
  Volume: 39 Issue: 5
- DOI
  10.1007/s00373-023-02688-y
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19K11829
[Journal Article] Connectivity preserving trees in k-connected or k-edge-connected graphs2023
- Author(s)
  Toru Hasunuma
- Journal Title
  
  Journal of Graph Theory
  
  Volume: 102 Issue: 3 Pages: 423-435
- DOI
  10.1002/jgt.22878
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19K11829
[Journal Article] Connectivity keeping trees in 2‐connected graphs2020
- Author(s)
  Hasunuma Toru, Ono Kosuke
- Journal Title
  
  Journal of Graph Theory
  
  Volume: 94 Issue: 1 Pages: 20-29
- DOI
  10.1002/jgt.22504
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19K11829
[Journal Article] Structural properties of subdivided-line graphs2015
- Author(s)
  Toru Hasunuma
- Journal Title
  
  Journal of Discrete Algorithms
  
  Volume: 31 Pages: 69-86
- DOI
  10.1016/j.jda.2015.01.008
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330015
[Journal Article] On the(h, k)-domination numbers of iterated line digraphs2012
- Author(s)
  Hasunuma T., Otani M.
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: Vol.160 Issue: 12 Pages: 1859-1863
- DOI
  10.1016/j.dam.2012.03.024
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500017
[Journal Article] A linear time algorithm for L(2, 1)-labeling of trees2012
- Author(s)
  Hasunuma T., Ishii T., Ono H., Uno Y.
- Journal Title
  
  Algorithmica
  
  Volume: (印刷中) Issue: 3 Pages: 654-681
- DOI
  10.1007/s00453-012-9657-z
- NAID
  110007995596
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500017, KAKENHI-PROJECT-21680001, KAKENHI-PROJECT-23310098, KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-24700001
[Journal Article] A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs2012
- Author(s)
  Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
- Journal Title
  
  Journal of Discrete Algorithms
  
  Volume: (掲載決定済) Pages: 189-206
- DOI
  10.1016/j.jda.2011.12.020
- NAID
  110008000714
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20700002, KAKENHI-PROJECT-21500017, KAKENHI-PROJECT-21680001, KAKENHI-PROJECT-23310098, KAKENHI-PROJECT-24700001
[Journal Article] The (p, q)-total labeling problem for trees2012
- Author(s)
  Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
- Journal Title
  
  Discrete Mathematics
  
  Volume: vol.312 Issue: 8 Pages: 1407-1420
- DOI
  10.1016/j.disc.2012.01.007
- NAID
  110007995637
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20700002, KAKENHI-PROJECT-21500017, KAKENHI-PROJECT-21680001, KAKENHI-PROJECT-24700001
[Journal Article] Completely independent spanning trees in torus networks2011
- Author(s)
  Hasunuma T., Morisaka C.
- Journal Title
  
  Networks
  
  Volume: 60 Issue: 1 Pages: 59-69
- DOI
  10.1002/net.20460
- Year and Date
  2011-09-16
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500017
[Journal Article] An O(n^{1.75}) algorithm for L(2, 1)-labeling of trees2009
- Author(s)
  Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
- Journal Title
  
  Theoretical Computer Science
  
  Volume: vol.410 Issue: 38-40 Pages: 3702-3710
- DOI
  10.1016/j.tcs.2009.04.025
- NAID
  120006654464
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20700002, KAKENHI-PROJECT-21500017, KAKENHI-PROJECT-21680001
[Journal Article] An O(n^<1.75>) algorithm for L(2,1)-labeling of trees2009
- Author(s)
  Hasunuma T, et al.
- Journal Title
  
  Theoretical Computer Science 410
  
  Pages: 3702-3710
- NAID
  110006881045
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500017
[Journal Article] An improved upper bound on the queuenumber of the hypercube2007
- Author(s)
  T., Hasunuma
- Journal Title
  
  Information Processing Letters 104
  
  Pages: 41-44
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500008
[Journal Article] Queue layouts of iterated line directed graphs2007
- Author(s)
  T., Hasunuma
- Journal Title
  
  Discrete Applied Mathematics 155
  
  Pages: 1141-1154
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500008
[Journal Article] An improved upper bound on the queue number of the hypercube2007
- Author(s)
  T. Hasunuma
- Journal Title
  
  Information Processing Letters 104
  
  Pages: 41-44
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500008
[Journal Article] Queue layouts of iterated line directed graphs2007
- Author(s)
  T. Hasunuma
- Journal Title
  
  Discrete Applied Mathematics 155
  
  Pages: 1141-1154
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500008
[Journal Article] An improved upper bound on the queuenumber of the hypercube2007
- Author(s)
  T. Hasunuma
- Journal Title
  
  Information Processing Letters 104
  
  Pages: 41-44
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500008
[Journal Article] Queue layouts of iterated line directed graphs
- Author(s)
  Toru Hasunuma
- Journal Title
  
  Discrete Applied Mathematics (印刷中)
- Data Source
  KAKENHI-PROJECT-17700018
[Presentation] Augmenting a tree to a k-arbor-connected graph with pagenumber k2021
- Author(s)
  Toru Hasunuma
- Organizer
  32nd International Workshop on Combinatorial Algorithms (IWOCA 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-19K11829
[Presentation] Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions2020
- Author(s)
  Toru Hasunuma
- Organizer
  31th International Workshop on Combinatorial Algorithms (IWOCA 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-19K11829
[Presentation] Constructions of universalized Sierpinski graphs based on labeling manipulations2016
- Author(s)
  Toru Hasunuma
- Organizer
  9th International Workshop on Graph Labeling
- Place of Presentation
  Krakow, Poland
- Year and Date
  2016-07-07
- Data Source
  KAKENHI-PROJECT-25330015
[Presentation] Two generalized variants of dominating sets in subdivided-line graphs2016
- Author(s)
  Toru Hasunuma
- Organizer
  International Symposium on Combinatorial Optimisation 2016
- Place of Presentation
  Canterbury, UK
- Year and Date
  2016-09-01
- Data Source
  KAKENHI-PROJECT-25330015
[Presentation] Completely independent spanning trees in the powers of sparse graphs2016
- Author(s)
  Toru Hasunuma
- Organizer
  40th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing
- Place of Presentation
  Newcastle, Australia
- Year and Date
  2016-12-12
- Data Source
  KAKENHI-PROJECT-25330015
[Presentation] Minimum degree conditions and optimal graphs for completely independent spanning trees2015
- Author(s)
  Toru Hasunuma
- Organizer
  26th International Workshop on Combinatorial Algorithms (Lecture Notes in Computer Science Vol. 9538, pp. 260-273, Springer)
- Place of Presentation
  Verona, Italy
- Year and Date
  2015-10-05
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25330015
[Presentation] Structural properties of subdivided-line graphs2013
- Author(s)
  Toru Hasunuma
- Organizer
  24th International Workshop on Combinatorial Algorithms (Lecture Notes in Computer Science Vol. 8288, pp.216-229, Springer-Verlag)
- Place of Presentation
  The University of Rouen (Rouen, France)
- Data Source
  KAKENHI-PROJECT-25330015
[Presentation] A linear time algorithm for the queue-numbers of maximal outerplanar graphs2012
- Author(s)
  Hasunuma T., Haruna A
- Organizer
  The 28^th European Workshop on Computational Geometry(EuroCG 2012)
- Place of Presentation
  Assisi, Italy
- Data Source
  KAKENHI-PROJECT-21500017
[Presentation] A linear time algorithm for the queue-numbers of maximal outerplanar graphs2012
- Author(s)
  Hasunuma T, et al
- Organizer
  The 28^<th> European Workshop on Computational Geometry (EuroCG 2012)
- Place of Presentation
  Assisi, Italy
- Data Source
  KAKENHI-PROJECT-21500017
[Presentation] Improved bounds for minimum fault-tolerant gossip graphs2011
- Author(s)
  Hasunuma T., Nagamochi H
- Organizer
  The 37^th International Workshop on Graph-Theoretic Concepts in Computer Science(WG 2011)
- Place of Presentation
  Tepla, Czech Republic
- Data Source
  KAKENHI-PROJECT-21500017
[Presentation] The(2, 1)-total labeling number of outerplanar graphs is at mostΔ+ 22010
- Author(s)
  Hasunuma T., Ishii T., Ono H., Uno Y
- Organizer
  The 21^st International Workshop on Combinatorial Algorithms(IWOCA 2010)
- Place of Presentation
  London, UK.
- Data Source
  KAKENHI-PROJECT-21500017
[Presentation] The(p, q)-total labeling problem for trees2010
- Author(s)
  Hasunuma T., Ishii T., Ono H., Uno Y
- Organizer
  The 21^st International Symposium on Algorithms and Computation(ISAAC 2010)
- Place of Presentation
  Jeju Island, Korea.
- Data Source
  KAKENHI-PROJECT-21500017
[Presentation] Highly connected k-tuple twin dominating sets in iterated line digraphs2010
- Author(s)
  Hasunuma T, et al.
- Organizer
  (社)電子情報通信学会回路とシステム研究会
- Place of Presentation
  ブリーズベイマリーナ(宮古島市)
- Year and Date
  2010-03-01
- Data Source
  KAKENHI-PROJECT-21500017
[Presentation] Highly connected k-tuple twin dominating sets in iterated line digraphs2010
- Author(s)
  Hasunuma T., Otani M
- Organizer
  (社)電子情報通信学会回路とシステム研究会
- Place of Presentation
  ブリーズベイマリーナ(宮古島市)
- Year and Date
  2010-03-01
- Data Source
  KAKENHI-PROJECT-21500017
[Presentation] A linear time algorithm for L(2, 1)-labeling of trees2009
- Author(s)
  Hasunuma T., Ishii T., Ono H., Uno Y
- Organizer
  The 17^th Annual European Symposium on Algorithms(ESA 2009)
- Place of Presentation
  Copenhagen, Denmark
- Data Source
  KAKENHI-PROJECT-21500017
[Presentation] Colorings of iterated subdivided-line graphs
- Author(s)
  Toru Hasunuma
- Organizer
  Bordeaux Graph Workshop 2014
- Place of Presentation
  University of Bordeaux (Bordeaux, France)
- Year and Date
  2014-11-19 – 2014-11-22
- Data Source
  KAKENHI-PROJECT-25330015
[Presentation] Global defensive t-alliances in iterated subdivided-line graphs
- Author(s)
  Toru Hasunuma
- Organizer
  The Second Gdansk Workshop on Graph Theory
- Place of Presentation
  University of Gdansk (Gdansk, Poland)
- Year and Date
  2014-06-26 – 2014-06-28
- Data Source
  KAKENHI-PROJECT-25330015
[Presentation] A linear-time algorithm for the queue-numbers of proper triangulated cacti
- Author(s)
  Toru Hasunuma
- Organizer
  31st European Workshop on Computational Geometry
- Place of Presentation
  University of Ljubljana (Ljubljana, Slovenia)
- Year and Date
  2015-03-16 – 2015-03-18
- Data Source
  KAKENHI-PROJECT-25330015

1. KASAI Takumi (70027382)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
2. TAKENAGA Yasuhiko (20236491)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
3. IWATA Shigeki (80102028)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
4. NAGAMOCHI Hiroshi (70202231)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
5. KAMIDOI Yoko (80264935)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
6. 石井利昌

# of Collaborated Projects: 0 results

# of Collaborated Products: 3 results

hasunuma toru 蓮沼 徹

蓮沼 徹 ハスヌマ トオル

Hasunuma Toru 蓮沼 徹

HASUNUMA Toru 蓮沼 徹

Research Projects

Research Products

Co-Researchers

ネットワークの耐故障性を考慮したグラフ構造的性質に関する研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Studies on generation of graph classes with self-similar stuructures and investigation of their structural properties with applicationsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Studies of Graph-Structural Properties on Fault-Tolerance of Networks and Design of Improved Algorithms.Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

グラフの本型及び双対埋め込みとその応用に関する研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Analysis of properties on the connectivity of graphs and networks and its applications to design of algorithms

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

グラフの本型および多層埋め込みとその応用に関する研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

グラフにおける完全独立全域木の存在性と構成法に関する研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

The application of Formal Language Theory to Natural Language Processing

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Lower Bounds in Computer Science

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] Completely independent spanning trees in line graphs2023

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Connectivity preserving trees in k-connected or k-edge-connected graphs2023

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Connectivity keeping trees in 2‐connected graphs2020

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Structural properties of subdivided-line graphs2015

Author(s)

Journal Title

DOI

hasunuma toru 蓮沼徹

蓮沼徹ハスヌマトオル

Hasunuma Toru 蓮沼徹

HASUNUMA Toru 蓮沼徹