Search:
Tokushima University > Graduate School of Technology, Industrial and Social Sciences > Division of Science and Technology > Mathematical Science > Mathematics and Computer Sciences >
Tokushima University > Faculty of Science and Technology > Department of Science and Technology > Mathematical and Natural Sciences > Mathematics and Computer Sciences >
Tokushima University > Graduate School of Integrated Arts and Sciences > Regional Science > Advanced Studies in Arts and Sciences >
Tokushima University > Research Clusters > Research Clusters (Registered) > 1704010 種々の構造の決定に対する幾何学的アプローチ >
Tokushima University > Faculty of Integrated Arts and Sciences > Department of Mathematical and Material Sciences > Mathematics and Computer Science Studies >
(CSV files for researchmap) [PDF manual]

Research Activity

Field of Study

Information Science

Subject of Study

Development of Optimization Algorithms (algorithm, computational complexity, graph theory)

Book / Paper

Book:

1. Shin-ichi Nakayama, Hidekazu Kakei, Toshiaki Itoh and Mamoru Ohashi :
情報科学入門,
GAKUJUTU TOSHO SHUPPAN-SHA, Tokyo, Apr. 2007.
2. Mamoru Ohashi, Toshiaki Itoh, Shin-ichi Nakayama, Taro Mori and Hidekazu Kakei :
マスターしよう情報リテラシー,
GAKUJUTU TOSHO SHUPPAN-SHA, Tokyo, Apr. 2003.
3. Mamoru Ohashi, Toshiaki Itoh and Shin-ichi Nakayama :
改訂版 これならできる情報リテラシー,
GAKUJUTU TOSHO SHUPPAN-SHA, Tokyo, Mar. 2001.
4. Mamoru Ohashi, Toshiaki Itoh and Shin-ichi Nakayama :
これならできる 情報リテラシー,
GAKUJUTU TOSHO SHUPPAN-SHA, Tokyo, Apr. 1999.

Academic Paper (Judged Full Paper):

1. Shin-ichi Nakayama and Shigeru MASUYAMA :
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs,
IEICE Transactions on Information and Systems, Vol.E102-D, No.4, 826-835, 2019.
(DOI: 10.1587/transinf.2018EDP7232,   Elsevier: Scopus)
2. Shin-ichi Nakayama and Shigeru Masuyama :
A linear-time algorithm for finding a spanning tree with non-terminal set VNT on interval graphs,
IEICE Transactions on Information and Systems, Vol.E101-D, No.9, 2235-2246, 2018.
(DOI: 10.1587/transinf.2018EDP7047,   CiNii: 130007479655,   Elsevier: Scopus)
3. Shin-ichi Nakayama and Shigeru MASUYAMA :
A linear time algorithm for finding a minimum spanning tree with non-terminal set VNT on outerplanar graphs.,
IEICE Transactions on Information and Systems, Vol.E100-D, No.3, 434-443, 2017.
(DOI: 10.1587/transinf.2016FCP0010,   Elsevier: Scopus)
4. Shin-ichi Nakayama and Shigeru MASUYAMA :
A linear time algorithm for finding a spanning tree with non-terminal set $V_{NT}$ on cographs.,
IEICE Transactions on Information and Systems, Vol.E99-D, No.10, 2574-2584, 2016.
(DOI: 10.1587/transinf.2016EDP7021)
5. Shin-ichi Nakayama and Shigeru MASUYAMA :
A Polynomial Time Algorithm for Solving a 2-Tuple Domination Problem on Permutation Graphs,
回路とシステムシンポジウム, Vol.vol.26, 231-236, 2013.
(CiNii: 40019725781)
6. Shin-ichi Nakayama and Shigeru Masuyama :
A Polynomial Time Algorithm for Obtaining Minimum Edge Ranking on Two-connected Outerplanar Graphs,
Information Processing Letters, No.103, 216-221, 2007.
(DOI: 10.1016/j.ipl.2007.03.014,   Elsevier: Scopus)
7. Shin-ichi Nakayama and Shigeru Masuyama :
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs,
IEICE Transactions on Information and Systems, Vol.89, No.8, 2357-2363, 2006.
(DOI: 10.1093/ietisy/e89-d.8.2357,   CiNii: 110007538522)
8. Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama and Liang Zhao :
NP-hardness proof and an approximation algorithm for the maximum vertex ranking spanning tree problem,
Discrete Applied Mathematics, Vol.154, No.16, 2402-2410, 2006.
(DOI: 10.1016/j.dam.2006.04.016)
9. Shin-ichi Nakayama and Shigeru Masuyama :
An algorithm for solving the minimum vertex ranking spanning tree problem on interval graphs,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.86, No.5, 1019-1026, 2003.
(CiNii: 110003221174,   Elsevier: Scopus)
10. Shin-ichi Nakayama and Shigeru Masuyama :
An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E83-A, No.12, 2672-2678, 2000.
(CiNii: 110003208518,   Elsevier: Scopus)
11. Shigeru Masuyama and Shin-ichi Nakayama :
What Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples,
IEICE Transactions on Information and Systems, Vol.E83-D, No.3, 541-549, 2000.
(CiNii: 110003210260)
12. Shin-ichi Nakayama and Shigeru Masuyama :
Parallel Algorithms for Finding a Hamiltonian Path and a Hamiltonian Cycle in an In-Tournament Graph,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E81-A, No.5, 757-767, 1998.
13. Shin-ichi Nakayama and Shigeru Masuyama :
A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs,
Information Processing Letters, Vol.62, 323-327, 1997.
14. Shin-ichi Nakayama and Shigeru Masuyama :
A Parallel Algorithm for Finding a Minimum-Weight Connected Dominating Set on Trapezoid Graphs,
Mathematica Japonica, Vol.45, No.1, 165-171, 1997.
15. Shin-ichi Nakayama and Shigeru Masuyama :
2連結グラフ上の与えられた節点を中心とする全域木を求める並列アルゴリズム,
The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J79DI, No.5, 299-302, 1996.
16. Shin-ichi Nakayama and Shigeru Masuyama :
外平面グラフ上の最大流を求める並列アルゴリズム,
The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J79DI, No.5, 226-236, 1996.
17. Shin-ichi Nakayama and Shigeru Masuyama :
外平面グラフ上のst-最短経路を求める並列アルゴリズム,
The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J78DI, No.11, 867-877, 1995.
18. Shin-ichi Nakayama and Shigeru Masuyama :
外平面グラフの最長路問題を解く並列アルゴリズム,
The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J78DI, No.6, 563-568, 1995.

Academic Paper (Unrefereed Paper):

1. Shin-ichi Nakayama and Shigeru Masuyama :
A Simple Near Optimal Parallel Algorithm for Recognizing Outerplanar Graphs,
Natural Science Research, Faculty of Integrated Arts and Sciences, The University of Tokushima, 71-80, 1997.
(Tokushima University Institutional Repository: 118)

Proceeding of International Conference:

1. Shin-ichi Nakayama and Shigeru Masuyama :
A Polynomial Time Algorithm for Obtaining the Minimum Vertex Ranking Spanning Tree on Outerplanar Graphs,
INFORMS International Hong Kong 2006, Hong Kong, China, Jun. 2006.
2. Shin-ichi Nakayama and Shigeru MASUYAMA :
An O(n^3) Time Algorithm for obtaining the Minimum Vertex Ranking Spanning Tree on Permutation Graphs,
HJ2005, 250-256, Hungry, 2005.
3. Shin-ichi Nakayama and Shigeru Masuyama :
An O(n3) Time Algorithm for Obtaining the Minimum Vertex Ranking Spanning Tree on Interval Graphs,
HJ2003, Tokyo, Jan. 2003.

Proceeding of Domestic Conference:

1. Shin-ichi Nakayama :
最小全域木に関する問題の解法について,
日本オペレーションズ・リサーチ学会中国・四国支部講演会, Mar. 2019.
2. 塚本 淳 and Shin-ichi Nakayama :
非端末節点集合を伴う最小全域木問題を解くプログラム開発,
日本OR学会中四国支部SSOR, 15-16, Sep. 2018.
3. 塚本 淳 and Shin-ichi Nakayama :
非端末節点集合を伴う全域木問題を解くアルゴリズム開発,
中国・四国地区SSOR, 18-19, Sep. 2017.
4. Shin-ichi Nakayama and 増山 繁 :
区間グラフ上における非端末節点集合を伴う全域木を求める線形時間アルゴリズム,
日本OR学会春季研究発表会, Mar. 2016.
5. Shin-ichi Nakayama and Shigeru MASUYAMA :
A linear time algorithm for finding a spanning tree with non-terminal set $V_{NT}$ on cographs,
IEICE Technical Report, Vol.114, No.199, 9-16, Sep. 2014.
6. Shin-ichi Nakayama and 増山 繁 :
置換グラフ上における最少2-組支配集合を求める多項式アルゴリズム,
Sep. 2012.
7. 増山 繁 and Shin-ichi Nakayama :
-,
「新世代計算限界と 地球環境問題」講演論文集, 89-95, 2006.
8. Shin-ichi Nakayama and 増山 繁 :
置換グラフ上における最小節点ランキング全域木問題を解くアルゴリズム,
冬のLAシンポジウム, 2004.
9. 宮田 敬三, 増山 繁 and Shin-ichi Nakayama :
最小節点ランキング全域木問題の計算複雑度,
回路とシステム軽井沢ワー クショップ論文集, 645-650, 2004.
10. Shin-ichi Nakayama and 増山 繁 :
置換グラフ上における最小節点ランキング全域木問題を解くアルゴリズム,
情報処理学会研究報告 「アルゴリズム」, Vol.AL92, No.6, 2003.
11. 宮田 敬三, 増山 繁 and Shin-ichi Nakayama :
最小節点ランキング全域木問題の計算複雑性について,
電子情報通信学会コンピュ テーション研究会, 2003.
12. Shin-ichi Nakayama and 増山 繁 :
ある種のデータ収集問題の部分クラスに対する効率的解法,
スケジューリング·シンポジウム2002, Oct. 2002.
13. Shin-ichi Nakayama and 増山 繁 :
グラフの構造的特徴と効率の良い並列アルゴリズムについて,
「アルゴリズム工学」研究集会, Oct. 2000.
14. Shin-ichi Nakayama and 増山 繁 :
並列グラフアルゴリズムにおける構造と計算量,
3学会(OR学会中部支部,QC学会中部支部,JIMA中部支部)合同研究発表会, Jul. 1999.
15. Shin-ichi Nakayama and 増山 繁 :
An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments,
SSOR, Aug. 1998.
16. Shin-ichi Nakayama and 増山 繁 :
グラフの構造的特徴と効率の良い並列アルゴリズムについて,
「アルゴリズム工学」研究集会, Jul. 1997.
17. Shin-ichi Nakayama and 増山 繁 :
台形グラフの点彩色問題を解く並列アルゴリズム,
日本OR学会 春季研究発表会, Apr. 1997.
18. Shin-ichi Nakayama and 増山 繁 :
in-トーナメントグラフ上のハミルトン閉路を求める並列アルゴリズム,
日本OR学会 秋季研究発表会, Sep. 1979.

Et cetera, Workshop:

1. Shin-ichi Nakayama :
台形グラフ,および,そのサブグラフ上におけるc-ランキング問題を解く多項式時間アルゴリズムについて,
日本OR学会中国・四国支部定例シンポジウム, Nov. 2010.

Grants-in-Aid for Scientific Research (KAKEN Grants Database @ NII.ac.jp)

  • Webコンテンツ活用に関連した離散最適化問題の研究 (Project/Area Number: 16092213 )
  • ネットワーク上におけるデータ統合問題に関する数理的解法 (Project/Area Number: 15700018 )
  • グラフの構造的特徴と効率の良い並列アルゴリズムに関する研究 (Project/Area Number: 13780242 )
  • 経路問題に関するアルゴリズムの研究 (Project/Area Number: 09780290 )
  • Search by Researcher Number (50284279)