nakayama shinichi 中山慎一

… Alternative Names

中山慎一ナカヤマシンイチ

Less

Researcher Number	50284279
External Links
Affiliation (Current)	2025: 徳島大学, 大学院社会産業理工学研究部(理工学域), 准教授
Affiliation (based on the past Project Information) *help	2006 – 2007: 徳島大学, 総合科学部, 准教授 2003 – 2005: 徳島大学, 総合科学部, 助教授 2001 – 2002: 徳島大学, 総合科学部, 講師 1997 – 1998: 徳島大学, 総合科学部, 助手
Review Section/Research Field	Principal Investigator 計算機科学 / Fundamental theory of informatics Except Principal Investigator Science and Engineering
Keywords	Principal Investigator アルゴリズム / グラフ理論 / 計算量 / 全域木 / 置換グラフ / ネットワーク理論 / ネットワーク論 / 外平面グラフ / ランキング問題 / 配線問題 … More / 経路問題 / オーナメントグラフ / ハミルトン閉路 / ハミルトン路 / 並列アルゴリズム … More Except Principal Investigator 要約 / ゲラフアルゴリズム / 離散最適化 / テキストマイニングアルゴリズム / アルゴリズム / グラフ理論 / 情報抽出 / 解散最適化 / Webコンテンツ / Webページ本文切り出し / 連結全域部分木 / ネットワーク信頼性 / 最小辺ランキング / 要因表現抽出 / テキストマイニング / Webコンテンツ活用 Less

Webコンテンツ活用に関連した離散最適化問題の研究
- Principal Investigator
  
  増山繁
- Project Period (FY)
  2004 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research on Priority Areas
- Review Section
  
  Science and Engineering
- Research Institution
  Toyohashi University of Technology
ネットワーク上におけるデータ統合問題に関する数理的解法Principal Investigator
- Principal Investigator
  
  中山慎一
- Project Period (FY)
  2003 – 2004
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  The University of Tokushima
グラフの構造的特徴と効率の良い並列アルゴリズムに関する研究Principal Investigator
- Principal Investigator
  
  中山慎一
- Project Period (FY)
  2001 – 2002
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  計算機科学
- Research Institution
  The University of Tokushima
経路問題に関するアルゴリズムの研究Principal Investigator
- Principal Investigator
  
  中山慎一
- Project Period (FY)
  1997 – 1998
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  The University of Tokushima

All 2007 2006 2005 Other

All Journal Article

[Journal Article] A Polynomial Time Algorithm for Obtaining Minimum Edge Ranking on Two-connected Outerplanar Graphs2007
- Author(s)
  Shin-ichi Nakayama, shigeru Masuyama
- Journal Title
  
  Information Processing Letters 103
  
  Pages: 216-221
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16092213
[Journal Article] A Polynomial Time Algorithm for Obtaining Minimum Edge Ranking on Two-connected Outerplanar Graphs2007
- Author(s)
  Shin-ichi Nakayama, Shigeru Masuyama
- Journal Title
  
  Information Processing Letters (掲載予定)
- Data Source
  KAKENHI-PROJECT-16092213
[Journal Article] A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs (invited paper)2006
- Author(s)
  Shin-ichi Nakayama, shigeru Masuyama
- Journal Title
  
  IEICE Trans. Information and Systems Vol.E89-D, No.8
  
  Pages: 2357-2363
- Data Source
  KAKENHI-PROJECT-16092213
[Journal Article] NP-hardness proof and an approximation algorithm for the maximum vertex ranking spanning tree problem2006
- Author(s)
  Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao
- Journal Title
  
  Discrete Applied Mathematics Vol.154 Issue 16
  
  Pages: 2402-2410
- Data Source
  KAKENHI-PROJECT-16092213
[Journal Article] An $O(n^3)$ Time Algorithm for Obtaining the Minimum Vertex Ranking Spannin Tree on Permutation Graphs2005
- Author(s)
  Shin-ichi Nakayama
- Journal Title
  
  The 4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications (採録決定)
- Data Source
  KAKENHI-PROJECT-15700018
[Journal Article] An O(n^3) Time Algorithm for Obtaining the Minimum Vertex Ranking Spanning Tree on Permutation Graphs2005
- Author(s)
  Shin-ichi Nakayama, Shigeru Masuyama
- Journal Title
  
  Proc.of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications (掲載予定)
- Data Source
  KAKENHI-PROJECT-16092213
[Journal Article] NP-hardness proof and an approximation algorithm for the maximum vertex ranking spanning tree problem
- Author(s)
  Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao
- Journal Title
  
  Discrete Applied Mathematics (掲載予定)
- Data Source
  KAKENHI-PROJECT-16092213
[Journal Article] A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs(invited paper)
- Author(s)
  Shin-ichi Nakayama, Shigeru Masuyama
- Journal Title
  
  IEICE Trans.Inf.and Systems (掲載予定)
- Data Source
  KAKENHI-PROJECT-16092213

1. 増山繁 (60173762)

# of Collaborated Projects: 1 results

# of Collaborated Products: 7 results
2. 梅村恭司 (80273324)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
3. 本間宏利 (80249721)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
4. 石井利昌 (30324487)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
5. 相田慎 (60345957)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results

nakayama shinichi 中山 慎一

中山 慎一 ナカヤマ シンイチ

Research Projects

Research Products

Co-Researchers

Webコンテンツ活用に関連した離散最適化問題の研究

Principal Investigator

Project Period (FY)

Research Category

Review Section

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

経路問題に関するアルゴリズムの研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] A Polynomial Time Algorithm for Obtaining Minimum Edge Ranking on Two-connected Outerplanar Graphs2007

Author(s)

Journal Title

Data Source

[Journal Article] A Polynomial Time Algorithm for Obtaining Minimum Edge Ranking on Two-connected Outerplanar Graphs2007

Author(s)

Journal Title

Data Source

[Journal Article] A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs (invited paper)2006

Author(s)

Journal Title

Data Source

[Journal Article] NP-hardness proof and an approximation algorithm for the maximum vertex ranking spanning tree problem2006

Author(s)

Journal Title

Data Source

[Journal Article] An $O(n^3)$ Time Algorithm for Obtaining the Minimum Vertex Ranking Spannin Tree on Permutation Graphs2005

Author(s)

Journal Title

Data Source

[Journal Article] An O(n^3) Time Algorithm for Obtaining the Minimum Vertex Ranking Spanning Tree on Permutation Graphs2005

Author(s)

Journal Title

Data Source

[Journal Article] NP-hardness proof and an approximation algorithm for the maximum vertex ranking spanning tree problem

Author(s)

Journal Title

Data Source

[Journal Article] A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs(invited paper)

Author(s)

Journal Title

Data Source

nakayama shinichi 中山慎一

中山慎一ナカヤマシンイチ