• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Studies on the design of algorithms for reliable networks and its application

Research Project

Project/Area Number 20700002
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionOtaru University of Commerce

Principal Investigator

ISHII Toshimasa  小樽商科大学, 商学部, 准教授 (30324487)

Project Period (FY) 2008 – 2011
Project Status Completed (Fiscal Year 2011)
Budget Amount *help
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2011: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2010: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2009: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2008: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Keywordsアルゴリズム理論 / 離散最適化 / 組合せ最適化 / グラフ理論 / グラフ連結度 / アルゴリズム / ネットワーク設計 / 距離制約付きラベリング / グラフの直径
Research Abstract

In modern society, we have many networks such as traffic networks and communication networks. It is required that such networks have some fault-tolerance. The concepts of graph connectivity are known as one measure of network fault-tolerance. In this research, we proposed several efficient algorithms for connectivity augmentation problems and source location problems, which are well-known as graph problems concerning connectivity. Also, we generalized these results, which may contribute to the analysis of other problems.

Report

(6 results)
  • 2011 Annual Research Report   Final Research Report ( PDF )
  • 2010 Annual Research Report   Self-evaluation Report ( PDF )
  • 2009 Annual Research Report
  • 2008 Annual Research Report
  • Research Products

    (71 results)

All 2012 2011 2010 2009 2008 Other

All Journal Article (31 results) (of which Peer Reviewed: 31 results) Presentation (22 results) Book (7 results) Remarks (11 results)

  • [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

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Augmenting outerplanar graphs to meet diameter requirements2012

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Proceedings of the 18^th Computing Theory : The Australian Theory Symposium

      Pages: 123-132

    • URL

      http://crpit.com/confpapers/CRPITV128Ishii.pdf

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Augmenting outerplanar graphs to meet diameter requirements2012

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Proceedings of the 18^<th> Computing Theory : The A ustralian Theory Symposium

      Pages: 123-132

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The (p, q)-total labeling problem for trees2010

    • Author(s)
      Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
    • Journal Title

      Proceedings of the 21th International Symposium on Algorithms and Computation

      Pages: 49-60

    • DOI

      10.1007/978-3-642-17514-5_5

    • NAID

      110007995637

    • ISBN
      9783642175138, 9783642175145
    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] The (2, 1)-total labeling number of outerplanar graphs is at most △+2,2010

    • Author(s)
      Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
    • Journal Title

      Proceedings of the 21th International Workshop on Combinatorial Algorithms

      Volume: 2 Pages: 103-106

    • DOI

      10.1007/978-3-642-19222-7_11

    • ISBN
      9783642192210, 9783642192227
    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs2010

    • Author(s)
      Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi
    • Journal Title

      Algorithmica

      Volume: vol.56 Issue: 4 Pages: 413-436

    • DOI

      10.1007/s00453-008-9178-y

    • NAID

      120001466862

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Posi-modular systems with modulotone requirements under permutation constraints2010

    • Author(s)
      Toshimasa Ishii, Kazuhisa Makino
    • Journal Title

      Discrete Mathematics, Algorithms and Applications

      Volume: vol.2 Issue: 01 Pages: 61-76

    • DOI

      10.1142/s1793830910000474

    • NAID

      110007995594

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs2010

    • Author(s)
      Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi
    • Journal Title

      Algorithmica vol.56

      Pages: 413-436

    • NAID

      120001466862

    • Related Report
      2010 Self-evaluation Report
    • Peer Reviewed
  • [Journal Article] Posi-modular systems with modulotone requirements under permutation constraints2010

    • Author(s)
      Toshimasa Ishii, Kazuhisa Makino
    • Journal Title

      Discrete Mathematics, Algorithms and Applications vol.2

      Pages: 61-76

    • NAID

      110007995594

    • Related Report
      2010 Self-evaluation Report
    • Peer Reviewed
  • [Journal Article] Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs2010

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Algorithmica

      Volume: 56 Pages: 413-436

    • NAID

      120001466862

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Posi-modular systems with modulotone requirements under permutation constraints2010

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Discrete Mathematics, Algorithms and Applications

      Volume: 2 Pages: 61-76

    • NAID

      110007995594

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The (2,1)-total labeling number of outerplanar graphs is at most Δ+22010

    • Author(s)
      Toru Hasunuma
    • Journal Title

      Proceedings of the 21th International Workshop on Combinatorial Algorithms

      Pages: 103-106

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The (p,q)-total labeling problem for trees2010

    • Author(s)
      Toru Hasunuma
    • Journal Title

      Proceedings of the 21th International Symposium on Algorithms and Computation

      Pages: 49-60

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Posi-modular systems with modulotone requirements under permutation constraints2009

    • Author(s)
      Toshimasa Ishii, Kazuhisa Makino
    • Journal Title

      Proceedings of the 20th International Symposium on Algorithms and Computation

      Pages: 473-482

    • DOI

      10.1007/978-3-642-10631-6_49

    • NAID

      110007995594

    • ISBN
      9783642106309, 9783642106316
    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs2009

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Journal of Discrete Algorithms

      Volume: 7 Issue: 4 Pages: 570-578

    • DOI

      10.1016/j.jda.2009.06.003

    • NAID

      120006549569

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] A linear time algorithm for L(2, 1)-labeling of trees2009

    • Author(s)
      Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
    • Journal Title

      Proceedings of the 17th Annual European Symposium on Algorithms

      Pages: 35-46

    • DOI

      10.1007/978-3-642-04128-0_4

    • NAID

      120006654476

    • ISBN
      9783642041273, 9783642041280
    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs2009

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Discrete Optimization

      Volume: vol.6 Pages: 23-36

    • NAID

      110004741449

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Augmenting edge-connectivity between vertex subsets2009

    • Author(s)
      Toshimasa Ishii, Kazuhisa Makino
    • Journal Title

      Proceedings of the 15^th Computing Theory : The Australian Theory Symposium

      Pages: 45-51

    • NAID

      110007081988

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs2009

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Journal of Discrete Algorithms vol.7

      Pages: 570-578

    • NAID

      120006549569

    • Related Report
      2010 Self-evaluation Report
    • Peer Reviewed
  • [Journal Article] Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs2009

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Discrete Optimization vol.6

      Pages: 23-36

    • NAID

      110004741449

    • Related Report
      2010 Self-evaluation Report
    • Peer Reviewed
  • [Journal Article] Augmenting edge-connectivity between vertex subsets2009

    • Author(s)
      Toshimasa Ishii, Kazuhisa Makino
    • Journal Title

      Proceedings of the 15th Computing Theory : The Australian Theory Symposium

      Pages: 45-51

    • NAID

      110007081988

    • Related Report
      2010 Self-evaluation Report
    • Peer Reviewed
  • [Journal Article] Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs2009

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Journal of Discrete Algorithms 7

      Pages: 570-578

    • NAID

      120006549569

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An O(n^{1.75})algorithm for L(2, 1)-labeling of trees2009

    • Author(s)
      Toru Hasunuma
    • Journal Title

      Theoretical Computer Science 410

      Pages: 3702-3710

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Posi-modular systems with modulotone requirements under permutation constraints2009

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Proceedings of the 20th International Symposium on Algorithms and Computation

      Pages: 473-482

    • NAID

      110007995594

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A linear time algorithm for L(2, 1)-labeling of trees2009

    • Author(s)
      Toru Hasunuma
    • Journal Title

      Proceedings of the 17th Annual European Symposium on Algorithms

      Pages: 35-46

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Minimum augmentation of edge-connectivity with monotone require ments in undirected graphs2009

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Discrete Optimization 6

      Pages: 23-36

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Augmenting edgeconnectivity between vertex subsets2009

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Proceedings of the 15^th Computing Theory : The Australian Theory Symposium

      Pages: 45-51

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An O(n^{1.75}) algorithm for L(2, 1)-labeling of trees2008

    • Author(s)
      Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
    • Journal Title

      Proceedings of the 11th Scandinavian Workshop on Algorithm Theory

      Volume: vol.410 Pages: 185-197

    • DOI

      10.1007/978-3-540-69903-3_18

    • NAID

      120006654464

    • ISBN
      9783540699002, 9783540699033
    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] An O(n^{1.75}) algorithm for L(2, 1)-labeling of trees2008

    • Author(s)
      Toru Hasunuma
    • Journal Title

      Proceedings of the 11th Scandinavian Workshop on Algorithm Theory

      Pages: 185-197

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Presentation] The (p, q)-total labeling problem for trees2010

    • Author(s)
      Toshimasa Ishii
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      関西大学
    • Year and Date
      2010-11-19
    • Related Report
      2011 Final Research Report
  • [Presentation] The (p,q)-total labeling problem for trees2010

    • Author(s)
      Toshimasa Ishii
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      関西大学
    • Year and Date
      2010-11-19
    • Related Report
      2010 Annual Research Report
  • [Presentation] A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs2010

    • Author(s)
      Toshimasa Ishii
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      立命館大学
    • Year and Date
      2010-04-22
    • Related Report
      2011 Final Research Report
  • [Presentation] A tight upper bound on the (2,1)-total labeling number of outerplanar graphs2010

    • Author(s)
      Toshimasa Ishii
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      立命館大学
    • Year and Date
      2010-04-22
    • Related Report
      2010 Annual Research Report
  • [Presentation] Posi-modular systems with modulotone requirements under permutation constraints2009

    • Author(s)
      Toshimasa Ishii
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      名古屋大学
    • Year and Date
      2009-11-27
    • Related Report
      2011 Final Research Report
  • [Presentation] 木のL (2, 1)-ラベリングに対する線形時間アルゴリズム2009

    • Author(s)
      小野廣隆
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      名古屋大学
    • Year and Date
      2009-11-27
    • Related Report
      2011 Final Research Report
  • [Presentation] Posi-modular Systems with Modulotone Requirements under Permutation Constraints2009

    • Author(s)
      Toshimasa Ishii
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      名古屋大学
    • Year and Date
      2009-11-27
    • Related Report
      2009 Annual Research Report
  • [Presentation] 木のL(2, 1)-ラベリングに対する線形時間アルゴリズム2009

    • Author(s)
      小野廣隆
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      名古屋大学
    • Year and Date
      2009-11-27
    • Related Report
      2009 Annual Research Report
  • [Presentation] Recent advances on the L(2, 1)-labeling problem2009

    • Author(s)
      Hirotaka Ono
    • Organizer
      The 7th Japan Conference on Computational Geometry and Graphs
    • Place of Presentation
      金沢文化ホール
    • Year and Date
      2009-11-11
    • Related Report
      2011 Final Research Report
  • [Presentation] Recent advances on the L(2, 1)-labeling problem2009

    • Author(s)
      小野廣隆
    • Organizer
      The 7th Japan Conference on Computational Geometry and Graphs
    • Place of Presentation
      金沢市文化ホール
    • Year and Date
      2009-11-11
    • Related Report
      2009 Annual Research Report
  • [Presentation] Augmenting edge-connectivity between vertex subsets2009

    • Author(s)
      Toshimasa Ishii
    • Organizer
      6^th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Renyi Institute, Budapest, Hungary
    • Year and Date
      2009-05-18
    • Related Report
      2011 Final Research Report
  • [Presentation] Augmenting edge-connectivity between vertex subsets2009

    • Author(s)
      Toshimasa Ishii
    • Organizer
      6^<th> Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Renyi Institute, Budapest, Hungary
    • Year and Date
      2009-05-18
    • Related Report
      2009 Annual Research Report
  • [Presentation] A faster algorithm for L(2, 1)-labeling of trees2009

    • Author(s)
      Hirotaka Ono
    • Organizer
      The 2nd Asian Association for Algorithms and Computation Annual Meeting
    • Place of Presentation
      Hangzhou Huajia SHAN Resort, Hangzhou, China
    • Year and Date
      2009-04-11
    • Related Report
      2011 Final Research Report 2009 Annual Research Report
  • [Presentation] Augmenting edge-connectivity between vertex subsets2008

    • Author(s)
      Toshimasa Ishii
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      大阪大学
    • Year and Date
      2008-11-07
    • Related Report
      2011 Final Research Report 2008 Annual Research Report
  • [Presentation] 木のL (2, 1) ラベリングに対する線形時間アルゴリズム2008

    • Author(s)
      小野廣隆
    • Organizer
      日本応用数理学会2008年度年会
    • Place of Presentation
      東京大学
    • Year and Date
      2008-09-17
    • Related Report
      2011 Final Research Report
  • [Presentation] 木のL(2, 1)ラベリングに対する線形時間アルゴリズム2008

    • Author(s)
      小野廣隆
    • Organizer
      日本応用数理学会2008年度年会
    • Place of Presentation
      東京大学
    • Year and Date
      2008-09-17
    • Related Report
      2008 Annual Research Report
  • [Presentation] An O(n log^2 n) algorithm for L(2, 1)-labeling of trees2008

    • Author(s)
      小野廣隆
    • Organizer
      日本オペレーションズ・リサーチ学会秋季研究発表会
    • Place of Presentation
      札幌コンベンションセンター
    • Year and Date
      2008-09-11
    • Related Report
      2011 Final Research Report
  • [Presentation] An O(n log^2 n) algorithm for L(2, 1)-labeling of trees2008

    • Author(s)
      小野廣隆
    • Organizer
      日本オペレーションズリサーチ学会秋季研究発表会
    • Place of Presentation
      札幌コンベンションセンター
    • Year and Date
      2008-09-11
    • Related Report
      2008 Annual Research Report
  • [Presentation] An O(n log^2 n) algorithm for L(2, 1)-labeling of trees2008

    • Author(s)
      小野廣隆
    • Organizer
      FIT2008
    • Place of Presentation
      慶應義塾大学
    • Year and Date
      2008-09-03
    • Related Report
      2011 Final Research Report
  • [Presentation] An O(n log^2 n)algorithm for L(2, 1)-labeling of trees2008

    • Author(s)
      小野廣隆
    • Organizer
      FIT2008(第7回情報科学技術フォーラム)
    • Place of Presentation
      慶応義塾大学
    • Year and Date
      2008-09-03
    • Related Report
      2008 Annual Research Report
  • [Presentation] An O(n^{1.75})-time Algorithm for L(2, 1)-labeling of Trees2008

    • Author(s)
      小野廣隆
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      九州産業大学
    • Year and Date
      2008-05-13
    • Related Report
      2011 Final Research Report
  • [Presentation] An O(n^{1.75})-time Algorithm for L(2, 1) labeling of Trees2008

    • Author(s)
      Hirotaka Ono
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      九州産業大学
    • Year and Date
      2008-05-13
    • Related Report
      2008 Annual Research Report
  • [Book] 朝倉書店2011

    • Author(s)
      茨木俊秀,片山徹,藤重悟
    • Publisher
      数理工学事典
    • Related Report
      2011 Final Research Report
  • [Book] 数理工学事典2011

    • Author(s)
      茨木俊秀
    • Publisher
      朝倉書店
    • Related Report
      2011 Annual Research Report
  • [Book] 離散数学のすすめ2010

    • Author(s)
      伊藤大雄,宇野裕之
    • Publisher
      現代数学社
    • Related Report
      2011 Final Research Report
  • [Book] 朝倉書店2010

    • Author(s)
      茨木俊秀,永持仁,石井利昌
    • Publisher
      グラフ理論-連結構造とその応用
    • Related Report
      2011 Final Research Report
  • [Book] グラフ理論.連結構造とその応用2010

    • Author(s)
      茨木俊秀, 永持仁, 石井利昌
    • Publisher
      朝倉書店
    • Related Report
      2010 Self-evaluation Report
  • [Book] グラフ理論-連結構造とその応用-2010

    • Author(s)
      茨木俊秀
    • Publisher
      朝倉書店
    • Related Report
      2010 Annual Research Report
  • [Book] 離散数学のすすめ2010

    • Author(s)
      伊藤大雄
    • Publisher
      現代数学社
    • Related Report
      2010 Annual Research Report
  • [Remarks] 1.研究代表者のURL:

    • URL

      http://www.otaru-uc.ac.jp/~ishii/

    • Related Report
      2011 Final Research Report
  • [Remarks] 2.機関リポジトリで公開している論文にアクセスするためのアドレス:

    • Related Report
      2011 Final Research Report
  • [Remarks]

    • URL

      http://arxiv.org/abs/0911.4590

    • Related Report
      2011 Final Research Report
  • [Remarks]

    • URL

      http://arxiv.org/abs/0810.0906

    • Related Report
      2011 Final Research Report
  • [Remarks]

    • URL

      http://www.otaru-uc.ac.jp/~ishii/

    • Related Report
      2011 Annual Research Report
  • [Remarks] 研究代表者のURL

    • URL

      http://www.otaru-uc.ac.jp/~ishii/

    • Related Report
      2010 Self-evaluation Report
  • [Remarks] 機関リポジトリで公開している論文にアクセスするためのアドレス:

    • URL

      http://barrel.ih.otaru-uc.ac.jp/researcher?action=viewResearcherPage&researcherId=11

    • Related Report
      2010 Self-evaluation Report
  • [Remarks]

    • URL

      http://arxiv.org/find/cs/1/au:+Ishii_T/0/1/0/all/0/1

    • Related Report
      2010 Self-evaluation Report
  • [Remarks]

    • URL

      http://www.otaru-uc.ac.jp/~ishii/

    • Related Report
      2010 Annual Research Report
  • [Remarks]

    • URL

      http://www.otaru-uc.ac.jp/~ishii/

    • Related Report
      2009 Annual Research Report
  • [Remarks]

    • URL

      http://www.otaru-uc.ac.jp/~ishii/

    • Related Report
      2008 Annual Research Report

URL: 

Published: 2008-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi