YAMAZAKI Koichi 山崎浩一

Researcher Number	00246662
Other IDs
Affiliation *help	2014 – 2015 : 群馬大学, 大学院理工学府, 教授 2013 : 群馬大学, 理工学研究院, 教授 2011 – 2012 : Gunma University, 工学(系)研究科(研究院), 教授 2010 – 2011 : 群馬大学, 大学院・工学研究科, 教授 2010 : Gunma University, 工学(系)研究科(研究院), 准教授 … More
Research Field	Principal Investigator Fundamental theory of informatics / 計算機科学 / Theory of informatics Except Principal Investigator 計算機科学
Keywords	Principal Investigator vertex boundary-width / 近似アルゴリズム / path distance-width / グラフパラメータ / パス距離幅 / volume respecting embeddings / carving-width / 定数近似困難性 / イデアル / approximation algorithms … More Except Principal Investigator 計算量 / Merging Network / グラフアルゴリズム / グラフ描画 / 最適化 / 近似アルゴリズム / マップラベリング / グラフのランキング / 描画 / グラフ分割 / ファイアウォール高速化 / Complete Problems / 完全問題 / グラフ同型問題 / 連結度 / 部分木被覆 / 可視化 / アルゴリズム / 情報の可視化 / 離散最適化 / Complxity / 形式言語理論 / 自然言語処理 / 平面グラフ / 下界 / グラフ連結度 / Formal Language / スケジューリング / 最長路問題 / 機械スケジューリング / ミニマックス問題 / 最小カット / Graph Algoritms / 機械翻訳 / Lower Bound / Algorithm / Approximation Algoritms / 図形パッキング / Computers / 配送スケジューリング / Graphs / Complexity / Optimization / Visualization / マージングネットワーク / 分枝限定法 / パッキング問題 / Language Processing / Graph Isomorphism / 構文解析 / コンピュータによる計算 / Information Visualization / マージングネットワーク / マージング・ネットワーク / Computation / ネットワーク設計 / パッキング / グラフ Less

Tangleの代数的構造の研究Principal InvestigatorOngoing
- Principal Investigator
  
  山崎浩一
- Project Period (FY)
  2015 – 2017
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  Gunma University
Inapproximability of graph width parametersPrincipal Investigator
- Principal Investigator
  
  Yamazaki Koichi
- Project Period (FY)
  2012 – 2015
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Gunma University
A study of graph width parametersPrincipal Investigator
- Principal Investigator
  
  YAMAZAKI Koichi
- Project Period (FY)
  2009 – 2011
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Gunma University
Design of Approximation Algorithms for the Problems with Grapth Structure
- Principal Investigator
  
  NAGAMOCHI Hiroshi
- Project Period (FY)
  2004 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research on Priority Areas
- Research Institution
  Kyoto University
Implementation and evaluation of graph approximation algorithmsPrincipal Investigator
- Principal Investigator
  
  YAMAZAKI Koichi
- Project Period (FY)
  2004 – 2006
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Gunma University
VLSIレイアウト問題に対する近似アルゴリズムの応用Principal Investigator
- Principal Investigator
  
  山崎浩一
- Project Period (FY)
  2001 – 2002
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  計算機科学
- Research Institution
  Gunma University
近似アルゴリズムの研究Principal Investigator
- Principal Investigator
  
  山崎浩一
- Project Period (FY)
  1998 – 1999
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  Gunma University
Aesthetic Drawing Algorithms for Graphs
- Principal Investigator
  
  NAKANO Shin-ichi
- Project Period (FY)
  1998 – 2000
- Research Category
  
  Grant-in-Aid for Scientific Research on Priority Areas (B)
- Research Institution
  Gunma University
  Tohoku University
A Study of the complete Problems for Low-Level Complexity Classes
- Principal Investigator
  
  KASAI Takumi
- Project Period (FY)
  1995 – 1997
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications
Computer Computation to obtain Lower Bounds of Computational Complexity
- Principal Investigator
  
  IWATA Shigeki
- Project Period (FY)
  1995 – 1997
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications

All 2016 2015 2014 2013 2012 2011 2010 2009 2006 2005 Other

All Journal Article Presentation

[Journal Article] Thin strip graphs2016
- Author(s)
  T. Hayashi, A. Kawamura, Y. Otachi, H. Shinohara, K. Yamazaki
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume : -
- Peer Reviewed / Open Access / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-24500007, KAKENHI-PROJECT-25730003, KAKENHI-PROJECT-23240001, KAKENHI-PLANNED-24106004
[Journal Article] 幅系グラフパラメータの近似について2015
- Author(s)
  山崎浩一
- Journal Title
  
  電子情報通信学会技術研究報告
  
  Volume : 115-15 Pages : 9-13
- Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-24500007
[Journal Article] 幅系グラフパラメータの近似について2015
- Author(s)
  山崎浩一
- Journal Title
  
  信学技法 IEICE Technical Report COMP2015-2
  
  Volume : IEICE-115 Pages : 9-13
- Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-24500007
[Journal Article] Tangleとイデアル2015
- Author(s)
  山崎浩一
- Journal Title
  
  信学技法 IEICE Technical Report COMP2014-51
  
  Volume : IEICE-114 Pages : 61-64
- Data Source
  KAKENHI-PROJECT-24500007
[Journal Article] Tangleとイデアルについて2015
- Author(s)
  山崎浩一
- Journal Title
  
  数理解析研究所講究録
  
  Volume : 1849 Pages : 37-40
- Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-24500007
[Journal Article] Tangleとイデアルについて2015
- Author(s)
  山崎浩一
- Journal Title
  
  数理解析研究所講究録
  
  Volume : 1849 Pages : 37-40
- Data Source
  KAKENHI-PROJECT-15K00007
[Journal Article] Lower bounds for treewidth of product graphs2014
- Author(s)
  Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume : 162 Pages : 251-258
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24500007, KAKENHI-PROJECT-25730003
[Journal Article] A revisit of the scheme for computing treewidth and minimum fill-in2014
- Author(s)
  Masanobu Furuse, Koichi Yamazaki
- Journal Title
  
  Theoretical Computer Science
  
  Volume : 531 Pages : 66-76
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24500007
[Journal Article] On 1 + $\epsilon$ strip graphs2012
- Author(s)
  Takashi Hayashi, Hidehiro Shinohara, Koichi Yamazaki
- Journal Title
  
  IEICE Technical Report
  
  Volume : 112 Pages : 33-36
- Data Source
  KAKENHI-PROJECT-24500007
[Journal Article] 全域木混雑度に対するメタヒューリスティックアルゴリズムの評価2011
- Author(s)
  丸田大樹, 大舘陽太, 山崎浩一
- Journal Title
  
  電子情報通信学会コンピュテーション研究会信学技報
  
  Volume : vol.110,no.464 Pages : 25-28
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] Outerplanar Obstructions for Matroid Pathwidth2011
- Author(s)
  A. Koutsonas, D. M. Thilikos, K. Yamazaki
- Journal Title
  
  Electronic Notes in Discrete Mathematics
  
  Volume : vol.38 Pages : 541-546
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] Approximability of the path-distance-width for AT-free graphs2011
- Author(s)
  Y. Otachi, T. Saitoh, K. Yamanaka, S. Kijima, Y. Okamoto, H. Ono, Y. Uno, K. Yamazaki
- Journal Title
  
  37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011)
  
  Volume : vol.6986 Pages : 271-282
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] Approximating the path-distance-width for k-cocomparability graphs2011
- Author(s)
  Y. Otachi, T. Saitoh, K. Yamanaka, S. Kijima, Y. Okamoto, H. Ono, Y. Uno, K. Yamazaki
- Journal Title
  
  数理解析研究所講究録
  
  Volume : no.1744 Pages : 60-66
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] カット幅の双対定理について2011
- Author(s)
  片平明, 桑原勇人, 長澤亮介, 大舘陽太, 山崎浩一
- Journal Title
  
  数理解析研究所講究録
  
  Volume : no.1744 Pages : 193-196
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] Approximating the path-distance-width for asteroidal triple-free graphs2010
- Author(s)
  Y. Otachi, K. Yamazaki
- Journal Title
  
  数理解析研究所講究録
  
  Volume : no.1691 Pages : 58-64
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] The carving-width of generalized hypercubes2010
- Author(s)
  K. Kozawa, Y. Otachi, K. Yamazaki
- Journal Title
  
  Discrete Mathematics
  
  Volume : vol.310 Pages : 2867-2876
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] A lower bound for tree-width of Cartesian product graphs2009
- Author(s)
  K. Kozawa, Y. Otachi, K. Yamazaki
- Journal Title
  
  6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Proc. of JH 2009
  
  Pages : 280-288
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] 木幅と最小フィルイン問題を求めるスキームの再考2009
- Author(s)
  古瀬雅信, 大舘陽太, 山崎浩一
- Journal Title
  
  電子情報通信学会コンピュテーション研究会信学技報
  
  Volume : vol.109,no.235 Pages : 17-24
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] k-bounded hole family に対する long induced path 問題を解くアルゴリズム2006
- Author(s)
  石関徹也, 大舘陽太, 山崎浩一
- Journal Title
  
  情報処理学会研究報告 Vol2006・No.30
  
  Pages : 27-32
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] d-claw free グラフの重み付き最大独立点集合問題に対する近似アルゴリズムの実験的評価2006
- Author(s)
  大舘陽太, 山崎浩一
- Journal Title
  
  電子情報通信学会技術報告 Vol105・No.679
  
  Pages : 25-30
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] マトロイド被覆問題に対する発見的手法2006
- Author(s)
  青木一正, 大舘陽太, 山崎浩一
- Journal Title
  
  情報処理学会研究報告 Vol2006・No.49
  
  Pages : 17-24
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] An approximation algorithm for matroid covering2005
- Author(s)
  S.Kawano, Y.Otachi, K.Yamazaki
- Journal Title
  
  Research Institute of Mathematical Science Kokyuroku, Theoretical Computer Science and its Applications Vol.1426
  
  Pages : 166-171
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] バンド幅縮小問題に対する遺伝的アルゴリズム2005
- Author(s)
  青木一正, 大舘陽太, 山崎浩一
- Journal Title
  
  電子情報通信学会技術研究報告 COMP2004-49-56
  
  Pages : 29-36
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] An approximation algorithm for matroid covering2005
- Author(s)
  川野晋一郎, 大舘陽太, 山崎浩一
- Journal Title
  
  数理解析研究所講究録計算機科学基礎理論とその応用 1426
  
  Pages : 166-171
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] マトロイド被覆問題に対する近似アルゴリズムについて2005
- Author(s)
  川野晋一郎, 大舘陽太, 山崎浩一
- Journal Title
  
  京都大学数理解析研究所講究録 1426
  
  Pages : 166-171
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] レベル構造に基づいたバンド幅縮小アルゴリズムが苦手とするグラフクラス2005
- Author(s)
  梅沢香織, 大舘陽太, 山崎浩一
- Journal Title
  
  情報処理学会研究報告 2005-AL-100
  
  Pages : 47-53
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] A lower bound for vertex isoperimetric number of the complete k-ary trees2005
- Author(s)
  梅沢香織, 大舘陽太, 山崎浩一
- Journal Title
  
  電子情報通信学会技術研究報告 COMP2004-73-86
  
  Pages : 57-60
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] Branchlength と Treelength
- Author(s)
  梅澤香織, 中澤直弘, 山崎浩一
- Journal Title
  
  京都大学数理解析研究所講究録 (掲載予定)(印刷中)
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] 完全2分木に対するpath distance widthの下界
- Author(s)
  受川和幸, 青木一正, 小澤恭平, 大舘陽太, 山崎浩一
- Journal Title
  
  京都大学数理解析研究所講究録 (掲載予定)(印刷中)
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] A lower bound for the vertex boundary-width of complete k-ary trees
- Author(s)
  Y.Otachi, K.Yamazaki
- Journal Title
  
  Discrete Mathematics (in press)(To appear)
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] A lower bound for path distance width of complete binary trees
- Author(s)
  K.Ukegawa, K.Aoki, K.Kozawa, Y.Otachi, K.Yamazaki
- Journal Title
  
  (To appear in Research Institute of Mathematical Science Kokyuroku)
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] Branchlength and treelength
- Author(s)
  K.Umezawa, N.Nakazawa, K.Yamazaki
- Journal Title
  
  (To appear in Research Institute of Mathematical Science Kokyuroku)
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] A lower bound for the vertex boundary-width of complete k-ary trees
- Author(s)
  Y.Otachi, K.Yamazaki
- Journal Title
  
  (To appear in Research Institute of Mathematical Science Kokyuroku)
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500008
[Presentation] イデアル, フィルタからのtangleの再考2016
- Author(s)
  山崎浩一
- Organizer
  LAシンポジウム
- Place of Presentation
  京都
- Year and Date
  2016-01-26
- Data Source
  KAKENHI-PROJECT-15K00007
[Presentation] 幅系グラフパラメータの近似について2015
- Author(s)
  山崎浩一
- Organizer
  電子情報通信学会　コンピュテーション研究会
- Place of Presentation
  東北大学
- Year and Date
  2015-04-23
- Data Source
  KAKENHI-PROJECT-24500007
[Presentation] 幅系グラフパラメータの近似について2015
- Author(s)
  山崎浩一
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  東北大学
- Year and Date
  2015-04-23
- Data Source
  KAKENHI-PROJECT-24500007
[Presentation] Tangleとイデアル2015
- Author(s)
  山崎浩一
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  立命館大学
- Year and Date
  2015-03-09
- Data Source
  KAKENHI-PROJECT-24500007
[Presentation] Tangleと極大イデアル2013
- Author(s)
  山崎浩一
- Organizer
  LAシンポジウム
- Place of Presentation
  京都：京都大学数理解析研究所
- Data Source
  KAKENHI-PROJECT-24500007
[Presentation] 単位円交差グラフの線形構造を持つ部分クラスについて2012
- Author(s)
  林貴史, 木野徹, 桑原勇人, 長澤亮介, 芝田悠華, 山崎浩一
- Organizer
  2011年度冬のLAシンポジウム
- Place of Presentation
  京都大学
- Year and Date
  2012-01-31
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] カット幅の双対定理について2011
- Author(s)
  片平明, 桑原勇人, 長澤亮介, 大舘陽太, 山崎浩一
- Organizer
  2010年度冬のLAシンポジウム
- Place of Presentation
  京都大学
- Year and Date
  2011-02-02
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] Approximability of the path-distance-width for AT-free graphs2011
- Author(s)
  Y. Otachi, T. Saitoh, K. Yamanaka, S. Kijima, Y. Okamoto, H. Ono, Y. Uno, K. Yamazaki
- Organizer
  37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011)
- Place of Presentation
  West Bohemia, Czech
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] Outerplanar Obstructions for Matroid Pathwidth2011
- Author(s)
  A. Koutsonas, D. M. Thilikos, K. Yamazaki
- Organizer
  European Conference on Combinatorics, Graph Theory and Applications, EuroComb'11
- Place of Presentation
  Budapest, Hungary
- Year and Date
  2011-09-11
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] 全域木混雑度に対するメタヒューリスティックアルゴリズムの評価2011
- Author(s)
  丸田大樹, 大舘陽太, 山崎浩一
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  中央大学
- Year and Date
  2011-03-09
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] Approximating the path-distance-width for k-cocomparability graphs2011
- Author(s)
  Y. Otachi, T. Saitoh, K. Yamanaka, S. Kijima, Y. Okamoto, H. Ono, Y. Uno, K. Yamazaki
- Organizer
  2010年度冬のLAシンポジウム
- Place of Presentation
  京都大学
- Year and Date
  2011-02-02
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] Approximating the path-distance-width for asteroidal triple-free graphs2010
- Author(s)
  Y. Otachi, K. Yamazaki
- Organizer
  2009年度冬のLAシンポジウム
- Place of Presentation
  京都大学
- Year and Date
  2010-02-02
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] Reformulation of the scheme for computing tree-width and minimum fill-in2009
- Author(s)
  Koichi Yamazaki
- Organizer
  7th Japan Conference on Computational Geometry and Graphs
- Place of Presentation
  Kanazawa Culture Hall
- Year and Date
  2009-11-12
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] 木幅と最小フィルイン問題を求めるスキームの再考2009
- Author(s)
  古瀬雅信, 大舘陽太, 山崎浩一
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  東北大学
- Year and Date
  2009-10-16
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] A lower bound for tree-width of Cartesian product graphs2009
- Author(s)
  K. Kozawa, Y. Otachi, K. Yamazaki
- Organizer
  6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
- Place of Presentation
  Budapest, Hungary
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] Reformulation of the scheme for computing tree-width and minimum fill-in2009
- Author(s)
  M. Furuse, Y. Otachi, K. Yamazaki
- Organizer
  Proc. of 7th Japan Conference on Computational Geometry and Graphs
- Place of Presentation
  Kanazawa, Japan
- Year and Date
  2009-11-13
- Data Source
  KAKENHI-PROJECT-21500004
[Presentation] Tangleとイデアルについて
- Author(s)
  山崎浩一
- Organizer
  LAシンポジウム
- Place of Presentation
  京都大学数理解析研究所
- Year and Date
  2015-01-28 – 2015-01-30
- Data Source
  KAKENHI-PROJECT-24500007

1. KASAI Takumi (70027382)

# of Collaborated Projects : 2results

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

# of Collaborated Projects : 2results

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

# of Collaborated Projects : 1results

# of Collaborated Products : 0results
4. KARUNO Yoshiyuki (80252542)

# of Collaborated Projects : 1results

# of Collaborated Products : 0results
5. UNO Yushi (60244670)

# of Collaborated Projects : 1results

# of Collaborated Products : 0results
6. ZHAO Liang (90344902)

# of Collaborated Projects : 1results

# of Collaborated Products : 0results
7. TANI Sei'ichi (70266708)

# of Collaborated Projects : 1results

# of Collaborated Products : 0results
8. NAKANO Shin-ichi (30227855)

# of Collaborated Projects : 1results

# of Collaborated Products : 0results
9. KAWAMURA Akitoshi

# of Collaborated Projects : 0results

# of Collaborated Products : 1results
10. 大舘陽太

# of Collaborated Projects : 0results

# of Collaborated Products : 2results

YAMAZAKI Koichi 山崎 浩一

Research Projects

Research Products

Co-Researchers

Tangleの代数的構造の研究Principal InvestigatorOngoing

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Inapproximability of graph width parametersPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

A study of graph width parametersPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Design of Approximation Algorithms for the Problems with Grapth Structure

Principal Investigator

Project Period (FY)

Research Category

Research Institution

Implementation and evaluation of graph approximation algorithmsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

VLSIレイアウト問題に対する近似アルゴリズムの応用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

Aesthetic Drawing Algorithms for Graphs

Principal Investigator

Project Period (FY)

Research Category

Research Institution

A Study of the complete Problems for Low-Level Complexity Classes

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Computer Computation to obtain Lower Bounds of Computational Complexity

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] Thin strip graphs2016

Author(s)

Journal Title

Data Source

[Journal Article] 幅系グラフパラメータの近似について2015

Author(s)

Journal Title

Data Source

[Journal Article] 幅系グラフパラメータの近似について2015

Author(s)

Journal Title

Data Source

[Journal Article] Tangleとイデアル2015

Author(s)

Journal Title

Data Source

[Journal Article] Tangleとイデアルについて2015

Author(s)

YAMAZAKI Koichi 山崎浩一