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

ISHII Toshimasa  石井 利昌

ORCIDConnect your ORCID iD *help
Researcher Number 30324487
Other IDs
External Links
Affiliation (Current) 2022: 北海道大学, 経済学研究院, 教授
Affiliation (based on the past Project Information) *help 2017 – 2021: 北海道大学, 経済学研究院, 教授
2016: 北海道大学, 経済学研究科(研究院), 教授
2016: 北海道大学, 経済学研究科, 教授
2012 – 2015: 北海道大学, 経済学研究科(研究院), 准教授
2013: 北海道大学, 大学院経済学研究科, 准教授 … More
2006 – 2011: 小樽商科大学, 商学部, 准教授
2006: 小樽商科大学, 商学部, 助教授
2000 – 2005: 豊橋技術科学大学, 工学部, 助手 Less
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / 計算機科学 / Theory of informatics
Except Principal Investigator
Science and Engineering / Social systems engineering/Safety system / Theory of informatics / 計算機科学 / Social systems engineering/Safety system / Basic Section 25010:Social systems engineering-related
Keywords
Principal Investigator
組合せ最適化 / アルゴリズム / グラフ理論 / ネットワーク設計 / 離散最適化 / 連結度 / グラフ連結度 / 計算機工学 / グラフ・ネットワーク / 連結度増大問題 … More / 供給点配置問題 / 多項式時間アルゴリズム / 近似アルゴリズム / ネットワーク設計データ構造 / データ構造 / グラフ分割 / アルゴリズム理論 / 距離制約付きラベリング / グラフの直径 … More
Except Principal Investigator
アルゴリズム / ファイナンス / 金融リスク管理 / リスク管理 / グラフ理論 / 離散最適化 / 最適化 / 連結度 / 近似アルゴリズム / ネットワーク問題 / グラフ連結度 / approximation algorithm / システミックリスク / 金融リスク / オペレーションズ・リサーチ / Webコンテンツ活用 / テキストマイニング / 要因表現抽出 / 最小辺ランキング / ネットワーク信頼性 / 連結全域部分木 / Webページ本文切り出し / Webコンテンツ / 解散最適化 / 情報抽出 / テキストマイニングアルゴリズム / ゲラフアルゴリズム / 要約 / ファイナンス理論 / マーケットマイクロス / リアルオプション / 離散数学 / アルゴリズム論 / 組合せゲーム / 正モジュラ / 固定パラメータ容易 / グラフアルゴリズム / 最小カット / 組合せ最適化 / 組合せ最適化ゲーム / グラフ分割 / 連結度増大 / 最小カット問題 / 協力ゲーム / 劣モジュール関数 / グラフ・ネットワーク / 劣モジュラ関数 / graph algorithm / minimum cut / connectivity / combinatorial optimization / combinatorial optimization game / graph partition / connectivity augmentation / 多項式アルゴリズム / 最大流問題 / 点連結度 / 枝連結度 / 最大隣接順序 / スケジューリング問題 / 矩形分割問題 / 供給点配置問題 / 連結度増大問題 / 耐故障性 / ネットワークトポロジー / ネットワーク設計 / スケジューリングアルゴリズム / 最適化アルゴリズム / NP-困難性 / データ構造 / graph connectivity / polynomial algorithm / network problem / maximum flow problem / vertex connectivity / edge connectivity / maximum adjacency order / 企業合併 / 保険 / 再保険 Less
  • Research Projects

    (12 results)
  • Research Products

    (118 results)
  • Co-Researchers

    (20 People)
  •  再保険ネットワークのリスク管理と保険システムの救済問題に関する研究

    • Principal Investigator
      鈴木 輝好
    • Project Period (FY)
      2018 – 2020
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Review Section
      Basic Section 25010:Social systems engineering-related
    • Research Institution
      Hokkaido University
  •  ネットワーク構造を有する離散最適化問題に対する高性能アルゴリズムとその応用Principal Investigator

    • Principal Investigator
      石井 利昌
    • Project Period (FY)
      2016 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Hokkaido University
  •  Studies on the financial risk management and the public fund distribution under systemic risks

    • Principal Investigator
      SUZUKI Teruyoshi
    • Project Period (FY)
      2015 – 2017
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Social systems engineering/Safety system
    • Research Institution
      Hokkaido University
  •  Development of efficient algorithms based on enumeration structures

    • Principal Investigator
      Makino Kazuhisa
    • Project Period (FY)
      2014 – 2019
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyoto University
  •  Studies on graph theoretical approaches for robust network design and its generalizationsPrincipal Investigator

    • Principal Investigator
      Ishii Toshimasa
    • Project Period (FY)
      2012 – 2015
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Hokkaido University
  •  An unified evaluation model for the financial systemic risk under financial crisis

    • Principal Investigator
      SUZUKI Teruyoshi
    • Project Period (FY)
      2011 – 2013
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Social systems engineering/Safety system
    • Research Institution
      Hokkaido University
  •  Studies on the design of algorithms for reliable networks and its applicationPrincipal Investigator

    • Principal Investigator
      ISHII Toshimasa
    • Project Period (FY)
      2008 – 2011
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Otaru University of Commerce
  •  耐故障性を考慮したネットワーク設計問題に関するグラフアルゴリズムの研究Principal Investigator

    • Principal Investigator
      石井 利昌
    • Project Period (FY)
      2005 – 2007
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Otaru University of Commerce
      Toyohashi University of Technology
  •  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
  •  Construction of Approximation Algorithms Based on Graph Theory and Its Application to Network Problems

    • Principal Investigator
      NAGAMOCHI Hiroshi
    • Project Period (FY)
      2002 – 2004
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      Kyoto University
      Toyohashi University of Technology
  •  グラフの連結度増大問題に関する研究Principal Investigator

    • Principal Investigator
      石井 利昌
    • Project Period (FY)
      2001 – 2002
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      計算機科学
    • Research Institution
      Toyohashi University of Technology
  •  Development of algorithms for solving graph/network problems

    • Principal Investigator
      NAGAMOCHI Hiroshi
    • Project Period (FY)
      1998 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas (B)
    • Research Institution
      Toyohashi University of Technology (TUT)
      Kyoto University

All 2022 2019 2018 2017 2016 2015 2014 2013 2012 2010 2009 2008 2007 2006 2005 2004 Other

All Journal Article Presentation Book

  • [Book] 朝倉書店2010

    • Author(s)
      茨木俊秀,永持仁,石井利昌
    • Publisher
      グラフ理論-連結構造とその応用
    • Data Source
      KAKENHI-PROJECT-20700002
  • [Book] グラフ理論.連結構造とその応用2010

    • Author(s)
      茨木俊秀, 永持仁, 石井利昌
    • Publisher
      朝倉書店
    • Data Source
      KAKENHI-PROJECT-20700002
  • [Journal Article] Posimodular function optimization2022

    • Author(s)
      Magnus M. Halldorsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
    • Journal Title

      Algorithmica

      Volume: 84 Pages: 1107-1131

    • DOI

      10.1007/s00453-021-00910-y

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00001, KAKENHI-PROJECT-20K11699, KAKENHI-PROJECT-19K22841
  • [Journal Article] Settlement fund circulation problem2019

    • Author(s)
      Hitoshi Hayakawa, Toshimasa Ishii,Hirotaka Ono, Yushi Uno
    • Journal Title

      Discrete Applied Mathematics

      Volume: 印刷中

    • NAID

      120007126840

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00001
  • [Journal Article] Settlement fund circulation problem2019

    • Author(s)
      Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono and Yushi Uno
    • Journal Title

      Discrete Applied Mathematics

      Volume: 印刷中 Pages: 86-103

    • DOI

      10.1016/j.dam.2019.03.017

    • NAID

      120007126840

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26280001, KAKENHI-PROJECT-16K00001, KAKENHI-PROJECT-17K00017, KAKENHI-PROJECT-18H01652, KAKENHI-PROJECT-17H01698
  • [Journal Article] Settlement Fund Circulation Problem2017

    • Author(s)
      Hitoshi Hayakawa, Toshimasa Ishii,Hirotaka Ono, Yushi Uno
    • Journal Title

      International Symposium on Algorithms and Computation 2017(ISAAC 2017)

      Volume: 92 Pages: 1-46

    • DOI

      10.4230/LIPIcs.ISAAC.2017.46

    • NAID

      120007126840

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00001, KAKENHI-PROJECT-26280001, KAKENHI-PROJECT-15H02965, KAKENHI-PROJECT-17H01698, KAKENHI-PROJECT-26540005
  • [Journal Article] Posimodular Function Optimization2017

    • Author(s)
      Magnus M. Halldorsson, Toshimasa Ishii,Kazuhisa Makino, Kenjiro Takazawa
    • Journal Title

      Proc. Algorithms and Data Structure Symposium

      Volume: 10389 Pages: 437-448

    • DOI

      10.1007/978-3-319-62127-2_37

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00001, KAKENHI-PROJECT-16K16012, KAKENHI-PROJECT-26280001, KAKENHI-WRAPUP-17H06074, KAKENHI-PROJECT-15H02965
  • [Journal Article] (Total) Vector domination for graphs with bounded branchwidth2016

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

      Discrete Applied Mathematics

      Volume: 207 Pages: 80-89

    • DOI

      10.1016/j.dam.2016.03.002

    • NAID

      120006488392

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-15H02965, KAKENHI-PROJECT-26280001, KAKENHI-PROJECT-16K00001, KAKENHI-PROJECT-26540005
  • [Journal Article] Subexponential fixed-parameter algroithms for partial vector domination2016

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

      Discrete Optimization

      Volume: 未定

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H02965
  • [Journal Article] Subexponential fixed-parameter algorithms for partial vector domination2016

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

      Discrete Optimization

      Volume: 22 Pages: 111-121

    • DOI

      10.1016/j.disopt.2016.01.003

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24700001, KAKENHI-PROJECT-26540005
  • [Journal Article] 正モジュラ関数の最適化2015

    • Author(s)
      石井 利昌,牧野 和久
    • Journal Title

      FIT2015 (第14回情報科学技術フォーラム) 講演論文集

      Volume: 1 Pages: 1-6

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-24700001
  • [Journal Article] 正モジュラ関数の最適化2015

    • Author(s)
      石井 利昌,牧野 和久
    • Journal Title

      FIT2015 (第14回情報科学技術フォーラム) 講演論文集

      Volume: 1 Pages: 1-6

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15H02965
  • [Journal Article] (Total) Vector Domination for Graphs with Bounded Branchwidth2014

    • Author(s)
      T. Ishii,H. Ono, and Y. Uno
    • Journal Title

      LATIN 2014: Theoretical Informatics, Lecture Notes in Computer Science

      Volume: - Pages: 238-249

    • DOI

      10.1007/978-3-642-54423-1_21

    • NAID

      120006488392

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700001, KAKENHI-PUBLICLY-25104521
  • [Journal Article] Subexponential fixed-parameter algroithms for partial vector domination2014

    • Author(s)
      T. Ishii, H. Ono, Y. Uno
    • Journal Title

      LNCS

      Volume: - Pages: 292-304

    • DOI

      10.1007/978-3-319-09174-7_25

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700001, KAKENHI-PROJECT-26280001
  • [Journal Article] (Total) vector domination for graphs with bounded branchwidth2014

    • Author(s)
      T. Ishii, H. Ono and Y. Uno
    • Journal Title

      11th Latin American Theoretical Informatics Symposium (LATIN 2014)

      Pages: 238-249

    • NAID

      120006488392

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23310098
  • [Journal Article] Augmenting edge-connectivity between vertex subsets2014

    • Author(s)
      T. Ishii and K. Makino
    • Journal Title

      Algorithmica

    • NAID

      110007081988

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23310098
  • [Journal Article] Algorithmic aspects of distance constrained labeling: a survey2014

    • Author(s)
      T. Hasunuma, T. Ishii, H. Ono, Y. Uno
    • Journal Title

      International Journal of Networking and Computing

      Volume: 4 Pages: 251-259

    • NAID

      130004709087

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24700001
  • [Journal Article] Augmenting Edge-Connectivity between Vertex Subsets2014

    • Author(s)
      T. Ishii,K. Makino
    • Journal Title

      Algorithmica

      Volume: - Pages: 130-147

    • DOI

      10.1007/s00453-012-9724-5

    • NAID

      110007081988

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-23310098, KAKENHI-PROJECT-24700001, KAKENHI-PLANNED-24106002
  • [Journal Article] Subexponential fixed-parameter algroithms for partial vector domination2014

    • Author(s)
      T. Ishii, H. Ono and Y. Uno
    • Journal Title

      3rd International Symposium on Combinatorial Optimization (ISCO 2014)

      Volume: 印刷中

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23310098
  • [Journal Article] Augmenting outerplanar graphs to meet diameter requirements2013

    • Author(s)
      T. Ishii
    • Journal Title

      Journal of Graph Theory

      Volume: 74

    • DOI

      10.1002/jgt.21719

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700001
  • [Journal Article] Augmenting outerplanar graphs to meet diameter requirements2013

    • Author(s)
      T. Ishii
    • Journal Title

      Journal of Graph Theory

      Volume: 74 Pages: 392-416

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23310098
  • [Journal Article] Concentrated Equilibrium and Intraday Patterns in Financial Markets2013

    • Author(s)
      Ryosuke Ishii and Katsumasa Nishide
    • Journal Title

      Applied Mathematical Finance

      Volume: 20 Pages: 50-68

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23310098
  • [Journal Article] A linear time algorithm for L(2,1)-labeling of trees2013

    • Author(s)
      Hasunuma T., Ishii T., Ono H., Uno Y.
    • Journal Title

      Algorithmica

      Volume: (印刷中) 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 linear time algorithm for L(2,1)labeling for trees2013

    • Author(s)
      T. Hasunuma, T. Ishii, H. Ono and Y. Uno
    • Journal Title

      Algorithmica

      Volume: 66 Pages: 654-681

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23310098
  • [Journal Article] The (p,q)-total labeling problem for trees2012

    • Author(s)
      Toru Hasunuma, Toshimasa Ishii
    • Journal Title

      Discrete Mathematics

      Volume: 312 Pages: 1407-1420

    • NAID

      110007995637

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23310098
  • [Journal Article] Graph Augmentation Problem with Diameter Requirements2012

    • Author(s)
      T. Ishii
    • Journal Title

      Third International Conference on Networking and Computing, ICNC 2012

      Volume: - Pages: 393-398

    • DOI

      10.1109/icnc.2012.75

    • Peer Reviewed
    • Data Source
      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

      J. 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] Augmenting outerplanar graphs to meet diameter requirements2012

    • Author(s)
      Toshimasa Ishii
    • Journal Title

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

      Volume: 18 Pages: 123-132

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23310098
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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 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] 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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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 Pages: 61-76

    • DOI

      10.1142/s1793830910000474

    • NAID

      110007995594

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [Journal Article] The (p, q)-total Labeling Problem for Trees2010

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

      IWOCA

      Volume: 2 Pages: 103-106

    • DOI

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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002, KAKENHI-PROJECT-21680001
  • [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 Pages: 413-436

    • DOI

      10.1007/s00453-008-9178-y

    • NAID

      120001466862

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

      Theor. Comput. Sci

      Volume: vol.410 Pages: 3702-3710

    • DOI

      10.1016/j.tcs.2009.04.025

    • NAID

      110006881045

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002, KAKENHI-PROJECT-21500017, KAKENHI-PROJECT-21680001
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

      ESA

      Pages: 35-46

    • DOI

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

    • NAID

      110007995596

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002, KAKENHI-PROJECT-21680001
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

      Pages: 570-578

    • DOI

      10.1016/j.jda.2009.06.003

    • NAID

      120006549569

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700002
  • [Journal Article] Bisecting a four-connected graph with three resource sets2007

    • Author(s)
      Toshimasa Ishii, Kengo Iwata and Hiroshi Nagamochi
    • Journal Title

      Discrete Applied Mathematics 155

      Pages: 1441-1450

    • NAID

      120000803001

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] Source location problem with local 3-vertex-connectivity requirements2007

    • Author(s)
      Toshimasa Ishii, Hitoshi Fujita and Hiroshi Nagamochi
    • Journal Title

      Discrete Applied Mathematics 155

      Pages: 2523-2538

    • NAID

      120000803712

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] Bisecting a four-connected graph with three resource sets2007

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Discrete Applied Mathematics 155

      Pages: 1441-1450

    • NAID

      120000803001

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Source location problem with local 3-vertex-Connectivity requirements2007

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Discrete Applied Mathematics 155

      Pages: 2523-2538

    • NAID

      120000803712

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Minimum cost source location problem with local 3-vertex-connectivity requirements2007

    • Author(s)
      Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
    • Journal Title

      Theoretical Computer Science Vol. 372

      Pages: 81-93

    • NAID

      120000802939

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Minimum cost source location problem with local 3-vertex-connectivity requirements2007

    • Author(s)
      Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi
    • Journal Title

      Theoretical Computer Science vol.372

      Pages: 81-93

    • NAID

      120000802939

    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs2007

    • Author(s)
      Toshimasa Ishii
    • Journal Title

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

      Pages: 91-100

    • NAID

      110004741449

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs2007

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Proceedings of the 18th Annual International Sy mposium on Algorithms and Computation

      Pages: 29-40

    • NAID

      120006549569

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs2006

    • Author(s)
      Toshimasa Ishii, Masayuki Hagiwara
    • Journal Title

      Discrete Applied Mathematics Vol. 154

      Pages: 2307-2329

    • NAID

      120000803126

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Augmenting Forests to Meet Odd Diameter Requirements2006

    • Author(s)
      Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
    • Journal Title

      Discrete Optimization Vol. 3

      Pages: 154-164

    • NAID

      120000802919

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Augmenting a (k-1)-vertex-connected multigraph to an 1-edge-connected and k-vertex-connected multigraph2006

    • Author(s)
      Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    • Journal Title

      Algorithmica Vo. 44,no. 3

      Pages: 257-280

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph2006

    • Author(s)
      Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    • Journal Title

      Algorithmica vol.44, no.3

      Pages: 257-280

    • NAID

      110003478497

    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] Augmenting a (k-l)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph2006

    • Author(s)
      Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    • Journal Title

      Algorithmica Vol.44, no.3

      Pages: 257-280

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Augmenting Forests to Meet Odd Diameter Requirements2006

    • Author(s)
      Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
    • Journal Title

      Discrete Optimization vol.3

      Pages: 154-164

    • NAID

      120000802919

    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] Bisecting a four-connected graph with three resource sets2005

    • Author(s)
      Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
    • Journal Title

      The 16th Annual international symposium on Algorithms and Computation

      Pages: 176-185

    • NAID

      120000803001

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Bisecting a four-connected graph with three resource sets2005

    • Author(s)
      Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
    • Journal Title

      Proceedings of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Pages: 107-113

    • NAID

      120000803001

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] A robust algorithm for bisecting a triconnected graph with two resource sets2005

    • Author(s)
      Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii
    • Journal Title

      Theoretical Computer Science A Vol.341

      Pages: 364-378

    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] タンク繰りにおける経路探索法2005

    • Author(s)
      石井利昌, 永持仁, 高橋健吾, 西垣豊, 武田真人
    • Journal Title

      システム制御情報学会論文誌 vol.18,no.6

      Pages: 213-221

    • NAID

      10016147943

    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] A robust algorithm for bisecting a triconnected graph with two resource sets2005

    • Author(s)
      Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii
    • Journal Title

      Theoretical Computer Science A Vol.341

      Pages: 364-378

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] タンク繰りにおける経路探索法2005

    • Author(s)
      石井利昌, 永持仁, 高橋健吾, 西垣豊, 武田真人
    • Journal Title

      システム制御情報学会論文誌 Vol.18, no.6

      Pages: 213-221

    • NAID

      10016147943

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] A simple recognition of maximal planar graphs2004

    • Author(s)
      H.Nagamochi, K.Suzuki, T.Ishii
    • Journal Title

      Information Processing Letters 89/5

      Pages: 223-226

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] A simple recognition of maximal planar graphs2004

    • Author(s)
      H.Nagamochi, K.Suzuki, T.Ishii
    • Journal Title

      Information Processing Letters 89・5

      Pages: 223-226

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs

    • Author(s)
      Toshimasa Ishii, Masayuki Hagiwara
    • Journal Title

      Discrete Applied Mathematics (掲載決定済)

    • NAID

      120000803126

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Augmenting a (k-1)-vertex-connected multigraph to an /-edge-connected and k-vertex-connected multigraph

    • Author(s)
      T.Ishii, H.Nagamochi, T.Ibaraki
    • Journal Title

      Algorithmica (発行予定)

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] A routing algorithm on a storage tank system (in Japanese)

    • Author(s)
      T.Ishii, H.Nagamochi, Y.Nishigaki, K.Takahashi, M.Takeda
    • Journal Title

      ISCIE Journal Systems (発行予定)

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Augmenting Forests to Meet Odd Diameter Requirements

    • Author(s)
      Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
    • Journal Title

      Discrete Optimization (掲載決定済)

    • NAID

      120000802919

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Augmenting a (k-1)-vertex-connected multigraph to an/-edge-connected and k-vertex-connected multigraph

    • Author(s)
      T.Ishii, H.Nagamochi, T.Ibaraki
    • Journal Title

      Algorithmica (発行予定)

    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] A routing algorithm on a storage tank system (in Japanese)

    • Author(s)
      T.Ishii, H.Nagamochi, Y.Nishigaki, K.Takahashi, M.Takeda
    • Journal Title

      ISCIE Journal Systems (発行予定)

    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Augmenting Forests to Meet Odd Diameter Requirements

    • Author(s)
      Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi
    • Journal Title

      Discrete Optimization (掲載予定)

    • NAID

      120000802919

    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] Bisecting a four-connected graph with three resource sets

    • Author(s)
      Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
    • Journal Title

      Discrete Applied Mathematics (掲載決定済)

    • NAID

      120000803001

    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph

    • Author(s)
      Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    • Journal Title

      Algorithmica (掲載予定)

    • NAID

      110003478497

    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs

    • Author(s)
      Toshimasa Ishii, Masayuki Hagiwara
    • Journal Title

      Discrete Applied Mathematics vol.154, issue 16

      Pages: 2307-2329

    • NAID

      120000803126

    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] Bisecting a four-connected graph with three resource sets

    • Author(s)
      Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
    • Journal Title

      Discrete Applied Mathematics (掲載予定)

    • NAID

      120000803001

    • Data Source
      KAKENHI-PROJECT-16092213
  • [Journal Article] Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs

    • Author(s)
      Toshimasa Ishii
    • Journal Title

      Algorithmica (掲載決定済)

    • NAID

      120001466862

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17700011
  • [Journal Article] Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph

    • Author(s)
      T.Ishii, H.Nagamochi, T.Ibaraki
    • Journal Title

      Algorithmica (to appear)

    • NAID

      110003478497

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] A routing algorithm on a storage tank system (in Japanese)

    • Author(s)
      T.Ishii, H.Nagamochi, Y.Nishigaki, K.Takahashi, M.Takeda
    • Journal Title

      ISCIE Journal Systems (to appear)

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Presentation] On settlement fund circulation problem2018

    • Author(s)
      Toshimasa Ishii
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-15H02965
  • [Presentation] On settlement fund circulation problem2018

    • Author(s)
      Hitoshi Hayakawa, Toshimasa Ishii,Hirotaka Ono, Yushi Uno
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-16K00001
  • [Presentation] Posimodular function optimization2017

    • Author(s)
      Toshimasa Ishii
    • Organizer
      15th Algorithms and Data Structures Symposium
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15H02965
  • [Presentation] Settlement fund circulation problem2017

    • Author(s)
      Toshimasa Ishii
    • Organizer
      28th International Symposium on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15H02965
  • [Presentation] Settlement fund circulation problem2017

    • Author(s)
      Hitoshi Hayakawa, Toshimasa Ishii,Hirotaka Ono, Yushi Uno
    • Organizer
      28th International Symposium on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00001
  • [Presentation] Posimodular function optimization2017

    • Author(s)
      Magnus M. Halldorsson, Toshimasa Ishii,Kazuhisa Makino, Kenjiro Takazawa
    • Organizer
      15th Algorithms and Data Structures Symposium
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00001
  • [Presentation] 正モジュラ関数の最適化2015

    • Author(s)
      石井 利昌,牧野 和久
    • Organizer
      FIT2015
    • Place of Presentation
      愛媛大学
    • Year and Date
      2015-09-15
    • Data Source
      KAKENHI-PROJECT-26280001
  • [Presentation] 正モジュラ関数の最適化2015

    • Author(s)
      石井 利昌,牧野 和久
    • Organizer
      FIT2015 (第14回情報科学技術フォーラム)
    • Place of Presentation
      愛媛大学城北キャンパス (愛媛県松山市)
    • Year and Date
      2015-09-15
    • Data Source
      KAKENHI-PROJECT-24700001
  • [Presentation] (Total) vector domination for graphs with bounded branchwidth2014

    • Author(s)
      T.Ishii,H. Ono, and Y. Uno
    • Organizer
      11th Latin American Theoretical Informatics Symposium (LATIN 2014)
    • Place of Presentation
      Four Points by Sheraton (ウルグアイ,モンテビデオ)
    • Data Source
      KAKENHI-PROJECT-24700001
  • [Presentation] (Total) vector domination for graphs with bounded branchwidth2014

    • Author(s)
      Toshimasa Ishii,Hirotaka Ono, Yushi Uno
    • Organizer
      情報処理学会AL
    • Place of Presentation
      道後温泉大和屋
    • Year and Date
      2014-06-13
    • Data Source
      KAKENHI-PROJECT-26280001
  • [Presentation] Subexponential fixed-parameter algroithms for partial vector domination2014

    • Author(s)
      T.Ishii,H. Ono, and Y. Uno
    • Organizer
      3rd International Symposium on Combinatorial Optimization (ISCO 2014)
    • Place of Presentation
      Radisson Blu Hotel (ポルトガル,リスボン)
    • Data Source
      KAKENHI-PROJECT-24700001
  • [Presentation] 連結度制約をもつネットワーク構成問題2013

    • Author(s)
      石井利昌
    • Organizer
      京都大学数理解析研究所「組合せ最適化セミナー」
    • Place of Presentation
      京都大学数理解析研究所 (京都市)
    • Invited
    • Data Source
      KAKENHI-PROJECT-24700001
  • [Presentation] Graph augmentation problem with diameter requirements2012

    • Author(s)
      T. Ishii
    • Organizer
      3rd International Conference on Networking and Computing
    • Place of Presentation
      沖縄県男女共同参画センター(那覇市)
    • Data Source
      KAKENHI-PROJECT-23310098
  • [Presentation] Graph Augmentation Problem with Diameter Requirements2012

    • Author(s)
      T. Ishii
    • Organizer
      Third International Conference on Networking and Computing, ICNC 2012
    • Place of Presentation
      沖縄男女共同参画センター(沖縄県)
    • Data Source
      KAKENHI-PROJECT-24700001
  • [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
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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
    • Data Source
      KAKENHI-PROJECT-20700002
  • [Presentation] The (p, q)-total labeling problem for trees2010

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

    • Author(s)
      Toshimasa Ishii
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      関西大学
    • Year and Date
      2010-11-19
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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
    • Data Source
      KAKENHI-PROJECT-20700002
  • [Presentation] Posi-modular Systems with Modulotone Requirements under Permutation Constraints2009

    • Author(s)
      Toshimasa Ishii
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      名古屋大学
    • Year and Date
      2009-11-27
    • Data Source
      KAKENHI-PROJECT-20700002
  • [Presentation] Posi-modular systems with modulotone requirements under permutation constraints2009

    • Author(s)
      Toshimasa Ishii
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      名古屋大学
    • Year and Date
      2009-11-27
    • Data Source
      KAKENHI-PROJECT-20700002
  • [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
    • Data Source
      KAKENHI-PROJECT-20700002
  • [Presentation] Augmenting edge-connectivity between vertex subsets2008

    • Author(s)
      Toshimasa Ishii
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      大阪大学
    • Year and Date
      2008-11-07
    • Data Source
      KAKENHI-PROJECT-20700002
  • [Presentation] 無向グラフにおける節点と節点集合間の辺連結度を増大させる問題について2007

    • Author(s)
      石井利昌
    • Organizer
      2007年度日本オペレーションズ・リサーチ学会北海道支部第一回講演会
    • Place of Presentation
      小樽商科大学
    • Year and Date
      2007-10-29
    • Data Source
      KAKENHI-PROJECT-17700011
  • [Presentation] 無向グラフにおける節点と節点集合間の辺連結度を増大させる問題について2007

    • Author(s)
      石井利昌
    • Organizer
      オペレーションズリサーチ学会北海道支部第一回講演会
    • Place of Presentation
      札幌
    • Data Source
      KAKENHI-PROJECT-16092213
  • [Presentation] Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs2007

    • Author(s)
      Toshimasa Ishii
    • Organizer
      日本応用数理学会2007年度年会
    • Place of Presentation
      札幌
    • Data Source
      KAKENHI-PROJECT-16092213
  • [Presentation] Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs2007

    • Author(s)
      Toshimasa Ishii
    • Organizer
      日本応用数理学会2007年度年会
    • Place of Presentation
      北海道大学
    • Year and Date
      2007-09-17
    • Data Source
      KAKENHI-PROJECT-17700011
  • [Presentation] Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs2007

    • Author(s)
      Toshimasa Ishii
    • Organizer
      The 18th Annual International Symposium on Algorithms and Computation (ISAAC 2007)
    • Place of Presentation
      仙台
    • Data Source
      KAKENHI-PROJECT-16092213
  • [Presentation] (Total) vector domination for graphs with bounded branchwidth

    • Author(s)
      Toshimasa Ishii
    • Organizer
      アルゴリズム研究会 (情報処理学会)
    • Place of Presentation
      道後温泉大和屋 (愛媛県松山市)
    • Year and Date
      2014-06-13 – 2014-06-14
    • Data Source
      KAKENHI-PROJECT-24700001
  • 1.  SUZUKI Teruyoshi (90360891)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 2.  NISHIDE Katsumasa (40410683)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 1 results
  • 3.  NAGAMOCHI Hiroshi (70202231)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 8 results
  • 4.  施 建明 (70287465)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 8 results
  • 5.  八木 恭子 (80451847)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 6.  宮田 亮 (30336383)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 7.  KIJIMA Masaaki (00186222)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 8.  GOTO Makoto (30434286)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 9.  Makino Kazuhisa (60294162)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 4 results
  • 10.  KARUNO Yoshiyuki (80252542)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 11.  増山 繁 (60173762)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 12.  梅村 恭司 (80273324)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 13.  中山 慎一 (50284279)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 14.  本間 宏利 (80249721)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 15.  相田 慎 (60345957)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 16.  高澤 兼二郎 (10583859)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 2 results
  • 17.  藤重 悟 (10092321)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 18.  小野 廣隆
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 11 results
  • 19.  蓮沼 徹
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 4 results
  • 20.  宇野 裕之
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to connect your ORCID iD to this researcher?
* This action can be performed only by the researcher themselves.

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi