Yamazaki Koichi 山崎浩一

… Alternative Names

YAMAZAKI Koichi 山崎浩一

Less

Researcher Number	00246662
Other IDs
Affiliation (Current)	2025: 東京電機大学, 理工学部, 教授
Affiliation (based on the past Project Information) *help	2021 – 2022: 東京電機大学, 理工学部, 教授 2019 – 2020: 群馬大学, 大学院理工学府, 教授 2014 – 2017: 群馬大学, 大学院理工学府, 教授 2013: 群馬大学, 理工学研究院, 教授 2012: 群馬大学, 工学(系)研究科(研究院), 教授 … More 2010 – 2011: 群馬大学, 大学院・工学研究科, 教授 2009: Gunma University, 大学院・工学研究科, 准教授 2007 – 2008: 群馬大学, 工学研究科, 准教授 2004 – 2006: 群馬大学, 工学部, 助教授 2001 – 2002: 群馬大学, 工学部, 助教授 1999 – 2001: 群馬大学, 工学部, 講師 1998: 群馬大学, 工学部・情報工学科, 講師 1997: Gunma University, Faculty of Engineering, Lecturer, 工学部, 講師 1995 – 1997: 電気通信大学, 電気通信学部, 助手 Less
Review Section/Research Field	Principal Investigator Fundamental theory of informatics / 計算機科学 / Basic Section 60010:Theory of informatics-related / Theory of informatics Except Principal Investigator 計算機科学 / Science and Engineering
Keywords	Principal Investigator vertex boundary-width / 近似アルゴリズム / path distance-width / volume respecting embeddings / 極小セパレータ / グラフパラメータ / パス距離幅 / グラフセパレータ / 被覆関係 / 完備束 … More / 極小a,bセパレータ / 誘導マッチング数 / ガロア接続 / 2部グラフ / 頂点被覆集合 / 形式概念束 / 束 / セパレータ / グラフ / フィルター / イデアル / 自由超フィルタ / 劣モジュラ関数 / 枝幅 / 極大イデアル / 自由フィルタ / 超フィルタ / branch-width / ultrafilter / maximal ideal / tangle / independent set problem / d-claw free graphs / bandwidth minimization problem / matroid covering problem / approximation algorithms / Volume Respecting Embedding 法 / 重み付き最大独立点集合問題 / Path-distance-width / Branch-length / Tree-length / 重み付最大独立点集合問題 / d-claw freeグラフ / バンド幅縮小化問題 / マトロイド被覆問題 / unit disk graph / minimal separator / Tangle / Path-Distance-Width / 定数近似困難性 / carving-width / SSE予想 / boolean-width / clique-width / rank-width / Small Set Expansion 予想 / 近似困難性 / tree-width / パス幅 / 木幅 / hyper-ring / thickness / グラフの厚さ / Cuthill-Mckee法 / volume Respecting Embadding / バンド幅問題 / ページナンバー / 独立点集合 / intersection praph / pagenumber / pathwidth … More Except Principal Investigator Merging Network / 計算量 / グラフ描画 / 近似アルゴリズム / 最適化 / グラフアルゴリズム / Visualization / Information Visualization / Optimization / Algorithm / Graphs / マップラベリング / 描画 / 平面グラフ / 可視化 / 情報の可視化 / アルゴリズム / グラフ / Computers / Computation / Lower Bound / Complxity / マージングネットワーク / マージングネットワーク / コンピュータによる計算 / 下界 / Graph Isomorphism / Graph Algoritms / Language Processing / Formal Language / Approximation Algoritms / Complete Problems / Complexity / 機械翻訳 / 構文解析 / マージング・ネットワーク / グラフ同型問題 / 自然言語処理 / 形式言語理論 / 完全問題 / 機械スケジューリング / グラフ分割 / 最小カット / ミニマックス問題 / 分枝限定法 / グラフのランキング / パッキング問題 / 部分木被覆 / スケジューリング / 最長路問題 / ファイアウォール高速化 / 図形パッキング / グラフ連結度 / 離散最適化 / パッキング / 配送スケジューリング / ネットワーク設計 / 連結度 Less

Study on the Algebraic Structure of Graph SeparatorsPrincipal Investigator
- Principal Investigator
  
  Yamazaki Koichi
- Project Period (FY)
  2019 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Tokyo Denki University
  Gunma University
Study on algebraic structure of tanglePrincipal Investigator
- Principal Investigator
  
  Yamazaki Koichi
- 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
- Review Section
  
  Science and Engineering
- 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

[Journal Article] 線形枝幅と単項イデアル2017
- Author(s)
  藤田顕光、山崎浩一
- Journal Title
  
  電子情報通信学会技報
  
  Volume: 117 Pages: 21-27
- Data Source
  KAKENHI-PROJECT-15K00007
[Journal Article] Tangle and Maximal Ideal2017
- Author(s)
  Koichi Yamazaki
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 10167 Pages: 81-92
- DOI
  10.1007/978-3-319-53925-6_7
- ISBN
  9783319539249, 9783319539256
- Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00007
[Journal Article] Tangleと閉包について2016
- Author(s)
  山崎浩一
- Journal Title
  
  電子情報通信学会技術研究報告
  
  Volume: 116 Pages: 25-28
- Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-15K00007
[Journal Article] Thin strip graphs2015
- Author(s)
  T. Hayashi, A. Kawamura, Y. Otachi, H. Shinohara, and K. Yamazaki
- Journal Title
  
  Discrete Applied Mathematics, to appear
  
  Volume: - Pages: 203-210
- DOI
  10.1016/j.dam.2015.01.018
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-23240001, KAKENHI-PROJECT-24500007, KAKENHI-PROJECT-25730003, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106002
[Journal Article] Tangleとイデアルについて2015
- Author(s)
  山崎浩一
- Journal Title
  
  数理解析研究所講究録
  
  Volume: 1849 Pages: 37-40
- Data Source
  KAKENHI-PROJECT-15K00007
[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
  
  数理解析研究所講究録
  
  Volume: 1849 Pages: 37-40
- 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] 幅系グラフパラメータの近似について2015
- Author(s)
  山崎浩一
- Journal Title
  
  電子情報通信学会技術研究報告
  
  Volume: 115-15 Pages: 9-13
- Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-24500007
[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
- DOI
  10.1016/j.tcs.2014.03.013
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24500007
[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
- DOI
  10.1016/j.dam.2013.08.005
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24500007, KAKENHI-PROJECT-25730003
[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: no.1744 Pages: 193-196
- 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] 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: vol.110,no.464 Pages: 25-28
- NAID
  110008689180
- 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 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
- NAID
  110007123953
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500004
[Journal Article] 木幅と最小フィルイン問題を求めるスキームの再考2009
- Author(s)
  古瀬雅信, 大舘陽太, 山崎浩一
- Journal Title
  
  電子情報通信学会コンピュテーション研究会信学技報
  
  Volume: vol.109,no.235 Pages: 17-24
- NAID
  110007483103
- 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
- NAID
  110004824068
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] バンド幅縮小問題に対する遺伝的アルゴリズム2005
- Author(s)
  青木一正, 大舘陽太, 山崎浩一
- Journal Title
  
  電子情報通信学会技術研究報告 COMP2004-49-56
  
  Pages: 29-36
- NAID
  110004075935
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] レベル構造に基づいたバンド幅縮小アルゴリズムが苦手とするグラフクラス2005
- Author(s)
  梅沢香織, 大舘陽太, 山崎浩一
- Journal Title
  
  情報処理学会研究報告 2005-AL-100
  
  Pages: 47-53
- NAID
  110002812569
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] An approximation algorithm for matroid covering2005
- Author(s)
  川野晋一郎, 大舘陽太, 山崎浩一
- Journal Title
  
  数理解析研究所講究録計算機科学基礎理論とその応用 1426
  
  Pages: 166-171
- NAID
  110003178703
- 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
- NAID
  110003206433
- 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
- NAID
  110003178703
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500008
[Journal Article] マトロイド被覆問題に対する近似アルゴリズムについて2005
- Author(s)
  川野晋一郎, 大舘陽太, 山崎浩一
- Journal Title
  
  京都大学数理解析研究所講究録 1426
  
  Pages: 166-171
- 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 と Treelength
- 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
  
  (To appear in Research Institute of Mathematical Science Kokyuroku)
- 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] 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
[Presentation] 互いに支配する極小a,b-セパレータの分布について2023
- Author(s)
  野村幸平、山崎浩一
- Organizer
  2022年度冬のLAシンポジウム RIMS共同研究(公開型) 「計算機科学の基礎理論とその新潮流」
- Data Source
  KAKENHI-PROJECT-19K11818
[Presentation] 極小abセパレータを多く含むグラフの構造的特徴2021
- Author(s)
  山崎浩一
- Organizer
  2020年度　冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-19K11818
[Presentation] 被覆関係にある極小セパレータについて2019
- Author(s)
  山崎浩一
- Organizer
  LAシンポジウム
- Data Source
  KAKENHI-PROJECT-19K11818
[Presentation] Linear-width and Single ideal: Algebraic structure of the single ideals2019
- Author(s)
  藤田顕光，山崎浩一
- Organizer
  離散数学とその応用研究集会 2019
- Data Source
  KAKENHI-PROJECT-19K11818
[Presentation] Tangleと超フィルタの関係に関する考察2018
- Author(s)
  藤田顕光、山崎浩一
- Organizer
  2017年度 LAシンポジウム
- Data Source
  KAKENHI-PROJECT-15K00007
[Presentation] Linear-width and singly ideal2017
- Author(s)
  Takaaki Fujita and Koichi Yamazaki
- Organizer
  the Japan Conference on Discrete and Computational Geometry, Graphs, and Games
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00007
[Presentation] 線形枝幅と単項イデアル2017
- Author(s)
  藤田顕光、山崎浩一
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-15K00007
[Presentation] Tangle and Ultrafilter: Game Theoretical Interpretation2017
- Author(s)
  Takaaki Fujita and Koichi Yamazaki
- Organizer
  the Japan Conference on Discrete and Computational Geometry, Graphs, and Games
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00007
[Presentation] Tangleと超フィルタについて2017
- Author(s)
  藤田顕光, 山崎浩一
- Organizer
  2016年度 LAシンポジウム(冬)
- Place of Presentation
  京都府京都市
- Year and Date
  2017-02-01
- Data Source
  KAKENHI-PROJECT-15K00007
[Presentation] Tangle and Maximal Ideal2017
- Author(s)
  Koichi Yamazaki
- Organizer
  International Workshop on Algorithms and Computation
- Place of Presentation
  Hsinchu, Taiwan
- Year and Date
  2017-03-29
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00007
[Presentation] イデアル, フィルタからのtangleの再考2016
- Author(s)
  山崎浩一
- Organizer
  LAシンポジウム
- Place of Presentation
  京都
- Year and Date
  2016-01-26
- Data Source
  KAKENHI-PROJECT-15K00007
[Presentation] Tangleと閉包について2016
- Author(s)
  山崎浩一
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  富山県射水市
- 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] Tangleとイデアル2015
- Author(s)
  山崎浩一
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  立命館大学
- Year and Date
  2015-03-09
- 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と極大イデアル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] 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] 全域木混雑度に対するメタヒューリスティックアルゴリズムの評価2011
- Author(s)
  丸田大樹, 大舘陽太, 山崎浩一
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  中央大学
- Year and Date
  2011-03-09
- 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] 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)
  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] 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] 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] 木幅と最小フィルイン問題を求めるスキームの再考2009
- Author(s)
  古瀬雅信, 大舘陽太, 山崎浩一
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  東北大学
- Year and Date
  2009-10-16
- 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: 2 results

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

# of Collaborated Projects: 2 results

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

# of Collaborated Projects: 1 results

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

# of Collaborated Projects: 1 results

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

# of Collaborated Projects: 1 results

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

# of Collaborated Projects: 1 results

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

# of Collaborated Projects: 1 results

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

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
9. KAWAMURA Akitoshi

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results

Yamazaki Koichi 山崎 浩一

YAMAZAKI Koichi 山崎 浩一

Research Projects

Research Products

Co-Researchers

Study on the Algebraic Structure of Graph SeparatorsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Study on algebraic structure of tanglePrincipal Investigator

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

Review Section

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] 線形枝幅と単項イデアル2017

Author(s)

Journal Title

Data Source

[Journal Article] Tangle and Maximal Ideal2017

Author(s)

Journal Title

DOI

ISBN

Data Source

Yamazaki Koichi 山崎浩一

YAMAZAKI Koichi 山崎浩一