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

Nagamochi Hiroshi  永持 仁

ORCIDConnect your ORCID iD *help
… Alternative Names

NAGAMOCHI Hiroshi  永持 仁

Less
Researcher Number 70202231
Other IDs
External Links
Affiliation (Current) 2022: 京都大学, 情報学研究科, 教授
Affiliation (based on the past Project Information) *help 2004 – 2022: Kyoto University, Department of Applied Mathematics and Physics, Professor, 情報学研究科, 教授
2012: 京都大学, 大学院・情報学研究科, 教授
2009 – 2010: 京都大学, 大学院・情報学研究科, 教授
2000 – 2003: 豊橋技術科学大学, 工学部, 教授
1998 – 1999: Kyoto Univ.Graduate School of Informatics, Assoc.Prof., 情報学研究科, 助教授 … More
1998: 京都大学, 情報学研究科, 教授
1997: 京都大学, 大学院・工学研究科, 助教授
1995 – 1997: Kyoto Univ.Graduate School of Engineering, Assoc.Prof., 工学研究科, 助教授
1995: 京都大学, 大学院・工学研究科, 助教授
1993 – 1994: 京都大学, 工学部, 助教授
1990 – 1992: 京都大学, 工学部, 助手 Less
Review Section/Research Field
Principal Investigator
計算機科学 / Fundamental theory of informatics / Theory of informatics / Science and Engineering / Basic Section 60020:Mathematical informatics-related
Except Principal Investigator
Fundamental theory of informatics / Informatics / System engineering / Medium-sized Section 61:Human informatics and related fields / Bioinformatics/Life informatics / Intelligent informatics / Intelligent informatics / Intelligent informatics
Keywords
Principal Investigator
アルゴリズム / 離散最適化 / 連結度 / 最適化 / グラフ理論 / 近似アルゴリズム / グラフ分割 / 最小カット / グラフ描画 / minimum cut … More / connectivity / ネットワーク / グラフ・ネットワーク / スケジューリング / ネットワーク設計 / グラフ連結度 / 計算量 / polynomial algorithm / graph / グラフ / 劣モジュラ関数 / ゲーム理論 / グラフアルゴリズム / パッキング / 機械学習 / 近似解法 / データ構造 / 数理工学 / 情報工学 / 高速コンピューティング / 数理計画 / ネットワーク問題 / approximation algorithm / network flow / network reliability / 多項式時間 / カット / フロー / パス / algorithm / edge splitting / angmenting problem / polynemial time / network / 最大フロー / 配送スケジューリング / 図形パッキング / ファイアウォール高速化 / 最長路問題 / 部分木被覆 / パッキング問題 / グラフのランキング / 分枝限定法 / ミニマックス問題 / 機械スケジューリング / 可視化 / 詰め込み問題 / グラフ描 / 準ニュートン法 / 配置問題 / ルーティング問題 / 計算幾何学 / 組合せ最適 / 図形配置 / 非線形最適化 / 情報可視化 / 計算機科学 / 厳密解法 / 計算量解析 / 列挙法 / ネットワーク構造 / 組合せ最適化 / 組合せ最適化ゲーム / 連結度増大 / 最小カット問題 / 協力ゲーム / 劣モジュール関数 / graph algorithm / combinatorial optimization / combinatorial optimization game / graph partition / connectivity augmentation / 多項式アルゴリズム / 最大流問題 / 点連結度 / 枝連結度 / 最大隣接順序 / スケジューリング問題 / 矩形分割問題 / 供給点配置問題 / 連結度増大問題 / 耐故障性 / ネットワークトポロジー / スケジューリングアルゴリズム / 最適化アルゴリズム / NP-困難性 / graph connectivity / network problem / maximum flow problem / vertex connectivity / edge connectivity / maximum adjacency order / 応用数学 / 情報基礎 / 連結特性 / グラフの直径 / グラフ増大問題 / Algorithm / Applied Mathematics / Mathematical Engineering / Fundamentals of Informatics / Graph Theory / Network / Approximation Algorithm / Connectivity / データマイニング / NP-困難 / 人工ニューラルネットワーク / 経路探索 / 整数計画法 / 動的計画法 … More
Except Principal Investigator
特徴ベクトル / グラフ理論 / アルゴリズム / 最適化 / カーネル法 / グラフアルゴリズム / ケモインフォマティクス / 化学構造 / グラフ・ネットワーク / 立体異性体 / 木構造 / 外平面的グラフ / 機械学習 / 人工知能 / 構造列挙 / 分散システム / 分散アルゴリズム / optimization / 組合せ最適化 / メタ・ヒューリスティックス / combinatorial optimization / metaheuristics / ブール関数 / ニューラルネットワーク / バイオインフォマティクス / サポートベクターマシン / 列挙アルゴリズム / 動的計画法 / RNA二次構造 / タンパク質立体構造 / 構造活性相関 / 光学異性体 / 外平面グラフ / 情報可視化 / 異性体 / ベンゼン環 / 構造比較 / 計算論的学習理論 / 半順序集合 / 生物情報ネットワーク / ヶモインフォマティクス / グラフ列挙 / 非線形システム / 演繹データベース / 確率システム / オンラインアルゴリズム / ネットワークの分割 / スケジューリング / ネットワ-ク / 計算の複雑さ / 情報学的諸問題 / VLSI最適設計 / 演繹デ-タベ-ス / スケジュ-リング理論 / Optimization / Algorithm / Distributed Systems / Graphs. Networks / Nonlinear Systems / Deductive Databases / Probabilistic Systems / 数理計画 / 並列アルゴリズム / 分解法 / Mathematical Programming / parallel algorithm / 分散データベース / コテリー / 最小カット / 並行処理アルゴリズム / 非線形最適化 / 分散デ-タベ-ス / 排他制御 / コテリ- / グラフの連結性 / ブ-ル代数 / Distributed databases / Distributed algorithms / Coteries / Graphs and networks / Minimum cut / Concurrency control / Nonlinear optimization / グラフ / ネットワーク / 遺伝アルゴリズム / メタ・ヒューリスティック / 近似アルゴリズム / graphs / networks / genetic algorithms / 論理的解析 / コテリ / プール関数 / distributed systems / logical analysis / Boolean function / coterie / 問題解決エンジン / メタヒューリスティクス / CSP(制約充足問題) / 組合せアルゴリズム / タブ-探索 / 制約充足問題 / 一般化割当問題 / 問題解決 / 組合セアルゴリズム / problem solving engine / CSP (constraint satisfaction problem) / データの論理的解析 / 知識獲得 / データマイニング / 知識発見 / Logical Analysis of Data / Knowledge Aquisition / Data Mining / Knowldge Discovery / Booleam functions / 逆問題 / 離散原像問題 / 整数計画法 Less
  • Research Projects

    (27 results)
  • Research Products

    (339 results)
  • Co-Researchers

    (47 People)
  •  Advanced Studies and Developments on Discrete Preimage Problems

    • Principal Investigator
      阿久津 達也
    • Project Period (FY)
      2022 – 2026
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 61:Human informatics and related fields
    • Research Institution
      Kyoto University
  •  グラフ構造に対する実用的な最適化・列挙アルゴリズムの理論設計と実装開発Principal Investigator

    • Principal Investigator
      永持 仁
    • Project Period (FY)
      2020 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60020:Mathematical informatics-related
    • Research Institution
      Kyoto University
  •  Analysis and Applications of Discrete Preimage Problems

    • Principal Investigator
      阿久津 達也
    • Project Period (FY)
      2018 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 61:Human informatics and related fields
    • Research Institution
      Kyoto University
  •  Design of Algorithms for Discrete Optimization Based on Graph-Theoretical MethodsPrincipal Investigator

    • Principal Investigator
      NAGAMOCHI Hiroshi
    • Project Period (FY)
      2017 – 2019
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyoto University
  •  An Approach to Novel Structure Design by Combining Discrete Methods and Statistical Methods

    • Principal Investigator
      AKUTSU Tatsuya
    • Project Period (FY)
      2014 – 2018
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Intelligent informatics
    • Research Institution
      Kyoto University
  •  Design Theory and Implementation of Fast Algorithms to Graph OptimizationPrincipal Investigator

    • Principal Investigator
      Hiroshi Nagamochi
    • Project Period (FY)
      2014 – 2016
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyoto University
  •  Algorithm design techniques based on transformation into network structurePrincipal Investigator

    • Principal Investigator
      NAGAMOCHI Hiroshi
    • Project Period (FY)
      2011 – 2013
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  An Approach to Novel Structural Design by Combining Discrete Methods and Kernel Methods

    • Principal Investigator
      AKUTSU Tatsuya
    • Project Period (FY)
      2010 – 2014
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Intelligent informatics
    • Research Institution
      Kyoto University
  •  A Novel Learning Method That Highlights the Order Relation between Data Examples

    • Principal Investigator
      HARAGUCHI Kazuya
    • Project Period (FY)
      2010 – 2012
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Ishinomaki Senshu University
  •  Construction of Plat-form Models for the Problemof Packing Geometrical ObjectsPrincipal Investigator

    • Principal Investigator
      NAGAMOCHI Hiroshi
    • Project Period (FY)
      2008 – 2010
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  A Novel Learning Method Based on Combinatorial Feature of Data

    • Principal Investigator
      HARAGUCHI Kazuya
    • Project Period (FY)
      2008 – 2009
    • Research Category
      Grant-in-Aid for Young Scientists (Start-up)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Ishinomaki Senshu University
  •  New Methods for Designing Chemical Structures Using Graph Theory and Kernel Methods

    • Principal Investigator
      AKUTSU Tatsuya
    • Project Period (FY)
      2007 – 2009
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Bioinformatics/Life informatics
    • Research Institution
      Kyoto University
  •  Analysis of properties on the connectivity of graphs and networks and its applications to design of algorithmsPrincipal Investigator

    • Principal Investigator
      NAGAMOCHI Hiroshi
    • Project Period (FY)
      2005 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  Design of Approximation Algorithms for the Problems with Grapth StructurePrincipal Investigator

    • 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
  •  Construction of Approximation Algorithms Based on Graph Theory and Its Application to Network ProblemsPrincipal Investigator

    • 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
  •  Development of algorithms for solving graph/network problemsPrincipal Investigator

    • 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
  •  組合せ構造を持つ問題を解くアルゴリズムの研究Principal Investigator

    • Principal Investigator
      永持 仁
    • Project Period (FY)
      1997 – 1998
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      計算機科学
    • Research Institution
      Kyoto University
  •  Logical Analysis of Data and Knowledge Acquisition

    • Principal Investigator
      IBARAKI Toshihide
    • Project Period (FY)
      1997 – 1998
    • Research Category
      Grant-in-Aid for international Scientific Research
    • Research Field
      Intelligent informatics
    • Research Institution
      KYOTO UNIVESITY
  •  組合せ構造を持つ問題に対するアルゴリズムの開発Principal Investigator

    • Principal Investigator
      永持 仁
    • Project Period (FY)
      1996
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      計算機科学
    • Research Institution
      Kyoto University
  •  Studies on combinatorial algorithms as problem solving engine

    • Principal Investigator
      IBARAKI Toshihide
    • Project Period (FY)
      1996 – 1998
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      System engineering
    • Research Institution
      KYOTO UNIVERSITY
  •  離散構造を有する問題を解くアルゴリズムの研究Principal Investigator

    • Principal Investigator
      永持 仁
    • Project Period (FY)
      1995
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      計算機科学
    • Research Institution
      Kyoto University
  •  ネットワーク構造を有する問題に対するアルゴリズムの開発Principal Investigator

    • Principal Investigator
      永持 仁
    • Project Period (FY)
      1994
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      計算機科学
    • Research Institution
      Kyoto University
  •  Logical analysis and optimization of distributed systems

    • Principal Investigator
      IBARAKI Toshihide
    • Project Period (FY)
      1994 – 1996
    • Research Category
      Grant-in-Aid for international Scientific Research
    • Research Institution
      KYOTO UNIVERSITY
  •  Study on largescale combinatorial optimization problems by graph-network

    • Principal Investigator
      IBARAKI Toshihide
    • Project Period (FY)
      1993 – 1995
    • Research Category
      Grant-in-Aid for General Scientific Research (B)
    • Research Field
      System engineering
    • Research Institution
      KYOTO UNIVERSITY
  •  Distributed algorithms for database management, control and recovery

    • Principal Investigator
      IBARAKI Toshihide
    • Project Period (FY)
      1991 – 1992
    • Research Category
      Grant-in-Aid for international Scientific Research
    • Research Institution
      Kyoto University
  •  Applications of Optimization Techniques to Problems in Information Science

    • Principal Investigator
      IBARAKI Toshihide
    • Project Period (FY)
      1990 – 1992
    • Research Category
      Grant-in-Aid for General Scientific Research (B)
    • Research Field
      Informatics
    • Research Institution
      KYOTO UNIVERSITY
  •  Studies on parallel algorithms for mathematical programming

    • Principal Investigator
      FUKUSHIMA Masao
    • Project Period (FY)
      1990 – 1991
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      Informatics
    • Research Institution
      Kyoto University

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

All Journal Article Presentation Book

  • [Book] グラフ理論連結構造とその応用2010

    • Author(s)
      茨木, 石井, 永持
    • Total Pages
      324
    • Publisher
      朝倉書店
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Book] Algorithmic Aspects of Graph Connectivities (Encyclopedia of Mathematics and Its Applications)2008

    • Author(s)
      Hiroshi Nagamochi
    • Total Pages
      375
    • Publisher
      Cambridge University Press
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Book] Algorithmic Aspects of Graph Connectivities (Encyclopedia of Mathematics and Its Applications)2008

    • Author(s)
      Hiroshi Nagamochi, Toshihide Ibaraki
    • Total Pages
      392
    • Publisher
      Cambridge University Press
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Book] Algorithmic Aspects of Graph Connectivities (Encyclopedia of Mathematics and Its Applications)2008

    • Author(s)
      Hiroshi Nagamochi, Toshihide Ibaraki
    • Total Pages
      392
    • Publisher
      Cambridge University Press
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] An inverse QSAR method based on a two-layered model and integer programming2021

    • Author(s)
      Shi Yu、Zhu Jianshen、Azam Naveed Ahmed、Haraguchi Kazuya、Zhao Liang、Nagamochi Hiroshi、Akutsu Tatsuya
    • Journal Title

      International Journal of Molecular Sciences

      Volume: 22 Pages: 2847-2847

    • DOI

      10.3390/ijms22062847

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K04978, KAKENHI-PROJECT-20K11691, KAKENHI-PROJECT-18J23484
  • [Journal Article] An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops2020

    • Author(s)
      Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
    • Journal Title

      Entropy

      Volume: 22 Pages: 923-923

    • DOI

      10.3390/e22090923

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11691, KAKENHI-PROJECT-18J23484
  • [Journal Article] Some reduction operations to pairwise compatibility graphs2020

    • Author(s)
      Xiao, M., Nagamochi, H.
    • Journal Title

      Information Processing Letters

      Volume: 153

    • DOI

      10.1016/j.ipl.2019.105875

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Journal Article] Characterizing star-PCGs2020

    • Author(s)
      Mingyu Xiao, Hiroshi Nagamochi
    • Journal Title

      Algorithmica

      Volume: 82 Pages: 3066-3090

    • DOI

      10.1007/s00453-020-00712-8

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11691
  • [Journal Article] Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank2020

    • Author(s)
      Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
    • Journal Title

      Entropy

      Volume: 22 Pages: 1295-1295

    • DOI

      10.3390/e22111295

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11691, KAKENHI-PROJECT-18J23484
  • [Journal Article] Group Strategy-proof Mechanisms for Shuttle Facility Games2020

    • Author(s)
      Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi
    • Journal Title

      Journal of Information Processing

      Volume: 28 Issue: 0 Pages: 976-986

    • DOI

      10.2197/ipsjjip.28.976

    • NAID

      130007956357

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20K11691
  • [Journal Article] A novel method for inference of chemical compounds of cycle index two with desired properties based on artificial neural networks and integer programming2020

    • Author(s)
      Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi,Tatsuya Akutsu
    • Journal Title

      Algorithms

      Volume: 13

    • DOI

      10.3390/a13050124

    • NAID

      120006993972

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20K11691
  • [Journal Article] COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets2019

    • Author(s)
      Haraguchi Kazuya、Momoi Yusuke、Shurbevski Aleksandar、Nagamochi Hiroshi
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 23 Pages: 434-458

    • DOI

      10.7155/jgaa.00497

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Journal Article] A linear-time algorithm for testing full outer-2-planarity2019

    • Author(s)
      Seok-Hee Hong, Hiroshi Nagamochi
    • Journal Title

      Discrete Applied Mathematics

      Volume: 255 Pages: 234-257

    • DOI

      10.1016/j.dam.2018.08.018

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Journal Article] Acute Constraints in Straight-Line Drawings of Planar Graphs2019

    • Author(s)
      Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E102-A, Issue: 9 Pages: 994-1001

    • DOI

      10.1587/transfun.e102.a.994

      10.1587/transfun.E102.A.994

    • NAID

      130007699537

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Journal Article] Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs2019

    • Author(s)
      Yuhei Nishiyama, Aleksandar Shurbevski , Hiroshi Nagamochi, Tatsuya Akutsu
    • Journal Title

      IEEE/ACM Trans. Comput. Biology Bioinform.

      Volume: 16 Pages: 77-90

    • DOI

      10.1109/tcbb.2018.2832061

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18H04113, KAKENHI-PROJECT-17K00014
  • [Journal Article] λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks2019

    • Author(s)
      Yuhei Fuki, Aleksandar Shurbevski, Hiroshi Nagamochi
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E102-A Issue: 9 Pages: 1179-1186

    • DOI

      10.1587/transfun.e102.a.1179

      10.1587/transfun.E102.A.1179

    • NAID

      130007699484

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Journal Article] The Stable Roommates Problem with Unranked Entries2018

    • Author(s)
      H. Suto, A. Shurbevski, H. Nagamochi
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: 101-A(9) Issue: 9 Pages: 1412-1419

    • DOI

      10.1587/transfun.e101.a.1412

      10.1587/transfun.E101.A.1412

    • NAID

      130007479450

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Journal Article] Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs2018

    • Author(s)
      J. Li, H. Nagamochi, T. Akutsu
    • Journal Title

      IEEE/ACM Transactions on Computational Biology and Bioinformatics

      Volume: 15(2) Pages: 633-646

    • DOI

      10.1109/tcbb.2016.2628888

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00014, KAKENHI-PROJECT-18H04113
  • [Journal Article] Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem2018

    • Author(s)
      M. S. Othman, A. Shurbevski, H. Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: 101-D(3) Issue: 3 Pages: 611-612

    • DOI

      10.1587/transinf.2017fcl0003

      10.1587/transinf.2017FCL0003

    • NAID

      130006414060

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Journal Article] Simpler algorithms for testing two-page book embedding of partitioned graphs2018

    • Author(s)
      S.-H. Hong, H. Nagamochi
    • Journal Title

      Theor. Comput. Sci.

      Volume: 725 Pages: 79-98

    • DOI

      10.1007/978-3-319-08783-2_41

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Journal Article] Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game2017

    • Author(s)
      Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
    • Journal Title

      J. Graph Algorithms Appl.

      Volume: 21(3) Pages: 247-263

    • DOI

      10.1007/978-3-319-30139-6_23

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-26330012, KAKENHI-PROJECT-17K00014
  • [Journal Article] Exact algorithms for maximum independent set2017

    • Author(s)
      Mingyu Xiao, Hiroshi Nagamochi
    • Journal Title

      Inf. Comput.

      Volume: 255 Pages: 126-146

    • DOI

      10.1016/j.ic.2017.06.001

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Journal Article] An Exact Algorithm for Lowest Edge Dominating Set2017

    • Author(s)
      K. Iwaide, H. Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E100. D, No. 3 Issue: 3 Pages: 414-421

    • DOI

      10.1587/transinf.2016fcp0005

      10.1587/transinf.2016FCP0005

    • NAID

      130005397877

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-26330012, KAKENHI-PROJECT-17K00014
  • [Journal Article] Complexity and kernels for bipartition into degree-bounded induced graphs2017

    • Author(s)
      Mingyu Xiao, Hiroshi Nagamochi
    • Journal Title

      Theor. Comput. Sci.

      Volume: 659 Pages: 72-82

    • DOI

      10.1007/978-3-319-13075-0_34

    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012, KAKENHI-PROJECT-17K00014
  • [Journal Article] An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure2016

    • Author(s)
      Mingyu Xiao, Hiroshi Nagamochi
    • Journal Title

      Algorithmica

      Volume: 74(2) Pages: 713-741

    • DOI

      10.1007/s00453-015-9970-4

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Journal Article] An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 42016

    • Author(s)
      M. Xiao, H. Nagamochi
    • Journal Title

      Theory of Computing Systems

      Volume: 58(2) Pages: 241-272

    • DOI

      10.1007/s00224-015-9612-x

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Journal Article] Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees2016

    • Author(s)
      M. Oomine, H. Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E99-D, no. 3 Issue: 3 Pages: 615-623

    • DOI

      10.1587/transinf.2015fcp0008

      10.1587/transinf.2015FCP0008

    • NAID

      130005131816

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Journal Article] An Improved Algorithm for Parameterized Edge Dominating Set Problem2016

    • Author(s)
      Ken Iwaide, Hiroshi Nagamochi
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 20(1) Pages: 23-58

    • DOI

      10.7155/jgaa.00383

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Journal Article] Enumerating naphthalene isomers of tree-like chemical graphs2016

    • Author(s)
      F. He, A. Hanai, H. Nagamochi, T. Akutsu
    • Journal Title

      Proc. 9th International Joint Conference on Biomedical Engineering Systems and Technologies

      Volume: 3 Pages: 258-265

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-26240034
  • [Journal Article] An exact algorithm for maximum independent set in degree-5 graphs2016

    • Author(s)
      Mingyu Xiao, Hiroshi Nagamochi
    • Journal Title

      Discrete Applied Mathematics

      Volume: 199 Pages: 137-155

    • DOI

      10.1007/978-3-642-38756-2_10

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Journal Article] An Improved Algorithm for Parameterized Edge Dominating Set Problem2016

    • Author(s)
      Ken Iwaide, Hiroshi Nagamochi
    • Journal Title

      J. Graph Algorithms Appl.

      Volume: 20(1) Pages: 23-58

    • DOI

      10.1007/978-3-319-15612-5_21

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Journal Article] Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees2016

    • Author(s)
      M. Oomine, H. Nagamochi
    • Journal Title

      IEICE Transactions Inf. and Syst.

      Volume: E99-D no. 3 Pages: 615-623

    • NAID

      130005131816

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Journal Article] Some Reduction Procedure for Computign Pathwidth of Undirected Graphs2015

    • Author(s)
      Masataka Ikeda, Hiroshi Nagamochi
    • Journal Title

      IEICE Transactions98-D(3)

      Volume: 3 Pages: 503-511

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Journal Article] Efficient Enumeration of Monocyclic Chemical Graphs with Given Path Frequencies2014

    • Author(s)
      Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu
    • Journal Title

      Journal of Cheminformatics

      Volume: 6 Pages: 31-31

    • DOI

      10.1186/1758-2946-6-31

    • NAID

      120005456003

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-26240034
  • [Journal Article] Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 32013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: Vol.E96-D No.3 Issue: 3 Pages: 408-418

    • DOI

      10.1587/transinf.e96.d.408

      10.1587/transinf.E96.D.408

    • NAID

      10031167425

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Breadth first search approach to enumeration of tree-like chemical compounds2013

    • Author(s)
      Y. Zhao, M. Hayashida, J. Jindalertudomdee, H. Nagamochi and T. Akutsu
    • Journal Title

      Journal of Bioinformatics and Computational Biology

      Volume: 11 Pages: 1143007-1143007

    • DOI

      10.1142/s0219720013430075

    • NAID

      120005587785

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-13J02920, KAKENHI-PROJECT-22240009
  • [Journal Article] Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems2013

    • Author(s)
      A. Shurbevski, H. Nagamochi , Y. Karuno
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: Vol.E96-D No.3 Issue: 3 Pages: 450-456

    • DOI

      10.1587/transinf.e96.d.450

      10.1587/transinf.E96.D.450

    • NAID

      10031167430

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Parameterized edge dominating set in graphs with degree bounded by 32013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Journal Title

      Theoretical Computer Science

      Volume: 508 Pages: 2-15

    • DOI

      10.1016/j.tcs.2012.08.015

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Better Approximation Algorithms for Grasp-and- Delivery Robot Routing Problems2013

    • Author(s)
      A. Shurbevski H. Nagamochi Y. Karuno
    • Journal Title

      IEICE Transactions

      Volume: E96-D No.3 Pages: 450-456

    • NAID

      10031167430

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 32013

    • Author(s)
      M. Xiao H. Nagamochi
    • Journal Title

      IEICE Transactions

      Volume: E96-D No.3 Pages: 408-418

    • NAID

      10031167425

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] FPTASs for trimming weighted trees2013

    • Author(s)
      M. Xiao, T. Fukunaga, H. Nagamochi
    • Journal Title

      Theoretical Computer Science

      Volume: 469 Pages: 105-118

    • DOI

      10.1016/j.tcs.2012.09.024

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Confining sets and avoiding bottleneck cases : A simple maximum independent set algorithm in degree-3 graphs2013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Journal Title

      Theoretical Computer Science

      Volume: 469 Pages: 92-104

    • DOI

      10.1016/j.tcs.2012.09.022

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Comparison and enumeration of chemical graphs2013

    • Author(s)
      Tatsuya Akutsu, Hiroshi Nagamochi
    • Journal Title

      Computational and Structural Biotechnology Journal

      Volume: 5

    • DOI

      10.5936/csbj.201302004

    • NAID

      120005243649

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Journal Article] A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners2012

    • Author(s)
      S.-H. Hong H. Nagamochi
    • Journal Title

      Algorithmica

      Volume: 62 Pages: 1122-1158

    • DOI

      10.1007/s00453-011-9513-6

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] An FPT algorithm for edge subset feedback edge set2012

    • Author(s)
      M. Xiao, H. Nagamochi
    • Journal Title

      Inf. Process. Lett.

      Volume: 112, no. 1-2 Pages: 5-9

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Indexing All Rooted Subgraphs of a Rooted Graph2012

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

      IEICE Transactions on Information and Systems

      Volume: 95-D(3) Issue: 3 Pages: 712-721

    • DOI

      10.1587/transinf.e95.d.712

      10.1587/transinf.E95.D.712

    • NAID

      10030611480

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240009, KAKENHI-PROJECT-23500015
  • [Journal Article] Protein complex prediction via improved verification methods using constrained domain-domain matching2012

    • Author(s)
      Zhao, Y., Hayashida, M., Nacher, J. C., Nagamochi, H. and Akutsu, T
    • Journal Title

      International Journal of Bioinformatics Research and Applications

      Volume: vol. 8 Pages: 210-227

    • DOI

      10.1504/ijbra.2012.048970

    • NAID

      120005243442

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700323, KAKENHI-PROJECT-22240009
  • [Journal Article] An FPT algorithm for edge subset feedback edge set2012

    • Author(s)
      M. Xiao, H. Nagamochi
    • Journal Title

      Inf. Process. Lett

      Volume: vol.112, no.1-2 Pages: 5-9

    • DOI

      10.1016/j.ipl.2011.10.007

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] On the one-dimensional stock cutting problem in the paper tube industry2012

    • Author(s)
      K.Matsumoto, S.Umetani, H.Nagamochi
    • Journal Title

      Journal of Scheduling

      Volume: 14 Pages: 281-290

    • DOI

      10.1007/s10951-010-0164-2

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20300004, KAKENHI-PROJECT-22710141, KAKENHI-PROJECT-23500015
  • [Journal Article] Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems2012

    • Author(s)
      Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
    • Journal Title

      Algorithmica

      Volume: 62 Pages: 787-806

    • DOI

      10.1007/s00453-010-9483-0

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700008, KAKENHI-PROJECT-23500015
  • [Journal Article] An exact strip packing algorithm based on canonical forms2012

    • Author(s)
      Y. Arahori, T. Imamichi, H. Nagamochi
    • Journal Title

      Computers and Operations Research

      Volume: Volume39, Issue12 Pages: 2991-3011

    • DOI

      10.1016/j.cor.2012.03.003

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints2012

    • Author(s)
      S.-H. Hong, H. Nagamochi
    • Journal Title

      Theoretical Computer Science

      Volume: 445 Pages: 36-51

    • DOI

      10.1016/j.tcs.2012.05.011

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] An approximation algorithm for locating maximal disks within convex polygons2011

    • Author(s)
      H. Aota, T. Fukunaga, H. Nagamochi
    • Journal Title

      International Journal of Computational Geometry and Applications (IJCGA)

      Volume: Volume:21, Issue:6 Pages: 661-684

    • DOI

      10.1142/s0218195911003858

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Efficient branch-and-bound algorithms for weighted MAX-2-SAT2011

    • Author(s)
      T. Ibaraki, T. Imamichi, Y. Koga, H. Nagamochi , K. Nonobe, M. Yagiura
    • Journal Title

      Mathematical Programming A

      Volume: 127, 2 Pages: 297-343

    • DOI

      10.1007/s10107-009-0285-6

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Cop-robber guarding game with cycle robber region2011

    • Author(s)
      H.Nagamochi
    • Journal Title

      Theoretical Computer Science 412

      Pages: 383-390

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Classification via Visualization of Sample-feature Bipartite Graphs2011

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
    • Journal Title

      Department of Applied Mathematics and Physics, Kyoto University, Technical Reports

    • Data Source
      KAKENHI-PROJECT-20800045
  • [Journal Article] Kernel Methods for Chemical Compounds: From Classification to Design2011

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

      IEICE Transactions on Information and Systems

      Volume: E94-D Issue: 10 Pages: 1846-1853

    • DOI

      10.1587/transinf.e94.d.1846

      10.1587/transinf.E94.D.1846

    • NAID

      10030193064

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Journal Article] An approximation algorithm with factor two for a repetitive routing problem of grasp-and-delivery robots2011

    • Author(s)
      Y. Karuno, H. Nagamochi , A. Shurbevski
    • Journal Title

      Journal of Advanced Computational Intelligence and Intelligent Informatics

      Volume: Vol.15 No.8 Pages: 1103-1108

    • URL

      http://www.fujipress.jp/finder/xslt.php?mode=present&inputfile=JACII001500080018.xml

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra2011

    • Author(s)
      S.-H. Hong, H. Nagamochi
    • Journal Title

      Algorithmica

      Volume: 61(4) Pages: 1022-1076

    • DOI

      10.1007/s00453-011-9570-x

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Minmax tree cover in the Euclidean space2011

    • Author(s)
      S. Karakawa, E. Morsy, H. Nagamochi
    • Journal Title

      J. Graph Algorithms Appl.

      Volume: 15 Pages: 345-371

    • DOI

      10.1007/978-3-642-00202-1_18

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Minmax tree cover in the Euclidean space2011

    • Author(s)
      S. Karakawa, E. Morsy, H. Nagamochi
    • Journal Title

      J. Graph Algorithms Appl

      Volume: 15(3) Pages: 345-371

    • DOI

      10.7155/jgaa.00230

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Generation of symmetric and asymmetric biconnected rooted outerplanar graphs2011

    • Author(s)
      B.Zhuang, H.Nagamochi
    • Journal Title

      IEICE Transactions

      Volume: 94-D Pages: 211-219

    • NAID

      130000453881

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Journal Article] Kansei engineering, humans and computers : Efficient dynamic programming algorithms for combinatorial food packing problems2011

    • Author(s)
      Shinji IMAHORI, Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, and Xiaoming WANG
    • Journal Title

      International Journal of Biometrics

      Volume: Vol.3, No.3 Pages: 228-245

    • DOI

      10.1504/ijbm.2011.040817

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22560066, KAKENHI-PROJECT-23500015
  • [Journal Article] Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming2011

    • Author(s)
      T.Imada, S.Ota, H.Nagamochi, T.Akutsu
    • Journal Title

      Journal of Chemical Information and Modeling

      Volume: 51 Pages: 2788-2807

    • DOI

      10.1021/ci200084b

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Journal Article] An approximation algorithm with factor two for a repetitive routing problem of grasp-and-delivery robots2011

    • Author(s)
      Y. Karuno, H. Nagamochi, A. Shurbevski
    • Journal Title

      Journal of Advanced Computational Intelligence and Intelligent Informatics

      Volume: 15 Pages: 1103-1108

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming2011

    • Author(s)
      T.Imada, S.Ota, H.Nagamochi, T.Akutsu
    • Journal Title

      Journal of Mathematical Chemistry

      Volume: 49 Pages: 910-970

    • NAID

      120003001339

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Journal Article] Approximating capacitated tree-routings in networks2011

    • Author(s)
      E.Morsy, H.Nagamochi
    • Journal Title

      Journal of Combinatorial Optimization 21(2)

      Pages: 254-267

    • NAID

      110006380991

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies2011

    • Author(s)
      M.Shimizu, H.Nagamochi, T.Akutsu
    • Journal Title

      BMC Bioinformatics

      Volume: 12

    • DOI

      10.1186/1471-2105-12-s14-s3

    • NAID

      120004770232

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Journal Article] Cop-robber guarding game with cycle robber region2011

    • Author(s)
      H. Nagamochi
    • Journal Title

      Theoretical Computer Science

      Volume: 412 Pages: 383-390

    • DOI

      10.1007/978-3-642-02270-8_10

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Generation of symmetric and asymmetric biconnected rooted triangulated planar graphs2011

    • Author(s)
      B.Zhuang, H.Nagamochi
    • Journal Title

      IEICE Transactions

      Volume: 94-D Pages: 200-210

    • NAID

      130000453880

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Journal Article] Cop-robber guarding game with cycle robber region2011

    • Author(s)
      H.Nagamochi
    • Journal Title

      Theoretical Computer Science

      Volume: 412 Pages: 383-390

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Approximating capacitated tree-routings in networks2011

    • Author(s)
      E. Morsy, H. Nagamochi
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 21(2) Pages: 254-267

    • DOI

      10.1007/s10878-009-9238-5

    • NAID

      110006380991

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Journal Article] Approximation to the minimum cost edge installation problem,2010

    • Author(s)
      E.Morsy, H.Nagamochi
    • Journal Title

      IEICE Transactions E93-A, no.4

      Pages: 778-786

    • NAID

      110006827374

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables2010

    • Author(s)
      K.Haraguchi, S.H.Hong, H.Nagamochi
    • Journal Title

      Proceedings of LION 4 LNCS 6073

      Pages: 169-183

    • NAID

      120005347334

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Journal Article] Visual Analysis of Hierarchical Data Using 2. 5D Drawing with Minimum Occlusion2010

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
    • Journal Title

      Department of Applied Mathematics and Physics, Kyoto University, Technical Reports

    • Data Source
      KAKENHI-PROJECT-20800045
  • [Journal Article] Optimization problems and algorithms in double-layered food packing systems, Journal of Advanced Mechanical Design2010

    • Author(s)
      Y.Karuno, H.Nagamochi, X.Wang
    • Journal Title

      Systems, and Manufacturing Vol.4, No.3

      Pages: 605-615

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Branch-and-bound algorithms forenumerating treelike chemical graphswith given path frequency usingdetachment-cut2010

    • Author(s)
      Y.Ishida, Y.Kato, L.Zhao, H.Nagamochi, T.Akutsu
    • Journal Title

      Journal of ChemicalInformation and Modeling 50

      Pages: 934-946

    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] An algorithm for constructing star-shaped drawings of plane graphs2010

    • Author(s)
      S.-H.Hong, H.Nagamochi
    • Journal Title

      Computational Geometry Theory and Applications vol.43, no.2

      Pages: 191-206

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Minimum degree orderings2010

    • Author(s)
      H.Nagamochi
    • Journal Title

      Algorithmica

      Volume: 56 Pages: 17-34

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] An algorithm for constructing star-shaped drawings of plane graphs2010

    • Author(s)
      S.-H.Hong, H.Nagamochi
    • Journal Title

      Computational Geometry Theory and Applications vol.43, no.2,

      Pages: 191-206

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Approximation algorithms for minimizing edge, crossings in radial drawings2010

    • Author(s)
      S.-H.Hong, H.Nagamochi
    • Journal Title

      Algorithmica vol.58, no.2

      Pages: 478-497

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs2010

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

      Algorithmica vol.56, no.4

      Pages: 413-436

    • NAID

      110003178713

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Minimum degree orderings2010

    • Author(s)
      H.Nagamochi
    • Journal Title

      Algorithmica vol.56, no.1

      Pages: 17-34

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] A plane graph representation of a triconnected graph2010

    • Author(s)
      S.Ota, E.Morsy, H.Nagamochi
    • Journal Title

      Theoretical Computer Science 411

      Pages: 3979-3993

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Network design with weighted degree constraints2010

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

      Discrete Optimization 7

      Pages: 246-255

    • NAID

      120002511312

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut2010

    • Author(s)
      Y.Ishisa, Y.Kato, L.Zhao, H.Nagamochi, T.Akutsu
    • Journal Title

      Journal of Chemical Information and Modeling 50(採録決定)

      Pages: 834-946

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables2010

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
    • Journal Title

      Proc. LION 4 (LNCS 6073)

      Pages: 169-183

    • NAID

      120005347334

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Journal Article] A linear-time algorithm for symmetric convex, drawings of internally triconnected planar graphs2010

    • Author(s)
      S.-H.Hong, H.Nagamochi
    • Journal Title

      Algorithmica vol.58, no.2

      Pages: 433-460

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Enumerating stereoisomers of tree structured molecules using dynamic programming2009

    • Author(s)
      T.Imada, S.Ota, H.Nagamochi, T.Akutsu
    • Journal Title

      Lecture Notes in Computer Science 5878

      Pages: 14-23

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Bipartite graph representation of multiple decision table classifiers2009

    • Author(s)
      K.Haraguchi, S.H.Hong, H.Nagamochi
    • Journal Title

      Proceedings of SAGA 2009 LNCS 5792

      Pages: 46-60

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Journal Article] Visualization can improve multiple decision table classifiers2009

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
    • Journal Title

      Proc. MDAI 2009 (ISBN: 978-84-00-08851-4)

      Pages: 41-52

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Journal Article] An iterated local search algorithm based on nonlinear programmingfor the irregular strip packing problem2009

    • Author(s)
      T.Imamichi, M.Yagiura, H.Nagamochi
    • Journal Title

      Discrete Optimization vol.6, no.4

      Pages: 345-361

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Enumerating stereoisomers of tree structured molecules using dynamic programming2009

    • Author(s)
      T. Imada, S. Ota, H. Nagamochi, T. Akutsu
    • Journal Title

      Lecture Notes in Computer Science No. 5878

      Pages: 14-23

    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Scheduling capacitated one-way vehicles on paths with deadlines2009

    • Author(s)
      J. Uchida, Y. Karuno, H. Nagamochi
    • Journal Title

      SICE Journal of Control, Measurement, and System Integration Vol. 2, No. 1

      Pages: 20-26

    • NAID

      10031152616

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Visualization can improve multiple decision table classifiers2009

    • Author(s)
      K.Haraguchi, S.H.Hong, H.Nagamochi
    • Journal Title

      Proceedings of MDAI 2009 ISBN 9788400088514(CD-ROM)

      Pages: 41-52

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Journal Article] Exact algorithms for the 2-dimensional strip packing problem with and without rotations2009

    • Author(s)
      M.Kenmochi, T.Imamichi, K.Nonobe, M.Yagiura, H.Nagamochi
    • Journal Title

      European Journal of Operational Research 198(1)

      Pages: 73-83

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] Bipartite graph representation of multiple decision table classifiers2009

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
    • Journal Title

      Proc. SAGA 2009 (LNCS 5792)

      Pages: 46-60

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Journal Article] Enumerating stereoisomers oftree structured molecules usingdynamic programming2009

    • Author(s)
      T.Imada, S.Ota, H.Nagamochi, T.Akutsu
    • Journal Title

      Lecture Notes inComputer Science 5878

      Pages: 14-23

    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Drawing slicing graphs with face areas2009

    • Author(s)
      A.Kawaguchi, H.Nagamochi
    • Journal Title

      Theoretical Computer Science 410(11)

      Pages: 1061-1072

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Journal Article] A clustering method for analysis of sequence similarity networks of proteins using maximal components of graphs2008

    • Author(s)
      M.Hayashida, T.Akutsu, H.Nagamochi
    • Journal Title

      IPSJ Transactions on Bioinformatics 49-Sig 5

      Pages: 15-24

    • NAID

      110006684906

    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Enumerating tree-like chemical graphs with given path frequency2008

    • Author(s)
      H. Fujiwara, J. Wang, L. Zhao, H. Nagamochi, T. Akutsu
    • Journal Title

      Journal of Chemical Information and Modeling Vol. 48

      Pages: 1345-1357

    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Enumerating tree-like chemical graphs with given path frequency2008

    • Author(s)
      H.Fujiwara, J.Wang, L.Zhao, H.Nagamochi, T.Akutsu
    • Journal Title

      Journal of Chemical Information and Modeling 48

      Pages: 1345-1357

    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Approximating a vehicle scheduling problem with time windows and handling times2008

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

      Theoretical Computer Science 393 (1-3)

      Pages: 133-146

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Enumerating tree-like chemical graphs with given path frequency2008

    • Author(s)
      H. Fujiwara, J. Wang, L. Zhao, H. Nagamochi, T. Akutsu
    • Journal Title

      Journal of Chemical Information and Modeling 48

      Pages: 1345-1357

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Performance analysis of a collision detection algorithm of spheres based on slab partitioning2008

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

      IEICE Transactions 91-A (9)

      Pages: 2308-2313

    • NAID

      10026851353

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Worst case analysis for pickup and delivery problems with transfer2008

    • Author(s)
      Y. Nakao, H. Nagamochi
    • Journal Title

      IEICE Transactions 91-A(9)

      Pages: 2328-2334

    • NAID

      10026851402

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] A clustering method for analysis of sequence similarity networks of proteins using maximal components of graphs2008

    • Author(s)
      M. Hayashida, T. Akutsu and H. Nagamochi
    • Journal Title

      IPSJ Transactions on Bioinformatics 49-Sig5

      Pages: 15-24

    • NAID

      110006684906

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Minimum cost subpartitions in graphs2007

    • Author(s)
      H.Nagamochi
    • Journal Title

      Information Processing Letters 102

      Pages: 79-84

    • NAID

      110004824077

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] An approximation algorithm for dissecting a rectangle into rectangles with specified areas2007

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics 155

      Pages: 523-537

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Computing a minimum cut in a graph with dynamic edges incident to a designated vertex2007

    • Author(s)
      H., Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems E90-D

      Pages: 428-431

    • NAID

      110007519486

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Minimum cost subpartitions in graphs2007

    • Author(s)
      H. Nagamochi
    • Journal Title

      Information Processing Letters 102

      Pages: 79-84

    • NAID

      110004824077

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds2007

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

      J. Operations Research Society of Japan vol. 50, no. 4

      Pages: 339-349

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Approximating the minmax rooted-tree cover in a tree2007

    • Author(s)
      H.Nagamochi
    • Journal Title

      Information Processing Letters 104

      Pages: 173-178

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Drawing c-planar biconnected clustered graphs2007

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics 155

      Pages: 1155-1174

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Minimum cost subpartitions in graphs2007

    • Author(s)
      H., Nagamochi
    • Journal Title

      Information Processing Letters 102

      Pages: 79-84

    • NAID

      110004824077

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Approximating the minmax rooted-tree cover in a tree2007

    • Author(s)
      H. Nagamochi
    • Journal Title

      Information Processing Letters 104

      Pages: 173-178

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Computing a minimum cut in a graph with dynamic edges incident to a designated vertex2007

    • Author(s)
      H. Nagamochi
    • Journal Title

      Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals vol.E90-D, no.2

      Pages: 428-431

    • NAID

      110007519486

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Computing a minimum cut in a graph with dynamic edges incident to a designated vertex2007

    • Author(s)
      H. Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems E90-D

      Pages: 428-431

    • NAID

      110007519486

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Approximating the minmax rooted-tree cover in a tree2007

    • Author(s)
      H., Nagamochi
    • Journal Title

      Information Processing Letters 104

      Pages: 173-178

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Computing a minimum cut in a graph with dynamic edges incident to a designated vertex2007

    • Author(s)
      H. Nagamochi
    • Journal Title

      Inst. Electron. Inform. Comm. Eng. Trans. Fund. E90-D

      Pages: 428-431

    • NAID

      110007519486

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Sparse connectivity certificates via MA orderings in graphs2006

    • Author(s)
      H. Nagamochi
    • Journal Title

      Discrete Applied Mathematics 154

      Pages: 2411-2417

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Increasing the edge-connectivity by contracting a vertex subset2006

    • Author(s)
      H. Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems vol. E89-D, no. 2

      Pages: 744-750

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Minmax subtree cover problem on cacti2006

    • Author(s)
      H. Nagamochi
    • Journal Title

      Discrete Applied Mathematics 154

      Pages: 1254-1263

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] A fast edge-splitting algorithm in edge-weighted graphs2006

    • Author(s)
      H. Nagamochi
    • Journal Title

      IEICE Transactions on Fundamentals of Electro-nics, Communications and Computer Sciences E89-A

      Pages: 1263-1268

    • NAID

      110007502839

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Increasing the edge-connectivity by contracting a vertex subset2006

    • Author(s)
      H.Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems E89-D・2

      Pages: 744-750

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Packing soft rectangles2006

    • Author(s)
      H.Nagamochi
    • Journal Title

      International Journal of Foundations of Computer Science 17・5

      Pages: 1165-1178

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Sparse connectivity certificates via MA orderings in graphs2006

    • Author(s)
      H. Nagamochi
    • Journal Title

      Discrete Applied Mathematics vol. 154

      Pages: 2411-2417

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Minmax subtree cover problem on cacti2006

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics 154・8

      Pages: 1254-1263

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Increasing the edge-connectivity by contracting a vertex subset,2006

    • Author(s)
      H.Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems E89-D・2

      Pages: 744-750

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Packing soft rectangles2006

    • Author(s)
      H. Nagamochi
    • Journal Title

      International Journal of Foundations of Computer Science vol. 17, no. 5

      Pages: 1165-1178

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] A fast edge-splitting algorithm in edge-weighted graphs2006

    • Author(s)
      H.Nagamochi
    • Journal Title

      Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals E89-A・5

      Pages: 1263-1268

    • NAID

      110007502839

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Increasing the edge-connectivity by contracting a vertex subset in graphs2006

    • Author(s)
      H. Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems E89-D

      Pages: 744-750

    • NAID

      110004719344

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Sparse connectivity certificates via MA orderings in graphs2006

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics 154

      Pages: 2411-2417

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] A fast edge-splitting algorithm in edge-weighted graphs2006

    • Author(s)
      H. Nagamochi
    • Journal Title

      Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals vol. E89-A, no. 5

      Pages: 1263-1268

    • NAID

      110007502839

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Increasing the edge-connectivity by contracting a vertex subset,2006

    • Author(s)
      H.Nagamochi
    • Journal Title

      IEICE Transactions on Information and Systems E89-D・2

      Pages: 744-750

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] On computing minimum (s,t)-cuts in digraphs2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Information Processing Letters 93・5

      Pages: 231-237

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Packing unit squares in a rectangle2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      The Electronic Journal of Combinatorics 12・1

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] On the one-sided crossing minimization in a bipartite graph with large degrees2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Theoretical Computer Science 332

      Pages: 417-446

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

    • Author(s)
      H.Nagamochi
    • Journal Title

      Theoretical Computer Science A 341

      Pages: 364-378

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] On 2-approximation to the vertex-connectivity in graphs2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Inst.Electron.Inform.Comm.Eng.Trans.Information and Systems E88-D/1

      Pages: 12-16

    • NAID

      110003214129

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      J.Algorithms 56

      Pages: 77-95

    • NAID

      110004027516

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] On computing minimum (s,t)-cuts in digraphs2005

    • Author(s)
      HNagamochi
    • Journal Title

      Information Processing Letters 93・5

      Pages: 231-237

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] A4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph2005

    • Author(s)
      H. Nagamochi
    • Journal Title

      Journal of Algorithms 56

      Pages: 77-95

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] A greedy splitting algorithm for approximating multiway partition problems2005

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

      Mathematical Programming 102・1

      Pages: 167-183

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] On the one-sided crossing minimization in a bipartite graph with large degrees2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Theoretical Computer Science 332・1-3

      Pages: 417-446

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] On 2-approximation to the vertex-connectivity in graphs2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Inst. Electron. Inform. Comm. Eng. Trans. Information and Systems E88-D・1

      Pages: 12-16

    • NAID

      110003214129

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Approximating the minmax rooted-subtree cover problem2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Electron.Inform.Comm.Eng.Trans.Fundamentals E88-A・5

      Pages: 1335-1338

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] An improved bound on the one-sided minimum crossing number in two-layered drawings2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete and Computational Geometry 33・4

      Pages: 569-591

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] A greedy splitting algorithm for approximating multiway partition problems2005

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

      Mathematical Programming 102・1

      Pages: 167-183

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] On computing minimum (s,t)-cuts in digraphs2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Information Processing Letters 93/5

      Pages: 231-237

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Approximating the minimax rooted-subtree cover problem2005

    • Author(s)
      H. Nagamochi
    • Journal Title

      IEICE Transactions on Fundamentals of Electro-nics, Communications and Computer Sciences E88-A

      Pages: 1335-1338

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] On 2-approximation to the vertex-connectivity in graphs2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Inst.Electron.Inform.Comm.Eng.Trans.Information and Systems E88-D・1

      Pages: 12-16

    • NAID

      110003214129

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Approximating the minmax rooted-subtree cover problem2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Electron.Inform.Comm.Eng.Trans.Fundamentals E88-A・5

      Pages: 1335-1338

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] A greedy splitting algorithm for approximating multiway partition problems2005

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

      Mathematical Programming 102/1

      Pages: 167-183

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] On computing minimum (s,t)-cuts in digraphs2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Information Processing Letters 93・5

      Pages: 231-237

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] On the one-sided crossing minimization in a bipartite graph with large degrees2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Theoretical Computer Science 332/1-3

      Pages: 417-446

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] An improved bound on the one-sided minimum crossing number in two-layered drawings2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete and Computational Geometry 33・4

      Pages: 569-591

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] On the one-sided crossing minimization in a bipartite graph with large degrees2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Theoretical Computer Science 332

      Pages: 417-446

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] On computing minimum (s, t)-cuts in digraphs2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Information Processing Letters 93・5

      Pages: 231-237

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] On 2-approximation to the vertex-connectivity in graphs2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Inst.Electron.Inform.Comm.Eng.Trans.Information and Systems E88-D・1

      Pages: 12-16

    • NAID

      110003214129

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      J.Algorithms 56

      Pages: 77-95

    • NAID

      110004027516

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] A greedy splitting algorithm for approximating multiway partition problems2005

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

      Mathematical Programming 102・1

      Pages: 167-183

    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Packing unit squares in a rectangle2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      The Electronic Journal of Combinatorics 12・1

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] On the one-sided crossing minimization in a bipartite graph with large degrees2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Theoretical Computer Science 332・1-3

      Pages: 417-446

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

    • Author(s)
      H.Nagamochi
    • Journal Title

      Theoretical Computer Science A 341

      Pages: 364-378

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] On 2-approximation to the vertex-connectivity in graphs2005

    • Author(s)
      H.Nagamochi
    • Journal Title

      Inst.Electron.Inform.Comm.Eng.Trans. Information and Systems E88-D・1

      Pages: 12-16

    • NAID

      110003214129

    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Graph algorithms for network connectivity problems2004

    • Author(s)
      H.Nagamochi
    • Journal Title

      J.Operations Research Society of Japan 47・4

      Pages: 199-223

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] An approximability result of the multi-vehicle scheduling problem on a path with release and handling times2004

    • Author(s)
      Y.Karuno, H.Nagamochi
    • Journal Title

      Theoretical Computer Science A 312・2-3

      Pages: 267-280

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] A faster 2-approximation algorithm for the minmax p--traveling salesmen problem on a tree2004

    • Author(s)
      H.Nagamochi, K.Okada
    • Journal Title

      Discrete Applied Mathematics 140・1-3

      Pages: 103-114

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Graph algorithms for network connectivity problems2004

    • Author(s)
      H.Nagamochi
    • Journal Title

      J.Operations Research Society of Japan 47/4

      Pages: 199-223

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Counting edge crossings in a 2-layered drawing2004

    • Author(s)
      H.Nagamochi, N.Yamada
    • Journal Title

      Information Processing Letters 91・5

      Pages: 221-225

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] On generalized greedy splitting algorithms for multiway partition problems2004

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

      Discrete Applied Mathematics 143・1

      Pages: 130-143

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] On generalized greedy splitting algorithms for multiway partition problems2004

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

      Discrete Applied Mathematics 143・1

      Pages: 130-143

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] On generalized greedy splitting algorithms for multiway partition problems2004

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

      Discrete Applied Mathematics 143/1

      Pages: 130-143

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Graph algorithms for network connectivity problems2004

    • Author(s)
      H.Nagamochi
    • Journal Title

      J.Operations Research Society of Japan 47・4

      Pages: 199-223

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] A faster 2-approximation algorithm for the minmax p--traveling salesmen problem on a tree2004

    • Author(s)
      H.Nagamochi, K.Okada
    • Journal Title

      Discrete Applied Mathematics 140・1-3

      Pages: 103-114

    • 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

    • Data Source
      KAKENHI-PROJECT-16092212
  • [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] Counting edge crossings in a 2-layered drawing2004

    • Author(s)
      H.Nagamochi, N.Yamada
    • Journal Title

      Information Processing Letters 91/5

      Pages: 221-225

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] An approximability result of the multi-vehicle scheduling problem on a path with release and handling times2004

    • Author(s)
      Y.Karuno, H.Nagamochi
    • Journal Title

      Theoretical Computer Science A 312・2-3

      Pages: 267-280

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree2004

    • Author(s)
      H.Nagamochi, K.Okada
    • Journal Title

      Discrete Applied Mathematics 140/1-3

      Pages: 103-114

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Counting edge crossings in a 2-layered drawing2004

    • Author(s)
      H.Nagamochi, N.Yamada
    • Journal Title

      Information Processing Letters 91・5

      Pages: 221-225

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] An approximability result of the multi-vehicle scheduling problem on a path with release and handling times2004

    • Author(s)
      Y.Karuno, H.Nagamochi
    • Journal Title

      Theoretical Computer Science, A 312/2-3

      Pages: 267-280

    • 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] 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] Straight-line drawing algorithms for hierarchical graphs and clustered graphs

    • Author(s)
      P.Eades, Q.Feng, X.Lin, H.Nagamochi
    • Journal Title

      Algorithmica (発行予定)

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Scheduling vehicles on trees

    • Author(s)
      Y.Karuno, H.Nagamochi
    • Journal Title

      Pacific Journal or Optimization (発行予定)

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Straight-line and clustered graphs

    • Author(s)
      P.Eades, Q.Feng, X.Lin, H.Nagamochi
    • Journal Title

      Algorithmica (to appear)

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] An improved bound on the one-sided minimum crossing number in two-layered drawings

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete and Computational Geometry (to appear)

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph

    • Author(s)
      H.Nagamochi
    • Journal Title

      J.Algorithms (発行予定)

    • NAID

      110004027516

    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Approximating the minmax rooted-tree cover in a tree

    • Author(s)
      H.Nagamochi
    • Journal Title

      Information Processing Letters (掲載確定)

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Straight-line drawing algorithms for hierarchical graphs and clustered graphs

    • Author(s)
      P.Eades, Q.Feng, X.Lin, H.Nagamochi
    • 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.Take
    • Journal Title

      ISCIE Journal Systems (発行予定)

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Scheduling vehicles on trees

    • Author(s)
      Y.Karuno, H.Nagamochi
    • Journal Title

      Pacific Journal of Optimization (発行予定)

    • Data Source
      KAKENHI-PROJECT-14580372
  • [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-16092212
  • [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
  • [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] Approximating the minmax rooted-subtree cover problem

    • Author(s)
      H.Nagamochi
    • Journal Title

      IEICE Transactions (発行予定)

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph

    • Author(s)
      H.Nagamochi
    • Journal Title

      J.Algorithms (発行予定)

    • NAID

      110004027516

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Scheduling vehicles on trees

    • Author(s)
      Y.Karuno, H.Nagamochi
    • Journal Title

      Pacific Journal of Optimization (発行予定)

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Approximating the minmax rooted-subtree cover problem

    • Author(s)
      H.Nagamochi
    • Journal Title

      IEICE Transactions (発行予定)

    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut

    • Author(s)
      Y. Ishida, Y. Kato, L. Zhao, H. Nagamochi, T. Akutsu
    • Journal Title

      Journal of Chemical Information and Modeling (in press)

    • Data Source
      KAKENHI-PROJECT-19200022
  • [Journal Article] Approximating the minmax rooted-subtree cover problem

    • Author(s)
      H.Nagamochi
    • Journal Title

      IEICE Transactions (発行予定)

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph

    • Author(s)
      H.Nagamochi
    • Journal Title

      J.Algorithms (発行予定)

    • NAID

      110004027516

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] An improved bound on the one-sided minimum crossing number in two-layered drawings

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete and Computational Geometry (発行予定)

    • Data Source
      KAKENHI-PROJECT-14580372
  • [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] An improved bound on the one-sided minimum crossing number in two-layered drawings

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete and Computational Geometry (発行予定)

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Journal Article] An improved bound on the one-sided minimum crossing number in two-layered drawings

    • Author(s)
      H.Nagamochi
    • Journal Title

      Discrete and Computational Geometry (発行予定)

    • Data Source
      KAKENHI-PROJECT-16092212
  • [Journal Article] Computing a minimum cut in a graph with dynamic edges incident to a designated vertex

    • Author(s)
      H.Nagamochi
    • Journal Title

      Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals (掲載確定)

    • NAID

      110007519486

    • Data Source
      KAKENHI-PROJECT-17500008
  • [Journal Article] Straight-line drawing algorithms for hierarchical graphs and clustered graphs and clustered graphs

    • Author(s)
      P.Eades, Q.Feng, X.Lin, H.Nagamochi
    • Journal Title

      Algorithmica (発行予定)

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [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] Approximating the minmax rooted-subtree cover problem

    • Author(s)
      H.Nagamochi
    • Journal Title

      IEICE Transactions (to appear)

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14580372
  • [Presentation] A method for the inverse QSAR/QSPR based on artificial neuralnetworks and mixed integer linear programming2020

    • Author(s)
      N. A. Azam, R. Chiewvanichakorn, F. Zhang, A. Shurbevski, H. Nagamochi T. Akutsu
    • Organizer
      BIOINFORMATICS2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] Path-monotonic upward drawings of plane graphs2020

    • Author(s)
      Seok-Hee Hong, Hiroshi Nagamochi
    • Organizer
      The 26th International Computing and Combinatorics Conference
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11691
  • [Presentation] A new integer linear programming formulation to the inverse QSAR/QSPR for acyclic chemical compounds using skeleton trees2020

    • Author(s)
      F. Zhang, J. Zhu, R. Chiewvanichakorn, A. Shurbevski, H. Nagamochi,T. Akutsu
    • Organizer
      The 33rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11691
  • [Presentation] On the enumeration of minimal non-pairwise compatibility graphs2020

    • Author(s)
      Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
    • Organizer
      The 26th International Computing and Combinatorics Conference
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11691
  • [Presentation] A new integer linear programming formulationto the inverse QSAR/QSPR for acyclic chemical compoundsusing skeleton trees2020

    • Author(s)
      F. Zhang, J. Zhu, R. Chiewvanichakorn, A. Shurbevski, H. Nagamochi,T. Akutsu
    • Organizer
      The 33rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] A method for the inverse QSAR/QSPR based on artificial neural networks and mixed integer linear programming2020

    • Author(s)
      R. Chiewvanichakorn, C. Wang, Z. Zhang, A. Shurbevski, H. Nagamochi, T. Akutsu
    • Organizer
      10th International Conference on Bioscience,Biochemistry and Bioinformatics
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] A method for the inverse QSAR/QSPR based on artificial neural networks and mixed integer linear programming2020

    • Author(s)
      R. Chiewvanichakorn, C. Wang, Z. Zhan, A. Shurbevski, H. Nagamochi, T. Akutsu
    • Organizer
      12th International Conference on Bioscience, Biochemistry and Bioinformatics
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04113
  • [Presentation] A novel method for the inverse QSAR/QSPR based on artificial neural networks and mixed integer linear programming with guaranteed admissibility2020

    • Author(s)
      N. A. Azam, R. Chiewvanichakorn, F. Zhang, A. Shurbevski, H. Nagamochi, T. Akutsu
    • Organizer
      13th International Joint Conference on Biomedical Engineering Systems and Technologies
    • Data Source
      KAKENHI-PROJECT-18H04113
  • [Presentation] Experimental results of a dynamic programming algorithm for generating chemical isomers based on frequency vectors2020

    • Author(s)
      Naveed Ahmed Azam, Jianshen Zhu, Ryota Ido, Hiroshi Nagamochi,Tatsuya Akutsu
    • Organizer
      The Fourth International Workshop on Enumeration Problems and Applications
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11691
  • [Presentation] A novel method for the inverse QSAR/QSPR to monocyclic chemical compounds based on artificial neural networks and integer programming2020

    • Author(s)
      Ren Ito, Naveed Ahmed Azam, Chenxi Wang, Aleksandar Shurbevski,Hiroshi Nagamochi, Tatsuya Akutsu
    • Organizer
      The 21st International Conference on Bioinformatics & Computational Biology
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11691
  • [Presentation] An Integer Programming-Based Method to Control Problems in Boolean Networks2019

    • Author(s)
      Zhe Zhang, Hiroshi Nagamochi, Tatsuya Akutsu
    • Organizer
      The 12th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] A method for the inverse QSAR/QSPR based on artificial neural networks and mixed integer linear programming2019

    • Author(s)
      R. Chiewvanichakorn, C. Wang, Z. Zhan, A. Shurbevski, H. Nagamochi, T. Akutsu
    • Organizer
      第123回MPS・第58回BIO合同研究発表会
    • Data Source
      KAKENHI-PROJECT-18H04113
  • [Presentation] A Polynomial-delay Algorithm for Enumerating Connectors under Various Connectivity Conditions2019

    • Author(s)
      Kazuya Haraguchi, Hiroshi Nagamochi
    • Organizer
      The 30th International Symposium on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] A Mixed Integer Linear Programming Formulation to Artificial Neural Networks2019

    • Author(s)
      Tatsuya Akutsu, Hiroshi Nagamochi
    • Organizer
      2nd International Conference on Information Science and System
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04113
  • [Presentation] Counting Tree-Like Graphs with a Given Number of Vertices and Self-loops2019

    • Author(s)
      Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
    • Organizer
      the Third International Workshop on Enumeration Problems and Applications (WEPA2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] Experimental Comparison of Connector Enumeration Algorithms2019

    • Author(s)
      Kazuya Haraguchi, Hiroshi Nagamochi
    • Organizer
      the Third International Workshop on Enumeration Problems and Applications (WEPA2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] A Mixed Integer Linear Programming Formulation to Artificial Neural Networks2019

    • Author(s)
      T. Akutsu, H. Nagamochi
    • Organizer
      2nd International Conference on Information Science and System
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] An Improved Method for Enumerating Pairwise Compatibility Graphs with a Given Number of Vertices2019

    • Author(s)
      Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
    • Organizer
      The 12th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] A Routing Problem in Warehouse Graphs2019

    • Author(s)
      Xinhu Lan, Aleksandar Shurbevski, Hiroshi Nagamochi
    • Organizer
      The 22nd Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] Algorithms for the 2-Layer Crossing Minimization Problem2018

    • Author(s)
      Y. Song, A. Shurbevski, H. Nagamochi
    • Organizer
      The Thirteenth International Symposium on Operations Research and Its Applications
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable2018

    • Author(s)
      M. Xiao, H. Nagamochi,
    • Organizer
      ICALP 2018
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets2018

    • Author(s)
      K. Haraguchi, Y. Momoi, A. Shurbevski, H. Nagamochi
    • Organizer
      WEPA 2018
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] Acute Constraints in Straight-Line Drawings of Planar Graphs2018

    • Author(s)
      A. Seto, A. Shurbevski, H. Nagamochi, P. Eades
    • Organizer
      In the 21st Korea-Japan Joint Workshop on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks2018

    • Author(s)
      Y. Fukui, A. Shurbevski, H. Nagamochi
    • Organizer
      In the 21st Korea-Japan Joint Workshop on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] A Truck Scheduling Problem with Boomerang Drone Delivery2018

    • Author(s)
      A. Seto, A. Shurbevski, H. Nagamochi
    • Organizer
      Scheduling Symposium 2018
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] Resource cut, a new bounding procedure to algorithms for Enumerating tree-like chemical graphs2018

    • Author(s)
      Y. Nishiyama, A. Shurbevski, H. Nagamochi and T. Akutsu
    • Organizer
      The Sixteenth Asia Pacific Bioinformatics Conference
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26240034
  • [Presentation] Enumerating All Pairwise Compatibility Graphs with a Given Number of Vertices Based on Linear Programming2018

    • Author(s)
      N. A. Azam, M. Ito, A. Shurbevski, H. Nagamochi
    • Organizer
      WEPA 2018
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] Enumerating chemical mono-block 3-augmented trees with two junctions2018

    • Author(s)
      Y. Tamura, A. Shurbevski, H. Nagamochi, and T. Akutsu
    • Organizer
      The 8th International Conference on Bioscience, Biochemistry and Bioinformatics
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26240034
  • [Presentation] A New ILP for Two-layer Crossing Minimization for Bipartite Graphs2017

    • Author(s)
      Y. Song, A. Shurbevski, S.-H. Hong, H. Nagamochi
    • Organizer
      in The 20th Korea-Japan Joint Workshop on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] Routing of Carrier-Vehicle Systems with Dedicated Last-Stretch Delivery Vehicle2017

    • Author(s)
      S. Othman, A. Shurbevski, H. Nagamochi
    • Organizer
      International Symposium on Scheduling
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] The Stable Roommates Problem with Unranked Entries2017

    • Author(s)
      H. Suto, A. Shurbevski, H. Nagamochi
    • Organizer
      In The 20th Japan Conference on Discrete and Computational Geometry, Graphs and Games
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] A short review of methods for Caspase cleavage site prediction2017

    • Author(s)
      B. Yu、M. Simone、T. Takeyuki、K. Mayumi、M. Shingo、H. Hiroshi、S. Jiangning、T. Akutsu
    • Organizer
      情報処理学会第51回バイオ情報学研究会
    • Data Source
      KAKENHI-PROJECT-26240034
  • [Presentation] Approximation Algorithms for the Traveling Salesman with a Drone2017

    • Author(s)
      S. Othman, A. Shurbevski, H. Nagamochi
    • Organizer
      The 10th Annual Meeting of the Asian Association for Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00014
  • [Presentation] Routing Problems with Last-Stretch Delivery2016

    • Author(s)
      M. S. B. Othman, A. Shurbevski, Y. Karuno, H. Nagamochi
    • Organizer
      The 19th Japan Conference on Discrete and Computational Geometry and Graphs
    • Place of Presentation
      Tokyo University of Science,Tokyo, Japan
    • Year and Date
      2016-09-02
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time2016

    • Author(s)
      Seok-Hee Hong and Hiroshi Nagamochi
    • Organizer
      The 24th International Symposium on Graph Drawing and Network Visualization
    • Place of Presentation
      Athens, Greece
    • Year and Date
      2016-09-19
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] A Polynomial-space Exact Algorithm for the TSP in Degree-7 Graphs2016

    • Author(s)
      N. Md Yunos, A. Shurbevski, H. Nagamochi
    • Organizer
      The 9th Annual Meeting of Asian Association for Algorithms and Computation
    • Place of Presentation
      NTU, Taipei, Taiwan
    • Year and Date
      2016-05-14
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] A Linear-time Algorithm for Integral Multiterminal Flows in Trees2016

    • Author(s)
      Mingyu Xiao and Hiroshi Nagamochi
    • Organizer
      The 27th International Symposium on Algorithm and Computation
    • Place of Presentation
      Sydney, Australia
    • Year and Date
      2016-12-12
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] A Polynomial-space Exact Algorithm for the TSP in Degree-8 Graphs2016

    • Author(s)
      N. Md Yunos, A. Shurbevski, H. Nagamochi
    • Organizer
      The 19th Japan-Korea Joint Workshop on Algorithms and Computation
    • Place of Presentation
      函館市民会館 北海道函館市
    • Year and Date
      2016-08-30
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game2016

    • Author(s)
      Morito Oomine, Aleksandar Shurbevski, and Hiroshi Nagamochi
    • Organizer
      The 10th International Workshop on Algorithms and Computation
    • Place of Presentation
      Kathmandu, Nepal
    • Year and Date
      2016-03-29
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] Exact Algorithms for the Bipartite Traveling Salesman Problem2016

    • Author(s)
      M. S. B. Othman, A. Shurbevski, H. Nagamochi
    • Organizer
      The 9th Annual Meeting of Asian Association for Algorithms and Computation
    • Place of Presentation
      NTU, Taipei, Taiwan
    • Year and Date
      2016-05-14
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] A Method for Generating Colorings over Graph Automorphis2015

    • Author(s)
      Fei He, H. Nagamochi
    • Organizer
      The 12th International Symposium on Operations Research and its Applications in engineering, technology and management
    • Place of Presentation
      Luoyang, China
    • Year and Date
      2015-08-21
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] Testing Full Outer-2-Planarity in Linear Time2015

    • Author(s)
      Seok-Hee Hong, Hiroshi Nagamochi
    • Organizer
      41st International Workshop on Graph-Theoretic Concepts in Computer Science
    • Place of Presentation
      Garching, Germany
    • Year and Date
      2015-06-17
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs2015

    • Author(s)
      N. Md Yunos, A. Shurbevski, H. Nagamochi
    • Organizer
      The 18th Japan Conference on Discrete and Computational Geometry and Graphs
    • Place of Presentation
      京都大学(京都府京都市)
    • Year and Date
      2015-09-14
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs2015

    • Author(s)
      N. Md Yunos, A. Shurbevski, H. Nagamochi
    • Organizer
      The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management
    • Place of Presentation
      Luoyang, China
    • Year and Date
      2015-08-21
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] Packing for robot motion planning2014

    • Author(s)
      Y Aleksandar Shurbevski and Hiroshi Nagamochi
    • Organizer
      11th ESICUP Meeting
    • Place of Presentation
      China
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Packing for robot motion planning2014

    • Author(s)
      Y Aleksandar Shurbevski and Hiroshi Nagamochi
    • Organizer
      In 11th ESICUP Meeting
    • Place of Presentation
      China
    • Year and Date
      2014-03-20
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure2013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The 10th annual conference on Theory and Applications of Models of Computation
    • Place of Presentation
      Hong Kong, China
    • Year and Date
      2013-05-20
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] An improved exact algorithm for undirected feedback vertex set2013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA'13)
    • Place of Presentation
      Chengdu, China
    • Year and Date
      2013-12-12
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] An improved exact algorithm for undirected feedback vertex set2013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA'13)
    • Place of Presentation
      China
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Optimization techniques for robot path planning2013

    • Author(s)
      A. Shurbevski, N. Hirosue, H. Nagamochi
    • Organizer
      The 5th ICT Innovations Conference
    • Place of Presentation
      Ohrid, Macedonia
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Breadth first search approach to enumeration of tree-like chemical compounds2013

    • Author(s)
      Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya Akutsu
    • Organizer
      The 24th International Conference on Genome Informatics
    • Place of Presentation
      Matrix, Biopolis, Singapore
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] The repetitive routing problem revisited: a new constant factor approximation algorithm for an asymmetric cost function case2013

    • Author(s)
      A. Shurbevski, H. Nagamochi, Y. Karuno
    • Organizer
      the 11th International Conference on Electronics, Telecommunications, Automation, and Informatics
    • Place of Presentation
      Macedonia
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure2013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The 10th annual conference on Theory and Applications of Models of Computation Hong Kong
    • Place of Presentation
      China
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] An exact algorithm for maximum independent set in degree-5 graphs2013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The Seventh International Frontiers of Algorithmics Workshop
    • Place of Presentation
      Dalian, China
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] An exact algorithm for maximum independent set2013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The 24thInternational Symposium on Algorithms and Computation
    • Place of Presentation
      Hong Kong
    • Year and Date
      2013-12-17
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] The repetitive routing problem revisited : a new constant factor approximation algorithm for an asymmetric cost function case2013

    • Author(s)
      A. Shurbevski, H. Nagamochi , Y. Karuno
    • Organizer
      the 11th International Conference on Electronics, Telecommunications, Automation, and Informatics - ETAI 2013
    • Place of Presentation
      Ohrid, Macedonia
    • Year and Date
      2013-09-26
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Optimization techniques for robot path planning2013

    • Author(s)
      A. Shurbevski, N. Hirosue, H. Nagamochi
    • Organizer
      The 5th ICT Innovations Conference
    • Place of Presentation
      Macedonia
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] An exact algorithm for maximum independent set in degree-5 graphs2013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The Seventh International Frontiers of Algorithmics Workshop Dalian
    • Place of Presentation
      China
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] An exact algorithm for maximum independent set2013

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The 24thInternational Symposium on Algorithms and Computation
    • Place of Presentation
      China
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] The next-to-shortest path in undirected graphs with nonnegative weights2012

    • Author(s)
      C. Zhang, H. Nagamochi
    • Organizer
      In Proc. Computing: The Australasian Theory Symposium
    • Place of Presentation
      RMIT University , Australia
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Linear Layouts in Submodular Systems2012

    • Author(s)
      H. Nagamochi
    • Organizer
      the 23rd International Symposium on Algorithms and Computation (ISAAC 2012)
    • Place of Presentation
      Taiwan
    • Year and Date
      2012-12-21
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Linear Layouts in Submodular Systems2012

    • Author(s)
      H. Nagamochi
    • Organizer
      the 23rd International Symposium on Algorithms and Computation (ISAAC2012)
    • Place of Presentation
      Taipei ,Taiwan
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Submodular minimization via pathwidth2012

    • Author(s)
      H. Nagamochi
    • Organizer
      9th annual conference on Theory and Applications of Models of Computation (TAMC2012)
    • Place of Presentation
      Beijing, China
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Characterizing mechanisms in obnoxious facility game2012

    • Author(s)
      K. Ibara, H. Nagamochi
    • Organizer
      The 6th Annual International Conference on Combinatorial Optimization and Applications (COCOA'12)
    • Place of Presentation
      Banff, Canada
    • Year and Date
      2012-08-09
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] パス頻度の上下限制約を満たす木状化合物の二段階列挙法2012

    • Author(s)
      鈴木政喜, 永持仁, 阿久津達也
    • Organizer
      情報処理学会・第28回バイオ情報学研究会
    • Place of Presentation
      東北大学
    • Year and Date
      2012-03-29
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] A method for computing the pathwidth of chemical graphs2012

    • Author(s)
      M. Ikeda, H. Nagamochi
    • Organizer
      The 15th Japan-Korea Joint Workshop on Algorithms and Computation
    • Place of Presentation
      Tokyo, Japan
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] 上下限パス頻度に基づいた環構造を一つ持つ化合物の列挙法2012

    • Author(s)
      鈴木政喜, 永持仁, 阿久津達也
    • Organizer
      第35回情報化学討論会
    • Place of Presentation
      広島大学
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] A refined exact algorithm for edge dominating set2012

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      9th annual conference on Theory and Applications of Models of Computation (TAMC2012)
    • Place of Presentation
      Beijing, China
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] An improved exact algorithm for TSP in degree-4 graphs2012

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The 18th International Computing and Combinatorics Conference (COCOON'2012)
    • Place of Presentation
      Sydney, Australia
    • Year and Date
      2012-08-20
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Enumerating chemical graphs of 1-tree structure from given upper and lower bounds on path frequencies2012

    • Author(s)
      Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu
    • Organizer
      23rd International Conference on Genome Informatics
    • Place of Presentation
      National Cheng Kung University, Tainan, Taiwan
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] The next-to-shortest path in undirected graphs with nonnegative weights2012

    • Author(s)
      C. Zhang, H. Nagamochi
    • Organizer
      Proc. Computing : The Australasian Theory Symposium (CATS 2012)
    • Place of Presentation
      Melbourne, Australia
    • Year and Date
      2012-02-01
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Improved approximation ratio algorithms for grasp-and-delivery robot routing problems2012

    • Author(s)
      A. Shurbevski, H. Nagamochi , Y. Karuno
    • Organizer
      The 15th Japan-Korea Joint Workshop on Algorithms and Computation
    • Place of Presentation
      Tokyo, Japan
    • Year and Date
      2012-07-10
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Improved bounds for minimum fault-tolerant gossip graphs2011

    • Author(s)
      T. Hasunuma, H. Nagamochi
    • Organizer
      37th International Workshop on Graph-Theoretic Concepts in Computer Science
    • Place of Presentation
      Premonstrate Monastery in Tepla, Czech Republic
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Improved implementation of an approximation algorithm with factor two for a cyclic routing problem of grasp-and-delivery robots2011

    • Author(s)
      A. Shurbevski, Y. Karuno, H. Nagamochi
    • Organizer
      International Symposium on Scheduling 2011
    • Place of Presentation
      Osaka
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Approximating cyclic routing problems of grasp-and-delivery robots in production of printed circuit boards2011

    • Author(s)
      Y. Karuno, H. Nagamochi, A. Shurbevski
    • Organizer
      International Symposium on Scheduling 2011 (ISS2011)
    • Place of Presentation
      Osaka Univ.
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies2011

    • Author(s)
      M.Shimizu, H.Nagamochi, T.Akutsu
    • Organizer
      The 22nd International Conference on Genome Informatics
    • Place of Presentation
      Haeundae Grand Hotel, Busan, Korea
    • Year and Date
      2011-12-05
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] Approximating cyclic routing problems of grasp-and-delivery robots in production of printed circuit boards2011

    • Author(s)
      Y. Karuno, H. Nagamochi , A. Shurbevski
    • Organizer
      International Symposium on Scheduling 2011
    • Place of Presentation
      Osaka
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Network transformation heuristics for multi-story storage rack problems2011

    • Author(s)
      Y. Karuno, H. Nagamochi
    • Organizer
      International Symposium on Scheduling 2011 (ISS2011)
    • Place of Presentation
      Osaka Univ.
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Parameterized edge dominating set in cubic graphs,2011

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      the Fifth International Frontiers of Algorithmics Workshop (FAW 2011) and The Seventh International Conference on Algorithmic Aspects of Information and Management (AAIM 2011)
    • Place of Presentation
      Zhejiang Normal University,china
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Improved bounds for minimum fault-tolerant gossip graphs2011

    • Author(s)
      T. Hasunuma, H. Nagamochi
    • Organizer
      37th International Workshop on Graph-Theoretic Concepts in Computer Science
    • Place of Presentation
      Czechoslovakia
    • Year and Date
      2011-06-21
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Improved implementation of an approximation algorithm with factor two for a cyclic routing problem of grasp-and-delivery robots2011

    • Author(s)
      A. Shurbevski, Y. Karuno, H. Nagamochi
    • Organizer
      International Symposium on Scheduling 2011 (ISS2011)
    • Place of Presentation
      Osaka Univ.
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Heuristics for a repetitive routing problem of a single grasp-and-delivery robot with an asymmetric edge cost function,2011

    • Author(s)
      A. Shurbevski, H. Nagamochi, Y. Karuno
    • Organizer
      The 10th International Conference on Electronics, Telecommunications, Automation, and Informatics
    • Place of Presentation
      Metropol Hotel, Macedonia
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Parameterized edge dominating set in cubic graphs2011

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      the Fifth International Frontiers of Algorithmics Workshop and The Seventh International Conference on Algorithmic Aspects of Information and Management
    • Place of Presentation
      China
    • Year and Date
      2011-05-30
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] 上下限付きパス頻度に基づく木状化合物の列挙2011

    • Author(s)
      清水雅章, 永持仁, 阿久津達也
    • Organizer
      情報処理学会バイオ情報学研究会
    • Place of Presentation
      京都大学化学研究所
    • Year and Date
      2011-03-10
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] Further improvement on maximum independent set in degree-4 graphs2011

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA'11)
    • Place of Presentation
      QingHe Jin Jiang International Hotel,chana
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Further improvement on maximum independent set in degree-4 graphs2011

    • Author(s)
      M. Xiao, H. Nagamochi
    • Organizer
      The 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA'11)
    • Place of Presentation
      Zhangjiajie, China
    • Year and Date
      2011-08-04
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Network transformation heuristics for multi-story storage rack problems2011

    • Author(s)
      Y. Karuno, H. Nagamochi
    • Organizer
      International Symposium on Scheduling 2011
    • Place of Presentation
      Osaka
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Heuristics for a repetitive routing problem of a single grasp-and-delivery robot with an asymmetric edge cost function2011

    • Author(s)
      A. Shurbevski, H. Nagamochi , Y. Karuno
    • Organizer
      The 10th International Conference on Electronics, Telecommunications, Automation, and Informatics - ETAI 2011
    • Place of Presentation
      Ohrid, Macedonia
    • Data Source
      KAKENHI-PROJECT-23500015
  • [Presentation] Multiclass visual classifier based on bipartite graph representation of decision tables2010

    • Author(s)
      K.Haraguchi, S.-H.Hong, H.Nagamochi
    • Organizer
      Learning and Intelligent OptimizatioN Conference (LION 4)
    • Place of Presentation
      Venice, Italy
    • Year and Date
      2010-01-18
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] 枝交差数最小化に基づいた視覚的分類器の構成2010

    • Author(s)
      原口和也, Seok-Hee Hong, 永持仁
    • Organizer
      京都大学数理解析研究所研究集会「最適化モデルとアルゴリズムの新展開」
    • Place of Presentation
      京都大学
    • Year and Date
      2010-07-22
    • Data Source
      KAKENHI-PROJECT-22700015
  • [Presentation] Heuristics for scheduling problems on identical machines like storage allocation2010

    • Author(s)
      Y.Karuno, H.Nagamochi, A.Nakashima, K.Yamashita
    • Organizer
      IEEE INDIN 2010
    • Place of Presentation
      Osaka, Japan
    • Year and Date
      2010-07-13
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Effectiveness of sample posed based visual classifier for data sets conceptualized by the number of attributes2010

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
    • Organizer
      WAAC 2010
    • Place of Presentation
      金沢市文化ホール
    • Year and Date
      2010-07-23
    • Data Source
      KAKENHI-PROJECT-22700015
  • [Presentation] Listing triconnected rooted plane graphs2010

    • Author(s)
      B.Zhuang, H.Nagamochi
    • Organizer
      Combinatorial Optimization and Applications-4th International Conference, COCOA 2010
    • Place of Presentation
      Kailua-Kona, HI, USA
    • Year and Date
      2010-12-18
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] An algorithm framework for the time-dependent point-to-point shortest path problem2010

    • Author(s)
      T.Ohshima, P.Eumthurapojn, L.Zhao, H.Nagamochi
    • Organizer
      The China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010, Dalian)
    • Place of Presentation
      Dalian, China
    • Year and Date
      2010-11-03
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Efficient generation of symmetric and asymmetric biconnected rooted outerplanar graphs2010

    • Author(s)
      B.Zhuang, H.Nagamochi
    • Organizer
      The 3rd Annual Meeting of Asian Association for Algorithms and Computation (AAAC)
    • Place of Presentation
      POSTECH, Pohang, Korea
    • Year and Date
      2010-04-17
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] FPTAS's for some cut problems in weighted trees2010

    • Author(s)
      M.Xiao, T.Fukunaga, H.Nagamochi
    • Organizer
      The 4th International Frontiers of Algorithmics Workshop (FAW 2010)
    • Place of Presentation
      at Wuhan, University, Wuhan, China
    • Year and Date
      2010-08-11
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Learning Classifier by Edge Crossing Minimization2010

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
    • Organizer
      Int'l workshop on Multi-dimensional Visualization
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Presentation] Constant time generation of trees with degree bounds2010

    • Author(s)
      B.Zhuang, H.Nagamochi
    • Organizer
      the 9th International Symposium on Operations Research and Its Applications (ISORA 2010)
    • Place of Presentation
      Chengdu, China
    • Year and Date
      2010-08-19
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] Approximation algorithms for a cyclic routing problem of grasp-and-delivery robots, SCIS and ISIS 20102010

    • Author(s)
      Y.Karuno, H.Nagamochi, A.Shurbevski
    • Organizer
      Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems
    • Place of Presentation
      Okayama
    • Year and Date
      2010-12-12
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Multiclass visual classifier based on bipartite2010

    • Author(s)
      K.Haraguchi, S.-H.Hong, H.Nagamochi
    • Organizer
      graph representation of decision tables, Learning and Intelligent OptimizatioN Conference (LION 4)
    • Place of Presentation
      Venice, Italy
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Generating internally triconnected rooted plane graphs2010

    • Author(s)
      B.Zhuang, H.Nagamochi
    • Organizer
      Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010
    • Place of Presentation
      Prague, Czech Republic
    • Year and Date
      2010-06-07
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] Constant time generation of biconnected rooted plane graphs2010

    • Author(s)
      B.Zhuang, H.Nagamochi
    • Organizer
      Frontiers in Algorithmics, 4th International Workshop, FAW 2010
    • Place of Presentation
      Wuhan, China
    • Year and Date
      2010-08-11
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] Enumerating rooted graphs with reflectional block structures2010

    • Author(s)
      B.Zhuang, H.Nagamochi
    • Organizer
      Algorithms and Complexity, 7th International Conference, CIAC 2010
    • Place of Presentation
      Rome, Italy
    • Year and Date
      2010-05-26
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] Generating trees on multisets2010

    • Author(s)
      B.Zhuang, H.Nagamochi
    • Organizer
      Algorithms and Computation-21st International Symposium, ISAAC 2010
    • Place of Presentation
      Jeju Island, Korea
    • Year and Date
      2010-12-15
    • Data Source
      KAKENHI-PROJECT-22240009
  • [Presentation] Network design with weighted degree constraints2009

    • Author(s)
      T.Fukunaga, H.Nagamochi
    • Organizer
      Third Annual Workshop on Algorithms and Computation (WALCOM 2009)
    • Place of Presentation
      Indian Statistical Institute, Kolkata, India
    • Year and Date
      2009-02-18
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Enumeratingcolored and rooted outerplanar graphs,情報処理学会2009

    • Author(s)
      J.Wang, H.Nagamochi
    • Organizer
      第129回アルゴリズム研究会
    • Place of Presentation
      東芝科学館(東京)
    • Year and Date
      2009-03-05
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Presentation] Enumerating stereoisomers of tree structured molecules using dynanic programming2009

    • Author(s)
      T.Imada, S.Ota, H.Nagamochi, T.Akutsu
    • Organizer
      20th International Symposium on Algorithms and Computation(ISAAC 2009)
    • Place of Presentation
      Ala Moana Hotel, Hawaii, USA
    • Year and Date
      2009-12-16
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Presentation] Visualized Multiple Decision Table Classifiers without Discretization2009

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
    • Organizer
      4th Korea-Japan Workshop on Operations Research in Service Science
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Presentation] Upward star-shaped polyhedral graphs2009

    • Author(s)
      S.-H.Hong, H.Nagamochi
    • Organizer
      The 20th International Symposium on Algorithms and Computation (ISAAC 2009), 913-922
    • Place of Presentation
      in Hawaii, USA,
    • Year and Date
      2009-12-16
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Efficient branch-and-bound algorithms for one-dimensional contiguous bin packing problem and two-dimensional strip packing problem2009

    • Author(s)
      T.Imamichi, Y.Arahori, H.Nagamochi
    • Organizer
      The 6th ESICUP Meeting
    • Place of Presentation
      Valencia, Spain.
    • Year and Date
      2009-03-26
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Bipartite graph representation of multiple decision table classifiers, Fifth Symposium on Stochastic Algorithms2009

    • Author(s)
      K.Haraguchi, S.-H.Hong, H.Nagamochi
    • Organizer
      Foundations and Applications (SAGA 2009)
    • Place of Presentation
      Sapporo, Japan
    • Year and Date
      2009-10-26
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] One-dimensional cutting stock problem for a paper tube industry2009

    • Author(s)
      S.Umetani, K.Matsumoto, H.Nagamochi
    • Organizer
      The 6th ESICUP Meeting
    • Place of Presentation
      Valencia, Spain.
    • Year and Date
      2009-03-26
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Toward characterization of vertex-edge graphs of three-dimensional nonconvex polyhedra2009

    • Author(s)
      S.-H.Hong, H.Nagamochi
    • Organizer
      6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      in Budapest, Hungary
    • Year and Date
      2009-05-16
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Visualization can improve multiple decision table classifiers2009

    • Author(s)
      K.Haraguchi, S.-H.Hong, H.Nagamochi
    • Organizer
      The 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI 2009)
    • Place of Presentation
      Awaji Island, Japan.
    • Year and Date
      2009-11-30
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Enumerating stereoisomers of tree structured molecules using dynamic programming2009

    • Author(s)
      T.Imada, S.Ota, H.Nagamochi, T.Akutsu
    • Organizer
      20th International Symposium on Algorithms and Computation
    • Place of Presentation
      Hawaii, USA
    • Year and Date
      2009-12-16
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Presentation] Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems2009

    • Author(s)
      K.Okumoto, T.Fukunaga, H.Nagamochi
    • Organizer
      The 20th International Symposium on Algorithms and Computation (ISAAC 2009)
    • Place of Presentation
      in Hawaii, USA
    • Year and Date
      2009-12-16
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Efficient approximate algorithms for the beacon placement and its dual problem2009

    • Author(s)
      J.Wang, J.Gim, M.Sasaki, L.Zhao, H.Nagamochi
    • Organizer
      Korea-Japan Joint Workshop on Algorithms and Computation, Kookmin University in Seoul
    • Place of Presentation
      Korea
    • Year and Date
      2009-07-04
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Minmax tree cover in the Euclidean space2009

    • Author(s)
      S.Karakawa, E.Morsy, H.Nagamochi
    • Organizer
      Third Annual Workshop on Algorithms and Computation (WALCOM 2009)
    • Place of Presentation
      Indian Statistical Institute, Kolkata, India
    • Year and Date
      2009-02-18
    • Data Source
      KAKENHI-PROJECT-20500012
  • [Presentation] Improved algorithms for enumerating tree-like chemical graphs with given path frequency2008

    • Author(s)
      Y. Ishida, L. Zhao, H. Nagamochi, T. Akutsu
    • Organizer
      The 19th Int. Conference on Genome Informatics
    • Place of Presentation
      Gold Coast, Australia
    • Year and Date
      2008-12-01
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Presentation] Improved algorithms for enumerating tree-like chemical graphs with given path frequency2008

    • Author(s)
      Y.Ishida, L.Zhao, H.Nagamochi, T.Akutsu
    • Organizer
      The 19th Int.Conference on Genome Informatics
    • Place of Presentation
      Gold Coast, Australia
    • Year and Date
      2008-12-01
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Presentation] Classification by Ordering Data Samples2008

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
    • Organizer
      Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems (AVCEP08)
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Presentation] Classification by Ordering Data Samples2008

    • Author(s)
      Kazuya Haraguchi, Seok-Hee Hone, Hiroshi Nagamochi
    • Organizer
      Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems
    • Place of Presentation
      京都大学数理解析研究所
    • Year and Date
      2008-09-29
    • Data Source
      KAKENHI-PROJECT-20800045
  • [Presentation] An efficient algorithm for generating colored outerplanar graphs2007

    • Author(s)
      W. Jiexun, Z. Liang, H. Nagamochi and T. Akutsu
    • Organizer
      The 4th Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      Shanghai, China
    • Year and Date
      2007-05-25
    • Data Source
      KAKENHI-PROJECT-19200022
  • [Presentation] Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs.

    • Author(s)
      Seok-Hee Hong, Hiroshi Nagamochi
    • Organizer
      COCOON 2014
    • Place of Presentation
      Atlanta, Georgia, USA
    • Year and Date
      2014-08-04 – 2014-08-06
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] An Improved Algorithm for Parameterized Edge Dominating Set Problem

    • Author(s)
      Ken Iwaide, Hiroshi Nagamochi
    • Organizer
      WALCOM 2015
    • Place of Presentation
      Uttara, Dhaka,Bangladesh
    • Year and Date
      2015-02-26 – 2015-02-28
    • Data Source
      KAKENHI-PROJECT-26330012
  • [Presentation] Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs

    • Author(s)
      Mingyu Xiao, Hiroshi Nagamochi
    • Organizer
      ISAAC 2014
    • Place of Presentation
      Jeonju, Korea
    • Year and Date
      2014-12-15 – 2014-12-17
    • Data Source
      KAKENHI-PROJECT-26330012
  • 1.  IBARAKI Toshihide (50026192)
    # of Collaborated Projects: 7 results
    # of Collaborated Products: 0 results
  • 2.  FUKUSHIMA Masao (30089114)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 0 results
  • 3.  AKUTSU Tatsuya (90261859)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 40 results
  • 4.  MASUYAMA Shigeru (60173762)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 0 results
  • 5.  YAGIURA M. (10263120)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 0 results
  • 6.  ZHAO Liang (90344902)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 2 results
  • 7.  HAYASHIDA Morihiro (40402929)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 5 results
  • 8.  HARAGUCHI Kazuya (80453356)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 15 results
  • 9.  OHNISHI Masamitsu (10160566)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 10.  細川 浩 (90359779)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 11.  KAMEDA Tiko
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 12.  KARUNO Yoshiyuki (80252542)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 8 results
  • 13.  KAWABATA Takeo (50214680)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 14.  FUKUNAGA Takuro (60452314)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 7 results
  • 15.  IBARAKI Satoru (10252488)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 16.  ISHII Toshimasa (30324487)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 8 results
  • 17.  Shurbevski A (70750230)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 30 results
  • 18.  BIOCH Jan C
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 19.  EITER Thomas
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 20.  BOROS Endre
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 21.  ART LIESTMAN
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 22.  SLOWOMIR PIL
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 23.  TIKO KAMEDA
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 24.  LIESTMAN Art
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 25.  UNO Yushi (60244670)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 3 results
  • 26.  YAMAZAKI Koichi (00246662)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 27.  MAEGAWA shingo (30467401)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 28.  YAMASHITA Masahumi (00135419)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 29.  KATOH Naoki (40145826)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 30.  MAKINO Kazuhisa (60294162)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 31.  HASUNUMA Toru (30313406)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 32.  KAMIDOI Yoko (80264935)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 33.  KARZANOV Alexander
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 34.  KOGAN Alexander
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 35.  HAMMER Peter
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 36.  YVES CRAMA
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 37.  ALEXANDER V.
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 38.  KARZANOV Alexander V.
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 39.  HELL Pavol
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 40.  PILARSKI Slowomir
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 41.  CRAMA Yves
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 42.  POVOL Hell
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 43.  BIOCH JauC
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 44.  PILARSKI Slo
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 45.  HELL Povol
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 46.  AZAM NAVEED AHMED
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 9 results
  • 47.  梅谷 俊治
    # 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