Tamaki Hisao 玉木久夫

… Alternative Names

TAMAKI Hisao 玉木久夫

玉木久夫

Less

Researcher Number	20111354
Affiliation (Current)	2025: 明治大学, 研究・知財戦略機構(生田), 研究推進員(客員研究員)
Affiliation (based on the past Project Information) *help	2022 – 2024: 明治大学, 研究・知財戦略機構(生田), 研究推進員(客員研究員) 2016 – 2021: 明治大学, 理工学部, 専任教授 2004 – 2015: 明治大学, 理工学部, 教授 1998 – 2001: 明治大学, 理工学部, 教授 1989: Assistant Professor, Department of Information Science, School of Engineering, I, 工学部・情報工学科, 講師 1987: 茨城大学, 工学部, 助手
Review Section/Research Field	Principal Investigator Basic Section 60010:Theory of informatics-related / Fundamental theory of informatics / Medium-sized Section 60:Information science, computer engineering, and related fields / 計算機科学 / Theory of informatics / Science and Engineering
Keywords	Principal Investigator 木幅 / 固定パラメータアルゴリズム / グラフ / 動的計画法 / 木分解 / exact algorithm / treewidth / パス幅 / マイナー / 下界 … More / 上界 / tree-decomposition / dynamic programming / 種数 / 分枝幅 / 多項式時間アルゴリズム / 木分割 / 局所探索 / 平面グラフ / 分枝分割 / グラフ分割 / 組み合わせ最適化 / 実問題への応用 / 実用的アルゴリズム / 最適化アルゴリズム / 発見的手法 / コントラクション / 再帰 / グラフ縮約 / graph contraction / pracitical algorithm / 固定パラメータ容易性 / 潜在極大クリーク / 列挙 / 極小セパレータ / 厳密アルゴリズム / upper bound / fixed parameter / ほぼクリークセパレータ / 安全なセパレータ / パス的木分解 / 潜在極小クリーク / グラフの縮約 / BT法 / 前処理 / 組み合わせ列挙 / lower bound / minor / preprocessing / enumeration / graph parameter / algorithm / space efficiency / polynomial time / minimal transversal / hypergraph / dualization / duality / monotone DNF / 学習理論 / 双対 / 単調論理関数 / DNF / 横断ハイパーグラフ / 単調双対性 / スペース効率 / 多項式時間 / 極小横断 / ハイパーグラフ / 双対化 / 双対性 / 単調DNF / Catalanian decompositoin / alternating cycles contribution / Lin-Kernighan heuristic / heuristics / approximation algorithms / traveling salesman problem / route optimization / 近似解 / ヒューリスティックス / 幾何的距離 / 多項式時間近似スキーム / 平面巡回セールスマン問題 / カタラン分割 / 交代閉路寄与法 / Lin-Kernighan法 / 発見的解法 / 近似アルゴリズム / 巡回セールスマン問題 / 経路最適化 / コミットメント / 探索 / 劣モジュラ性 / 頂点分離列 / 頂点分離数 / 整数計画法 / パス分解 / バス幅 / 正例駆動 / heuristic computation / exact computation / algorithm experiments / safe separator / positive-instance driven / trree-decomposition / パス分割 / グラフアルゴリズム / 表面埋め込み / 厳密指数時間アルゴリズム / 有向グラフ / グラフ理論 / 向き付け可能表面 / グラフマイナー / アルゴリズム / FPGA / ハードウェア化 / 局所探索法 / 近傍内最適化 / 大規模近傍 / グラフクラス / 刻み分割 / 巨大近傍 … More Except Principal Investigator Vector quantization / Hypercube architecute / Fuzzy reasoning / Computer architecture / Natural Language Processing / Programming Languages / Algorithms / Neuro-computing / Neuroーcomputing Less

Making treewidth and pathwidth practicalPrincipal Investigator
- Principal Investigator
  
  玉木久夫
- Project Period (FY)
  2024 – 2027
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Review Section
  
  Medium-sized Section 60:Information science, computer engineering, and related fields
- Research Institution
  Meiji University
Development of treewidth algorithms based on path-like tree-decompositionsPrincipal Investigator
- Principal Investigator
  
  玉木久夫
- Project Period (FY)
  2021 – 2024
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Meiji University
Combinatorial generation with fixed-parameter tractable preprocessingPrincipal Investigator
- Principal Investigator
  
  Tamaki Hisao
- Project Period (FY)
  2018 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Meiji University
Computing width parameters of graphs: theory of commitments and development of practical algorithmsPrincipal Investigator
- Principal Investigator
  
  Tamaki Hisao
- Project Period (FY)
  2014 – 2017
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  Meiji University
Algorithms for width-parameters of digraphs and their applicationsPrincipal Investigator
- Principal Investigator
  
  TAMAKI Hisao
- Project Period (FY)
  2011 – 2013
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Meiji University
Extending the branch-decomposition algorithm for planar graphs to broader class of graphsPrincipal Investigator
- Principal Investigator
  
  TAMAKI Hisao
- Project Period (FY)
  2008 – 2010
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Meiji University
組み合わせ最適化における指数サイズ・多項式時間近傍の設計Principal Investigator
- 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
  Meiji University
Approximation algoirithms for route optimization problems : exploiting geometric structures and application to large scale problemsPrincipal Investigator
- Principal Investigator
  
  TAMAKI Hisao
- Project Period (FY)
  1998 – 2000
- Research Category
  
  Grant-in-Aid for Scientific Research on Priority Areas (B)
- Research Institution
  Meiji University
Polynomial time algorithm for dualizing a monotone DNFPrincipal Investigator
- Principal Investigator
  
  TAMAKI Hisao
- Project Period (FY)
  1998 – 1999
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  Meiji University
General Studies on High Level Techniques in Computer Software and Hardware
- Principal Investigator
  
  TAKAOKA Tadao
- Project Period (FY)
  1987 – 1989
- Research Category
  
  Grant-in-Aid for Overseas Scientific Survey.
- Research Institution
  Ibaraki University

[Book] 乱択アルゴリズム2008
- Author(s)
  玉木久夫
- Total Pages
  228
- Publisher
  共立出版
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] A contraction-recursive algorithm for treewidth2023
- Author(s)
  Hisao Tamaki
- Journal Title
  
  18th International Symposium on Parameterized and Exact Computation
  
  Volume: 285
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K11761
[Journal Article] Heuristic computation of exact treewidth2022
- Author(s)
  Hisao Tamaki
- Journal Title
  
  CoRR
  
  Volume: abs/2202.07793
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11174
[Journal Article] Heuristic Computation of Exact Treewidth2022
- Author(s)
  Hisao Tamaki
- Journal Title
  
  20th International Symposium on Experimental Algorithms
  
  Volume: 1
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K11761
[Journal Article] Heuristic Computation of Exact Treewidth2022
- Author(s)
  Hisao Tamaki
- Journal Title
  
  20th International Symposium on Experimental Algorithms
  
  Volume: 1
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11174
[Journal Article] Heuristic computation of exact treewidth2022
- Author(s)
  Hisao Tamaki
- Journal Title
  
  CORR
  
  Volume: abs/2202.07793
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K11761
[Journal Article] A heuristic for listing almost-clique minimal separators of a graph2021
- Author(s)
  Hisao Tamaki
- Journal Title
  
  CORR
  
  Volume: abs/2108.07551
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K11761
[Journal Article] A heuristic for listing almost-clique minimal separators of a graph2021
- Author(s)
  Hisao Tamaki
- Journal Title
  
  CoRR
  
  Volume: abs/2108.07551
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11174
[Journal Article] Experimental Analysis of Treewidth2020
- Author(s)
  Hisao Tamaki
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 12160 Pages: 214-221
- DOI
  10.1007/978-3-030-42071-0_15
- ISBN
  9783030420703, 9783030420710
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11174
[Journal Article] Computing Treewidth via Exact and Heuristic Lists of Minimal Separators2019
- Author(s)
  HIsao Tamaki
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 11544 Pages: 219-236
- DOI
  10.1007/978-3-030-34029-2_15
- ISBN
  9783030340285, 9783030340292
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11174
[Journal Article] Positive-instance driven dynamic programming for treewidth2019
- Author(s)
  Hisao Tamaki
- Journal Title
  
  Journal of Combinatorial Optimization
  
  Volume: 37(4) Issue: 4 Pages: 1283-1311
- DOI
  10.1007/s10878-018-0353-z
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11174
[Journal Article] A heuristic use of dynamic programming to upperbound treewidth2019
- Author(s)
  Hisao Tamaki
- Journal Title
  
  CoRR
  
  Volume: abs/1909.07647
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11174
[Journal Article] Positive-Instance Driven Dynamic Programming for Treewidth2017
- Author(s)
  Hisao Tamaki
- Journal Title
  
  25th Annual European Symposium on Algorithms
  
  Volume: na
- DOI
  10.4230/LIPIcs.ESA.2017.68
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330021
[Journal Article] An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization2017
- Author(s)
  Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki
- Journal Title
  
  12th International Symposium on Parameterized and Exact Computation
  
  Volume: na
- DOI
  10.4230/LIPIcs.IPEC.2017.25
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330021
[Journal Article] Positive-instance driven dynamic programming for treewidth2017
- Author(s)
  Hisao Tamaki
- Journal Title
  
  CoRR
  
  Volume: abs/1704.05286
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330021
[Journal Article] A faster fixed parameter algorithm for two-layer crossing minimization2016
- Author(s)
  Yasuaki Kobayashi, Hisao Tamaki
- Journal Title
  
  Information Processing Letters
  
  Volume: 116(9) Issue: 9 Pages: 547-549
- DOI
  10.1016/j.ipl.2016.04.012
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330021
[Journal Article] Treedepth Parameterized by Vertex Cover Number2016
- Author(s)
  Yasuaki Kobayashi, Hisao Tamaki
- Journal Title
  
  11th International Symposium on Parameterized and Exact Computation,
  
  Volume: -
- DOI
  10.4230/LIPIcs.IPEC.2016.18
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330021
[Journal Article] Computing directed pathwidth in O(1.89^n) time2016
- Author(s)
  Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
- Journal Title
  
  Algorithmica
  
  Volume: 75(1) Issue: 1 Pages: 138-157
- DOI
  10.1007/s00453-015-0015-9
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26880018, KAKENHI-PROJECT-26330021
[Journal Article] A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization2015
- Author(s)
  Yasuaki Kobayashi, Hisao Tamaki
- Journal Title
  
  Algorithmica
  
  Volume: 72 Issue: 3 Pages: 778-790
- DOI
  10.1007/s00453-014-9872-x
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330021, KAKENHI-PROJECT-26880018
[Journal Article] On the Pathwidth of Almost Semicomplete Digraphs2015
- Author(s)
  Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
- Journal Title
  
  23rd Annual European Symposium on Algorithms (Lecture Notes in Computer Science)
  
  Volume: 9294 Pages: 816-827
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26330021
[Journal Article] Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study2014
- Author(s)
  Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki
- Journal Title
  
  Lecture Notes in Computer Science (SEA 2014)
  
  Volume: 8504 Pages: 388-399
- DOI
  10.1007/978-3-319-07959-2_33
- NAID
  110009925281
- ISBN
  9783319079585, 9783319079592
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26330021, KAKENHI-PROJECT-26880018
[Journal Article] Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study2014
- Author(s)
  Yasuaki Kobayashi, Keita Komuro, and Hisao Tamaki
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 未定
- NAID
  110009925281
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] A Linear Edge Kernel for Two-Layer Crossing Minimization2013
- Author(s)
  Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki
- Journal Title
  
  COCOON
  
  Pages: 458-468
- NAID
  110009768496
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] Route-Enabling Graph Orientation Problems2013
- Author(s)
  Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
- Journal Title
  
  Algorithmica
  
  Volume: 65(2) Pages: 317-338
- NAID
  120005850325
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] A Linear Edge Kernel for Two-Layer Crossing Minimization2013
- Author(s)
  Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, and Hisao Tamaki
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 7936 Pages: 458-468
- NAID
  110009768496
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size2012
- Author(s)
  Qian-Ping Gu, Hisao Tamaki
- Journal Title
  
  Algorithmica
  
  Volume: 64(3) Pages: 416-453
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] Improved bounds on the planar branchwidth with respect to the largest grid minor size2012
- Author(s)
  Qian-Ping Gu and Hisao Tamaki
- Journal Title
  
  Algorithmica
  
  Volume: online first Issue: 3 Pages: 1-38
- DOI
  10.1007/s00453-012-9627-5
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] Computing Directed Pathwidth in O(1.89^ n ) Time2012
- Author(s)
  Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
- Journal Title
  
  IPEC 2012
  
  Volume: LNCS7535 Pages: 182-193
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] Tracesheets - Spreadsheets of Program Executions as a Common Ground between Learners and Instructors2012
- Author(s)
  Soichiro Fujii, Hisao Tamaki:
- Journal Title
  
  CSEDU 2012
  
  Volume: 1 Pages: 158-163
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization2012
- Author(s)
  Yasuaki Kobayashi, Hisao Tamaki:
- Journal Title
  
  ESA 2012
  
  Volume: LNCS7501 Pages: 683-694
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization2012
- Author(s)
  Yasuaki Kobayashi, Hisao Tamaki
- Journal Title
  
  ESA
  
  Pages: 683-694
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n**{1+\epsilon}) time2011
- Author(s)
  Qian-Ping Gu and Hisao Tamaki
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 412 Issue: 32 Pages: 4100-4109
- DOI
  10.1016/j.tcs.2010.07.017
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] A Polynomial Time Algorithm for Bounded Directed Pathwidth2011
- Author(s)
  Hisao Tamaki
- Journal Title
  
  WG
  
  Pages: 331-342
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n^<1+ϵ>) time2011
- Author(s)
  Qian-Ping Gu, Hisao Tamaki
- Journal Title
  
  Theor. Comput. Sci
  
  Volume: 412(32) Pages: 4100-4109
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] Computing Directed Pathwidth in O(1.89 n ) Time2011
- Author(s)
  Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
- Journal Title
  
  IPEC 2012
  
  Pages: 182-193
- Data Source
  KAKENHI-PROJECT-23500026
[Journal Article] Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size2010
- Author(s)
  Qian-Ping Gu, Hisao Tamaki
- Journal Title
  
  Proc.21st International Symposium on Algorithms and Computation
  
  Pages: 85-96
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] k-Cyclic Orientations of Graphs2010
- Author(s)
  Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki
- Journal Title
  
  Proc.21st International Symposium on Algorithms and Computation
  
  Pages: 73-84
- NAID
  110008583081
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] A Directed Path-Decomposition Approach to Exactly Identifying Attractors of Boolean Networks2010
- Author(s)
  H.Tamaki
- Journal Title
  
  Proc.10th International Symposium on Communication and Information Technologies
  
  Volume: 10 Pages: 844-849
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] k-cyclic orientation of graphs2010
- Author(s)
  Y.Kobayashi, Y.Miyamoto, H.Tamaki
- Journal Title
  
  Proc.21st International Symposium on Algorithms and Computation
  
  Volume: 21 Pages: 73-84
- NAID
  110008583081
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size2010
- Author(s)
  Q.-P.Gu, H.Tamaki
- Journal Title
  
  Proc.21st International Symposium on Algorithms and Computation
  
  Volume: 21 Pages: 85-96
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n^<1+epsilon>) Time2010
- Author(s)
  Qian-Ping Gu, Hisao Tamaki
- Journal Title
  
  Theoretical Computer Science, available online (in press)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] A Directed Path-Decomposition Approach to Exactly Identifying Attractors of Boolean Networks2010
- Author(s)
  Hisao Tamaki
- Journal Title
  
  Proc.10^<th> International Symposium on Communication and Information Technologies
  
  Pages: 844-849
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] Improved bounds on the planar branch width with respect to the largest grid minor size2009
- Author(s)
  Q.-P.Gu, H.Tamaki
- Journal Title
  
  SFU Computing Science Technical Report 2009-17
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] Efficient reduction of vertex-disjoint Menger problem to edge-disjoint Menger problem in undirected planar graphs2009
- Author(s)
  Q.-P.Gu, H.Tamaki
- Journal Title
  
  SFU Computing Science Technical Report 2009-11
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n^<1+ε>)time2009
- Author(s)
  Q.-P.Gu, H.Tamaki
- Journal Title
  
  SFU Computing Science Technical Report 2009-18
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] A radius-based linear-time constructive upper bound on the branchwidth of planar hypergraphs2009
- Author(s)
  Q.-P.Gu, H.Tamaki
- Journal Title
  
  SFU Computing Science Technical Report 2009-21
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] Route-Enabling Graph Orientation Problems2009
- Author(s)
  Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
- Journal Title
  
  Proc.20th International Symposium on Algorithms and Computation
  
  Pages: 403-412
- NAID
  120005850325
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] Empirical study on branchwidth and branch decomposition of planar graphs2008
- Author(s)
  Z. Bian, Q. Gu, M. Marzban, H. Tamaki, Y. Yoshitake
- Journal Title
  
  Proc. ALENEXO8 1
  
  Pages: 152-165
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16092226
[Journal Article] Optimal branch-decomposition of planar graphs in O(n^3) Time2008
- Author(s)
  Qian-Ping Gu, Hisao Tamaki
- Journal Title
  
  ACM Transactions on Algorithms 4(3)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500022
[Journal Article] Optimal Branch-Decomposition of Planar Graphs in O(n^3) Time2005
- Author(s)
  Q.-P.Gu, H.Tamaki
- Journal Title
  
  Proc.32^<nd> International Conference on Automata, Languages, and Programming LNCS 3580
  
  Pages: 373-384
- Data Source
  KAKENHI-PROJECT-16092226
[Journal Article] On the probability of rendezvous in graphs2005
- Author(s)
  M.Dietzfelbinger, H.Tamaki
- Journal Title
  
  Random Structures and Algorithms 26(3)
  
  Pages: 266-288
- Data Source
  KAKENHI-PROJECT-16092226
[Journal Article] Matching Algorithms Are Fast in Sparse Random Graphs2004
- Author(s)
  Holger Bast, Kurt Mehlhorn, Guido Schafer, Hisao Tamaki
- Journal Title
  
  Proc.of the 21st Symposium on Theoretical Aspects of Computer Science (STACS04) LNCS2996
  
  Pages: 81-92
- Data Source
  KAKENHI-PROJECT-16092226
[Journal Article] On the probability of rendezvous in graphs2004
- Author(s)
  Marin Dietzfelbinger, Hisao Tamaki
- Journal Title
  
  Random Structures and Algorithms 26-3
  
  Pages: 266-288
- Data Source
  KAKENHI-PROJECT-16092226
[Journal Article] On Geometric Structure of Global Roundings for Graphs and Range Spaces2004
- Author(s)
  Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
- Journal Title
  
  Proc.of the 9th Scandinavian Workshop on Algorithm Theory (SWAT04) LNCS3111
  
  Pages: 455-467
- NAID
  120000861687
- Data Source
  KAKENHI-PROJECT-16092226
[Journal Article] Optimal branch-decomposition of planar graphs in $O(n^3)$time2004
- Author(s)
  Qiangping Gu, Hisao Tamaki
- Journal Title
  
  Simon Fraser University School of Computing Technical Report SFU-CMPT-TR2004-14
  
  Pages: 1-12
- Data Source
  KAKENHI-PROJECT-16092226
[Presentation] 木幅計算の実用アルゴリズム2023
- Author(s)
  玉木久夫
- Organizer
  情報処理学会アルゴリズム研究会
- Invited
- Data Source
  KAKENHI-PROJECT-21K11761
[Presentation] Computing treewidth via exact and heuristic lists of minimal separators2019
- Author(s)
  Hisao Tamaki
- Organizer
  Shonan Seminar 144: Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11174
[Presentation] Computing treewidth via exact and heuristic lists of minimal separators2019
- Author(s)
  Hisao Tamaki
- Organizer
  Special Event on Analysis of Experimental Algorithms
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11174
[Presentation] Listing minimal separators for treewidth computation2018
- Author(s)
  Hisao Tamaki
- Organizer
  NWO-JSPS joint seminar: "Computations on Networks with a Tree-Structure: From Theory to Practice
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11174
[Presentation] Finalizing tentative matches from truncated preference lists2017
- Author(s)
  Hisao Tamaki
- Organizer
  MATCH-UP 2017
- Place of Presentation
  Microsoft Research New England (Boston)
- Year and Date
  2017-04-20
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330021
[Presentation] 準完全有向グラフとその一般化に対するパス幅計算について2015
- Author(s)
  橘内謙太, 小林靖明, 玉木久夫
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  電気通信大学
- Year and Date
  2015-03-03
- Data Source
  KAKENHI-PROJECT-26330021
[Presentation] A Linear Edge Kernel for Two-Layer Crossing Minimization2013
- Author(s)
  Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki (Meiji Univ)
- Organizer
  第144回アルゴリズム研究発表会
- Place of Presentation
  情報処理学会
- Data Source
  KAKENHI-PROJECT-23500026
[Presentation] Computing directed pathwidth in O(1.89^n) time2012
- Author(s)
  橘内謙太, 小林靖, 小室慶, 玉木久夫, 田野登志博
- Organizer
  第141回アルゴリズム研究発表会
- Place of Presentation
  情報処理学会
- Data Source
  KAKENHI-PROJECT-23500026
[Presentation] A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization2012
- Author(s)
  小林靖明, 玉木久夫
- Organizer
  第141回アルゴリズム研究発表会
- Place of Presentation
  情報処理学会
- Data Source
  KAKENHI-PROJECT-23500026
[Presentation] A polynomial time algorithm for bounded directed pathwidth2011
- Author(s)
  Hisao Tamaki
- Organizer
  37th Intgernational workshop on graph-theoretic aspects of computer science
- Place of Presentation
  テプラ（チョコ）
- Data Source
  KAKENHI-PROJECT-23500026
[Presentation] Route-enabling graph orientation problems2009
- Author(s)
  T.Ito, Y.Miyamot, H.Ono, H.Tamaki, R.Uehara
- Organizer
  International Symposium on Algorithms and Computation
- Place of Presentation
  ホノルル
- Year and Date
  2009-12-18
- Data Source
  KAKENHI-PROJECT-20500022
[Presentation] Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n<1+ε>) time2009
- Author(s)
  Q.-P.Gu, H.Tamaki
- Organizer
  International Symposium on Algorithms and Computation
- Place of Presentation
  ホノルル
- Year and Date
  2009-12-17
- Data Source
  KAKENHI-PROJECT-20500022
[Presentation] 平面グラフの分枝分割アルゴリズムのより広いクラスへの拡張に向けて2008
- Author(s)
  玉木久夫、吉武由実
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  広島
- Year and Date
  2008-03-08
- Data Source
  KAKENHI-PROJECT-16092226
[Presentation] テストパターンの静的圧縮における厳密解と貪欲解の比較2008
- Author(s)
  八木沢圭、山崎浩二、細川利典、玉木久夫
- Organizer
  電子情報通信学会ディペンダブルコンピューティング研究会
- Place of Presentation
  東京
- Year and Date
  2008-02-08
- Data Source
  KAKENHI-PROJECT-16092226
[Presentation] グラフ彩色問題に対する列生成アプローチの高速化2008
- Author(s)
  玉木久夫、平川宗則
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  広島
- Year and Date
  2008-03-08
- Data Source
  KAKENHI-PROJECT-16092226
[Presentation] パス幅計算におけるコミットメントによる探索状態数削減：実験的研究
- Author(s)
  小林靖明，○小室慶太，玉木久夫
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  愛媛県松山市
- Year and Date
  2014-06-13 – 2014-06-14
- Data Source
  KAKENHI-PROJECT-26330021
[Presentation] Improved fixed parameter algorithm for two-layer crossing minimization
- Author(s)
  小林靖明玉木久夫
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  名古屋工業大学
- Year and Date
  2015-01-13 – 2015-01-14
- Data Source
  KAKENHI-PROJECT-26330021

1. TAKAOKA Tadao (00007824)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
2. HAYASHI Yoichi (20189666)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
3. MATSUYAMA Yasuo (60125804)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
4. 井口幸洋 (60201307)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
5. 齋藤寿樹 (00590390)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
6. 大舘陽太 (80610196)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
7. 川原純 (20572473)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
8. 吉仲亮 (80466424)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
9. 小林靖明 (60735083)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
10. PRADIP Dey

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
11. KEVIN D. Rei

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
12. DEY Pradip

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
13. REILLY Kevin D.

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
14. BARRETT R.Br

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
15. JOSEPH Fonta

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
16. KEVIN D.Reil

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
17. WARREN T.Jon

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
18. 滑川英世

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results

Tamaki Hisao 玉木 久夫

TAMAKI Hisao 玉木 久夫

玉木 久夫

Research Projects

Research Products

Co-Researchers

Making treewidth and pathwidth practicalPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Development of treewidth algorithms based on path-like tree-decompositionsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Combinatorial generation with fixed-parameter tractable preprocessingPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Computing width parameters of graphs: theory of commitments and development of practical algorithmsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Algorithms for width-parameters of digraphs and their applicationsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Extending the branch-decomposition algorithm for planar graphs to broader class of graphsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

組み合わせ最適化における指数サイズ・多項式時間近傍の設計Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Approximation algoirithms for route optimization problems : exploiting geometric structures and application to large scale problemsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Institution

Polynomial time algorithm for dualizing a monotone DNFPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

General Studies on High Level Techniques in Computer Software and Hardware

Principal Investigator

Project Period (FY)

Research Category

Research Institution

[Book] 乱択アルゴリズム2008

Author(s)

Total Pages

Publisher

Data Source

[Journal Article] A contraction-recursive algorithm for treewidth2023

Author(s)

Journal Title

Data Source

[Journal Article] Heuristic computation of exact treewidth2022

Author(s)

Journal Title

Data Source

[Journal Article] Heuristic Computation of Exact Treewidth2022

Author(s)

Journal Title

Tamaki Hisao 玉木久夫

TAMAKI Hisao 玉木久夫

玉木久夫