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

HANAKA Tesshu  土中 哲秀

ORCIDConnect your ORCID iD *help
… Alternative Names

Hanaka Tesshu  土中 哲秀

Less
Researcher Number 30824982
Other IDs
Affiliation (Current) 2025: 九州大学, システム情報科学研究院, 准教授
Affiliation (based on the past Project Information) *help 2021 – 2025: 九州大学, システム情報科学研究院, 准教授
2020 – 2021: 名古屋大学, 情報学研究科, 助教
2018 – 2019: 中央大学, 理工学部, 助教
Review Section/Research Field
Principal Investigator
Transformative Research Areas, Section (IV) / Basic Section 60010:Theory of informatics-related / Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related / Basic Section 60020:Mathematical informatics-related / 1001:Information science, computer engineering, and related fields
Except Principal Investigator
Medium-sized Section 64:Environmental conservation measure and related fields / Medium-sized Section 60:Information science, computer engineering, and related fields
Keywords
Principal Investigator
グラフアルゴリズム / アルゴリズム的ゲーム理論 / 計算複雑性 / パラメータ化アルゴリズム / ナッシュ均衡 / 固定パラメータ容易性 / 近似アルゴリズム / 組合せ最適化 / グラフパラメータ / 安定解 … More / グラフ最適化 / パラメータ化近似アルゴリズム / グラフ最適化問題 / 有向グラフ / 重み付きグラフ … More
Except Principal Investigator
保全優先度 / MRIO / MRI0 / 種 / ゲノム / 農業 / 生物多様性 / ゲノム情報 / サプライチェーン / PSPACE完全 / 近似アルゴリズム / パラメータ化計算量 / 多項式階層 / グラフ最適化 / 局所構造 / パラメータ化アルゴリズム / 均衡計算 / 組合せ最適化 / アルゴリズム Less
  • Research Projects

    (7 results)
  • Research Products

    (151 results)
  • Co-Researchers

    (13 People)
  •  超高速高精度パラメータ化アルゴリズム:グラフ最適化における計算限界の打破Principal Investigator

    • Principal Investigator
      土中 哲秀
    • Project Period (FY)
      2025 – 2029
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Review Section
      Basic Section 60010:Theory of informatics-related
      Basic Section 60020:Mathematical informatics-related
      Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related
    • Research Institution
      Kyushu University
  •  効用関数付きグラフ最適化問題に対する計算量解析のさらなる発展Principal Investigator

    • Principal Investigator
      土中 哲秀
    • Project Period (FY)
      2023 – 2024
    • Research Category
      Grant-in-Aid for Transformative Research Areas (A)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      Kyushu University
  •  超スマート社会時代のアルゴリズム工学 - パラメータ化近似均衡計算

    • Principal Investigator
      小野 廣隆
    • Project Period (FY)
      2022 – 2026
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Nagoya University
  •  グラフ最適化問題に対する高速高精度アルゴリズムの開発Principal Investigator

    • Principal Investigator
      土中 哲秀
    • Project Period (FY)
      2021 – 2024
    • Research Category
      Grant-in-Aid for Early-Career Scientists
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Kyushu University
      Nagoya University
  •  A Study on Algorithms for Graph Optimization Problems with Utility FunctionsPrincipal Investigator

    • Principal Investigator
      土中 哲秀
    • Project Period (FY)
      2021 – 2022
    • Research Category
      Grant-in-Aid for Transformative Research Areas (A)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      Kyushu University
  •  Mapping Agricultural and Medicinal Resource Conflicts for Biodiversity Conservation

    • Principal Investigator
      Kanemoto Keiichiro
    • Project Period (FY)
      2020 – 2023
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 64:Environmental conservation measure and related fields
    • Research Institution
      Research Institute for Humanity and Nature
  •  Designing Parameterized and Approximation Algorithms for weighted and directed graphsPrincipal Investigator

    • Principal Investigator
      Hanaka Tesshu
    • Project Period (FY)
      2018 – 2021
    • Research Category
      Grant-in-Aid for Research Activity Start-up
    • Review Section
      1001:Information science, computer engineering, and related fields
    • Research Institution
      Nagoya University
      Chuo University

All 2024 2023 2022 2021 2020 2019 2018

All Journal Article Presentation

  • [Journal Article] Winner Determination Algorithms for Graph Games with Matching Structures2024

    • Author(s)
      Hanaka Tesshu、Kiya Hironori、Ono Hirotaka、Yoshiwatari Kanae
    • Journal Title

      Algorithmica

      Volume: 86(3) Issue: 3 Pages: 808-824

    • DOI

      10.1007/s00453-023-01136-w

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K21283, KAKENHI-PUBLICLY-21H05852
  • [Journal Article] Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP2024

    • Author(s)
      Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
    • Journal Title

      International Journal of Networking and Computing

      Volume: 14 Pages: 26-39

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Journal Article] On a Spectral Lower Bound of Treewidth2024

    • Author(s)
      GIMA Tatsuya、HANAKA Tesshu、NORO Kohei、ONO Hirotaka、OTACHI Yota
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E107.D Issue: 3 Pages: 328-330

    • DOI

      10.1587/transinf.2023FCL0002

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2024-03-01
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793
  • [Journal Article] On the Complexity of List $$\mathcal H$$-Packing for Sparse Graph Classes2024

    • Author(s)
      Gima Tatsuya、Hanaka Tesshu、Kobayashi Yasuaki、Otachi Yota、Shirai Tomohito、Suzuki Akira、Tamura Yuma、Zhou Xiao
    • Journal Title

      Proceedings of the 18th International Conference and Workshop on Algorithms and Computation (WALCOM 2024)

      Volume: 14549 Pages: 421-435

    • DOI

      10.1007/978-981-97-0566-5_30

    • ISBN
      9789819705658, 9789819705665
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-21K21278, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-23K28034
  • [Journal Article] Structural Parameterizations of Vertex Integrity2024

    • Author(s)
      Gima Tatsuya、Hanaka Tesshu、Kobayashi Yasuaki、Murai Ryota、Ono Hirotaka、Otachi Yota
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 14549 Pages: 406-420

    • DOI

      10.1007/978-981-97-0566-5_29

    • ISBN
      9789819705658, 9789819705665
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-23K28034
  • [Journal Article] Grouped domination parameterized by vertex cover, twin cover, and beyond2024

    • Author(s)
      Hanaka Tesshu、Ono Hirotaka、Otachi Yota、Uda Saeki
    • Journal Title

      Theoretical Computer Science

      Volume: 996 Pages: 114507-114507

    • DOI

      10.1016/j.tcs.2024.114507

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Journal Article] Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond2023

    • Author(s)
      Hanaka Tesshu、Ono Hirotaka、Otachi Yota、Uda Saeki
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 13898 Pages: 263-277

    • DOI

      10.1007/978-3-031-30448-4_19

    • ISBN
      9783031304477, 9783031304484
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-21K11752
  • [Journal Article] A framework to design approximation algorithms for finding diverse solutions in combinatorial problems2023

    • Author(s)
      Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Journal Title

      Proc. of 37th AAAI Conference on Artificial Intelligence (AAAI 2023), AAAI-23 Technical Tracks 4

      Volume: 37 Issue: 4 Pages: 3968-3976

    • DOI

      10.1609/aaai.v37i4.25511

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-22H00513
  • [Journal Article] New Results on Directed Edge Dominating Set2023

    • Author(s)
      Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
    • Journal Title

      Discrete Mathematics & Theoretical Computer Science

      Volume: vol. 25:1

    • DOI

      10.46298/dmtcs.5378

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Journal Article] A framework to design approximation algorithms for finding diverse solutions in combinatorial problems2023

    • Author(s)
      Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Journal Title

      Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023)

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Journal Article] Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP<sup>*</sup>2023

    • Author(s)
      Hanaka Tesshu、Ono Hirotaka、Sugiyama Kosuke
    • Journal Title

      IEEE International Parallel and Distributed Processing Symposium, IPDPS 2023 - Workshops

      Volume: - Pages: 308-313

    • DOI

      10.1109/ipdpsw59300.2023.00059

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17707
  • [Journal Article] Shortest Beer Path Queries based on Graph Decomposition2023

    • Author(s)
      Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane and Kosuke Sugiyama
    • Journal Title

      Proceedings of the34th International Symposium on Algorithms and Computation (ISAAC 2023)

      Volume: 283

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Journal Article] Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study2022

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
    • Journal Title

      Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022)

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Journal Article] Capacitated Network Design Games on a Generalized Fair Allocation Model2022

    • Author(s)
      Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
    • Journal Title

      Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022)

      Volume: - Pages: 1616-1617

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Journal Article] Computing L(p,1)-Labeling with Combined Parameters2022

    • Author(s)
      Tesshu Hanaka,?Kazuma Kawai, and?Hirotaka Ono
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 26(2) Issue: 2 Pages: 241-255

    • DOI

      10.7155/jgaa.00592

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17707, KAKENHI-PLANNED-20H05967, KAKENHI-PROJECT-22H00513
  • [Journal Article] Capacitated Network Design Games on a Generalized Fair Allocation Model.2022

    • Author(s)
      Tesshu Hanaka,Toshiyuki Hirose,Hirotaka Ono
    • Journal Title

      21st International Conference on Autonomous Agents and Multiagent Systems(AAMAS)

      Volume: - Pages: 1616-1617

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-22H00513
  • [Journal Article] (In)approximability of maximum minimal FVS2022

    • Author(s)
      Dublois Louis、Hanaka Tesshu、Khosravian Ghadikolaei Mehdi、Lampis Michael、Melissinos Nikolaos
    • Journal Title

      Journal of Computer and System Sciences

      Volume: 124 Pages: 26-40

    • DOI

      10.1016/j.jcss.2021.09.001

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-21K17707
  • [Journal Article] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion2022

    • Author(s)
      Aoike Yuuki、Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Kurita Kazuhiro、Otachi Yota
    • Journal Title

      Theory of Computing Systems

      Volume: 66 Issue: 2 Pages: 502-515

    • DOI

      10.1007/s00224-022-10076-x

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05962, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Hedonic Games and Treewidth Revisited2022

    • Author(s)
      Tesshu Hanaka, Michael Lampis
    • Journal Title

      Proceedings of the 30th Annual European Symposium on Algorithms (ESA 2022), Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: 244

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Journal Article] Exploring the gap between treedepth and vertex cover through vertex integrity2022

    • Author(s)
      Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Otachi Yota
    • Journal Title

      Theoretical Computer Science

      Volume: 918 Pages: 60-76

    • DOI

      10.1016/j.tcs.2022.03.021

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K19742
  • [Journal Article] Winner Determination Algorithms for Graph Games with Matching Structures2022

    • Author(s)
      Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono
    • Journal Title

      Combinatorial Algorithms - 33rd International Workshop, (IWOCA 2022), Lecture Notes in Computer Science

      Volume: 13270 Pages: 509-522

    • DOI

      10.1007/978-3-031-06678-8_37

    • ISBN
      9783031066771, 9783031066788
    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-20H05967, KAKENHI-PUBLICLY-21H05852, KAKENHI-PROJECT-22H00513
  • [Journal Article] The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality2022

    • Author(s)
      Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
    • Journal Title

      Discrete Applied Mathematics

      Volume: 321 Pages: 281-294

    • DOI

      10.1016/j.dam.2022.04.025

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-17K19960, KAKENHI-PROJECT-17H01698, KAKENHI-PLANNED-20H05967, KAKENHI-PROJECT-22H00513
  • [Journal Article] Computing densest k-subgraph with structural parameters2022

    • Author(s)
      Tesshu Hanaka
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 45 Issue: 1 Pages: 1-17

    • DOI

      10.1007/s10878-022-00927-1

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Journal Article] Finding a maximum minimal separator: Graph classes and fixed-parameter tractability2021

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
    • Journal Title

      Theoretical Computer Science

      Volume: 865 Pages: 131-140

    • DOI

      10.1016/j.tcs.2021.03.006

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Parameterized Complexity of $$(A,\ell )$$-Path Packing2021

    • Author(s)
      Belmonte Remy、Hanaka Tesshu、Kanzaki Masaaki、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Lampis Michael、Ono Hirotaka、Otachi Yota
    • Journal Title

      Algorithmica

      Volume: 84 Issue: 4 Pages: 871-895

    • DOI

      10.1007/s00453-021-00875-y

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PLANNED-20H05967, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Complexity and approximability of the happy set problem2021

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
    • Journal Title

      Theoretical Computer Science

      Volume: 866 Pages: 123-144

    • DOI

      10.1016/j.tcs.2021.03.023

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-21K11755
  • [Journal Article] Finding diverse trees, paths, and more2021

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Journal Title

      Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021)

      Volume: 35 Pages: 3778-3786

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Journal Article] Computing the Largest Bond and the Maximum Connected Cut of a Graph2021

    • Author(s)
      Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Ueverton S. Souza
    • Journal Title

      Algorithmica

      Volume: 83 Issue: 5 Pages: 1421-1458

    • DOI

      10.1007/s00453-020-00789-1

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05795
  • [Journal Article] A (probably) optimal algorithm for Bisection on bounded-treewidth graphs2021

    • Author(s)
      Hanaka Tesshu、Kobayashi Yasuaki、Sone Taiga
    • Journal Title

      Theoretical Computer Science

      Volume: 873 Pages: 38-46

    • DOI

      10.1016/j.tcs.2021.04.023

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793
  • [Journal Article] Parameterized algorithms for the Happy Set problem2021

    • Author(s)
      Asahiro Yuichi、Eto Hiroshi、Hanaka Tesshu、Lin Guohui、Miyano Eiji、Terabaru Ippei
    • Journal Title

      Discrete Applied Mathematics

      Volume: 304 Pages: 32-44

    • DOI

      10.1016/j.dam.2021.07.005

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-21K11755
  • [Journal Article] Computing L(p,1)-Labeling with Combined Parameters2021

    • Author(s)
      Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
    • Journal Title

      Proceedings of the 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021)

      Volume: 12635 Pages: 208-220

    • DOI

      10.1007/978-3-030-68211-8_17

    • ISBN
      9783030682101, 9783030682118
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PLANNED-20H05967, KAKENHI-PROJECT-17H01698
  • [Journal Article] Reconfiguring spanning and induced subgraphs2020

    • Author(s)
      Hanaka Tesshu、Ito Takehiro、Mizuta Haruka、Moore Benjamin、Nishimura Naomi、Subramanya Vijay、Suzuki Akira、Vaidyanathan Krishna
    • Journal Title

      Theoretical Computer Science

      Volume: 806 Pages: 553-566

    • DOI

      10.1016/j.tcs.2019.09.018

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-17K12636
  • [Journal Article] Parameterized Complexity of (A,l)-Path Packing2020

    • Author(s)
      Belmonte Remy、Hanaka Tesshu、Kanzaki Masaaki、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Lampis Michael、Ono Hirotaka、Otachi Yota
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12126 Pages: 43-55

    • DOI

      10.1007/978-3-030-48966-3_4

    • ISBN
      9783030489656, 9783030489663
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17H01698
  • [Journal Article] Independent Set Reconfguration Parameterized by Modular-Width2020

    • Author(s)
      Remy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
    • Journal Title

      Algorithmica

      Volume: - Issue: 9 Pages: 2586-2605

    • DOI

      10.1007/s00453-020-00700-y

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-17H01698, KAKENHI-PROJECT-18K11157, KAKENHI-PROJECT-18H04091
  • [Journal Article] Parameterized Orientable Deletion2020

    • Author(s)
      Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
    • Journal Title

      Algorithmica

      Volume: - Issue: 7 Pages: 1909-1938

    • DOI

      10.1007/s00453-020-00679-6

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18H04091
  • [Journal Article] Parameterized Algorithms for the Happy Set Problem2020

    • Author(s)
      Asahiro Yuichi、Eto Hiroshi、Hanaka Tesshu、Lin Guohui、Miyano Eiji、Terabaru Ippei
    • Journal Title

      Proc. 14th International Conference and Workshops on Algorithms and Computation

      Volume: LNCS12049 Pages: 323-328

    • DOI

      10.1007/978-3-030-39881-1_27

    • ISBN
      9783030398804, 9783030398811
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00016, KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-19K21537
  • [Journal Article] An Optimal Algorithm for Bisection for Bounded-Treewidth Graph2020

    • Author(s)
      Hanaka Tesshu、Kobayashi Yasuaki、Sone Taiga
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12340 Pages: 25-36

    • DOI

      10.1007/978-3-030-59901-0_3

    • ISBN
      9783030599003, 9783030599010
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-19K21537
  • [Journal Article] Hedonic Seat Arrangement Problems2020

    • Author(s)
      Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
    • Journal Title

      Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020)

      Volume: - Pages: 1777-1779

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Journal Article] Graph Classes and Approximability of the Happy Set Problem2020

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12273 Pages: 335-346

    • DOI

      10.1007/978-3-030-58150-3_27

    • ISBN
      9783030581497, 9783030581503
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17K00016
  • [Journal Article] (In)approximability of Maximum Minimal FVS2020

    • Author(s)
      Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
    • Journal Title

      Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020),

      Volume: 181 Pages: 208-220

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Journal Article] Subgraph Isomorphism on Graph Classes that Exclude a Substructure2020

    • Author(s)
      Bodlaender Hans L.、Hanaka Tesshu、Kobayashi Yasuaki、Kobayashi Yusuke、Okamoto Yoshio、Otachi Yota、van der Zanden Tom C.
    • Journal Title

      Algorithmica

      Volume: 82 Issue: 12 Pages: 3566-3587

    • DOI

      10.1007/s00453-020-00737-z

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-18H04091
  • [Journal Article] Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium2020

    • Author(s)
      Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi
    • Journal Title

      Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2020) / Lecture Notes in Computer Science (LNCS)

      Volume: 12011 Pages: 627-635

    • DOI

      10.1007/978-3-030-38919-2_52

    • ISBN
      9783030389185, 9783030389192
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K19960, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17H01698
  • [Journal Article] On directed covering and domination problems2019

    • Author(s)
      Hanaka Tesshu、Nishimura Naomi、Ono Hirotaka
    • Journal Title

      Discrete Applied Mathematics

      Volume: 259 Pages: 76-99

    • DOI

      10.1016/j.dam.2018.12.012

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17H01698
  • [Journal Article] Subgraph Isomorphism on Graph Classes that Exclude a Substructure2019

    • Author(s)
      Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom van der Zanden
    • Journal Title

      Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC 2019)

      Volume: 11485 Pages: 87-98

    • DOI

      10.1007/978-3-030-17402-6_8

    • ISBN
      9783030174019, 9783030174026
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Journal Article] Computational Complexity of Hedonic Games on Sparse Graphs2019

    • Author(s)
      Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
    • Journal Title

      Proceedings of the International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2019) / Lecture Notes in Computer Science (LNCS)

      Volume: 11873 Pages: 576-584

    • DOI

      10.1007/978-3-030-33792-6_43

    • ISBN
      9783030337919, 9783030337926
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K19960, KAKENHI-PROJECT-19K21537
  • [Journal Article] Parameterized Complexity of Safe Set2019

    • Author(s)
      Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
    • Journal Title

      Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC 2019)

      Volume: 11485 Pages: 38-49

    • DOI

      10.1007/978-3-030-17402-6_4

    • ISBN
      9783030174019, 9783030174026
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17H01698
  • [Journal Article] On the maximum weight minimal separator2019

    • Author(s)
      Tesshu Hanaka, Hans L. Bodlaender, Tom van der Zanden, Hirotaka Ono
    • Journal Title

      Theoretical Computer Science

      Volume: 796 Pages: 294-308

    • DOI

      10.1016/j.tcs.2019.09.025

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17H01698
  • [Journal Article] Parameterized Algorithms for Maximum Cut with Connectivity Constraints2019

    • Author(s)
      Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
    • Journal Title

      Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)

      Volume: 148

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Journal Article] Optimal Partition of a Tree with Social Distance2018

    • Author(s)
      Okubo Masahiro、Hanaka Tesshu、Ono Hirotaka
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 11355 Pages: 121-132

    • DOI

      10.1007/978-3-030-10564-8_10

    • ISBN
      9783030105631, 9783030105648
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17H01698, KAKENHI-PROJECT-19K21537
  • [Presentation] ラプラシアン行列の固有値を用いた木幅の下界とその改善2024

    • Author(s)
      儀間 達也, 土中 哲秀, 野呂 浩平, 小野 廣隆, 大舘 陽太
    • Organizer
      第197回AL研究発表会
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] グラフ分解に基づく高性能なビール路クエリシステム2024

    • Author(s)
      杉山 康恭, 小野 廣隆, 土中 哲秀, 定兼 邦彦
    • Organizer
      日本オペレーションズ・リサーチ学会 第 51 回中部支部研究発表会・特別講演会 名古屋
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] サイズ制約付き連結グラフ分割問題のパラメータ化近似アルゴリズム2024

    • Author(s)
      山田 秀流, 土中 哲秀
    • Organizer
      2024年電子情報通信学会総合大会 COMP-AFSA 学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] グラフ分解に基づく高性能なビール路クエリシステム2024

    • Author(s)
      杉山 康恭, 小野 廣隆, 土中 哲秀, 定兼 邦彦
    • Organizer
      2024年電子情報通信学会総合大会 COMP-AFSA 学生シンポジウム,
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] ラプラシアン行列の固有値に関する木幅の下界とそのさらなる改善2024

    • Author(s)
      儀間 達也, 土中 哲秀, 野呂 浩平, 小野 廣隆, 大舘 陽太
    • Organizer
      2023年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] グラフ分解に基づく高性能なビール路クエリシステム2024

    • Author(s)
      杉山 康恭, 小野 廣隆, 土中 哲秀, 定兼 邦彦
    • Organizer
      2023年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] ラプラシアン行列の固有値を用いた木幅の下界とその改善2024

    • Author(s)
      儀間 達也, 土中 哲秀, 野呂 浩平, 小野 廣隆, 大舘 陽太
    • Organizer
      2024年電子情報通信学会総合大会 COMP-AFSA 学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] List Variants of Packing Problems on Sparse Graphs2024

    • Author(s)
      Gima Tatsuya, Hanaka Tesshu, Kobayashi Yasuaki, Otachi Yota, Shirai Tomohito, Suzuki Akira, Tamura Yuma, Zhou Xiao
    • Organizer
      第196回アルゴリズム研究発表会
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] サイズ制約付き連結グラフ分割問題に対するFPT近似スキーム2024

    • Author(s)
      山田 秀流, 土中 哲秀
    • Organizer
      2023年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] An Edit Model and Algorithms for Achieving Properties on Intersection Graphs2024

    • Author(s)
      オノラト ドロゲット ニコラス, 栗田 和宏, 土中 哲秀, 小野 廣隆
    • Organizer
      2023年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] An Edit Model and Algorithms for Achieving Properties on Intersection Graphs2024

    • Author(s)
      Honorato Droguett Nicolas, Kurita Kazuhiro, Hanaka Tesshu, Ono Hirotaka
    • Organizer
      第197回AL研究発表会
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] グラフ分解に基づく高性能なビール路クエリシステム2024

    • Author(s)
      杉山 康恭, 小野 廣隆, 土中 哲秀, 定兼 邦彦
    • Organizer
      第197回AL研究発表会
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Algorithms for Optimally Shifting Intervals under Intersection Graph Models2023

    • Author(s)
      Nicolas Honorato Drogue, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
    • Organizer
      第19回情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] サイズ制約付きグラフ分割問題に対する劣指数時間アルゴリズム2023

    • Author(s)
      山田 秀流, 土中 哲秀
    • Organizer
      第19回情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 離合コスト下でのパス計画ゲームのナッシュ均衡2023

    • Author(s)
      関口 裕也, 土中 哲秀, 小野 廣隆
    • Organizer
      2022 年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] YOMENにおける質問数の上下界2023

    • Author(s)
      平野 巧稀, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      第17回 組合せゲーム・パズル研究集会
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] Collecting Balls on a Line by Robots with Limited Energy2023

    • Author(s)
      Nicolas Honorato Drogue, Kazuhiro Kurita, Tesshu Hanaka, Yota Otachi, Hirotaka Ono
    • Organizer
      The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] SPQR木を利用したビール路問題への解法2023

    • Author(s)
      杉山 康恭, 小野 廣隆, 土中 哲秀, 定兼 邦彦
    • Organizer
      2023 年度 夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP2023

    • Author(s)
      Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
    • Organizer
      コンピュテーション研究会(COMP)2023-10
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] ラプラシアン行列の固有値に関する木幅の下界とその改善2023

    • Author(s)
      野呂 浩平, 儀間 達也, 土中 哲秀, 大舘 陽太, 小野 廣隆
    • Organizer
      2022 年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Algorithms for Optimally Shifting Intervals under Intersection Graph Models2023

    • Author(s)
      Nicolas Honorato Drogue, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
    • Organizer
      九州地区におけるOR若手研究交流会 ―2023 湯布院―
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 頂点インテグリティのパラメータ化計算量2023

    • Author(s)
      村井 亮太, 儀間 達也, 土中 哲秀, 小林 靖明, 小野 廣隆, 大舘 陽太
    • Organizer
      2022 年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Structural Parameterizations of Vertex Integrity2023

    • Author(s)
      Ryota Murai, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Hirotaka Ono, Yota Otachi
    • Organizer
      The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] On a spectral lower bound of treewidth2023

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
    • Organizer
      The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Fixed-Parameter Algorithms for Fixed Cardinality Graph Partitioning Problems on Sparse Graphs2023

    • Author(s)
      Suguru Yamada, Tesshu Hanaka
    • Organizer
      The 25th Indonesia-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (IJCDCG^3)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 続・ラプラシアン行列の固有値に関する木幅の下界とその改善2023

    • Author(s)
      儀間 達也, 土中 哲秀, 野呂 浩平, 小野 廣隆, 大舘 陽太
    • Organizer
      2023 年度 夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Collecting Balls on a Line by Robots with Limited Energy2023

    • Author(s)
      Nicolas Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Yota Otachi, Hirotaka Ono
    • Organizer
      The 23rd Japan?Korea Joint Workshop?on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22H00513
  • [Presentation] Algorithms for Optimally Shifting Intervals under Intersection Graph Models2023

    • Author(s)
      Honorato Droguett Nicolas, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
    • Organizer
      コンピュテーション研究会(COMP)2023-12
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] グループ支配集合問題のグラフ構造パラメータに関する計算量2023

    • Author(s)
      宇田 冴輝, 土中 哲秀, 大舘 陽太, 小野 廣隆
    • Organizer
      2023年電子情報通信学会総合大会 COMP-AFSA 学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] An improved spectral lower bound of treewidth2023

    • Author(s)
      Kohei Noro, Tatsuya Gima, Tesshu Hanaka, Hirotaka Ono, Yota Otachi
    • Organizer
      The 25th Indonesia-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (IJCDCG^3)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 連結グラフ分割問題の劣指数時間アルゴリズム2023

    • Author(s)
      山田 秀流, 土中 哲秀
    • Organizer
      2023 年度 夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 連結グラフ分割問題FPT近似アルゴリズム2023

    • Author(s)
      山田 秀流, 土中 哲秀
    • Organizer
      九州地区におけるOR若手研究交流会 ―2023 湯布院―
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] On a spectral lower bound of treewidth2023

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka,?Kohei Noro, Hirotaka Ono, Yota Otachi
    • Organizer
      The 23rd Japan?Korea Joint Workshop?on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22H00513
  • [Presentation] Collecting Balls on a Line by Robots with Limited Energy2023

    • Author(s)
      Nicolas Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Yota Otachi, Hirotaka Ono
    • Organizer
      2022 年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 分数型ヘドニックゲームにおける最適提携構造の計算2023

    • Author(s)
      池山 愛梨, 土中 哲秀, 小野 廣隆
    • Organizer
      2022 年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] 疎グラフにおけるサイズ制約付きグラフ分割問題の固定パラメータ容易アルゴリズム2023

    • Author(s)
      山田 秀流, 土中 哲秀
    • Organizer
      火の国情報シンポジウム2023
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Optimally shifting intervals under intersection graph models2023

    • Author(s)
      Nicolas Honorato Drogue, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
    • Organizer
      2023 年度 夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 2種の中継器による端末接続問題2023

    • Author(s)
      杜文博,小野廣隆,土中哲秀
    • Organizer
      OR学会第50回中部支部研究発表会
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Structural Parameterizations of Vertex Integrity2023

    • Author(s)
      Ryota Murai, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Hirotaka Ono, Yota Otachi
    • Organizer
      The 23rd Japan?Korea Joint Workshop?on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22H00513
  • [Presentation] 売却可能スキーレンタル問題の競合比2022

    • Author(s)
      瀧塚 公太郎, 土中 哲秀, 小野 廣隆
    • Organizer
      2022 年度 夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Hedonic Games and Treewidth Revisited2022

    • Author(s)
      Tesshu Hanaka, Michael Lampis
    • Organizer
      The 30th Annual European Symposium on Algorithms (ESA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] 小直径グラフにおける距離制約付きラベリング問題のTSPへの帰着2022

    • Author(s)
      杉山 康恭, 土中 哲秀, 小野 廣隆
    • Organizer
      2022 年度 夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Fixed-parameter tractability of linear extension diameter2022

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Winner Determination Algorithms for Colored Arc Kayles2022

    • Author(s)
      Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono
    • Organizer
      第48回ゲーム情報学研究発表会
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] 離合コスト下でのパス計画ゲームのナッシュ均衡2022

    • Author(s)
      関口 裕也, 土中 哲秀, 小野 廣隆
    • Organizer
      第18回情報科学ワークショップ
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] 辺ケイレスのための指数時間アルゴリズム2022

    • Author(s)
      吉渡 叶, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      2021年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] (色付き)辺ケイレスの計算量2022

    • Author(s)
      吉渡 叶, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      第18回情報科学ワークショップ
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] ブロックグラフにおける分数型ヘドニックゲームの最適提携構造2022

    • Author(s)
      池山 愛梨, 土中 哲秀, 小野 廣隆
    • Organizer
      2022 年度 夏のLAシンポジウム
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] Grouped domination parameterized by vertex cover, twin cover, and beyond2022

    • Author(s)
      宇田 冴輝, 土中 哲秀, 大舘 陽太, 小野 廣隆
    • Organizer
      2022 年度 夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Capacitated Network Design Games on a Generalized Fair Allocation Model2022

    • Author(s)
      Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
    • Organizer
      The 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] YOMENの解空間サイズとヒント数2022

    • Author(s)
      平野 巧稀, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      第16回 組合せゲーム・パズル研究集会
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] 小直径グラフにおける距離制約付きラベリング問題のTSPへの帰着2022

    • Author(s)
      杉山 康恭, 土中 哲秀, 小野 廣隆
    • Organizer
      最適化手法とアルゴリズム (SOMA) 未来を担う若手研究者の集い 2022
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] Winner Determination Algorithms for Graph Games with Matching Structures2022

    • Author(s)
      Yoshiwatari Kanae, Kiya Hironori, Hanaka Tesshu, Ono Hirotaka
    • Organizer
      The 33rd International Workshop on Combinatorial Algorithms (IWOCA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] Computing diverse shortest paths efficiently: A theoretical and experimental study2022

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, and Yota Otachi
    • Organizer
      The 36th AAAI Conference on Artificial Intelligence (AAAI 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 多様な解集合を発見する効率良い近似アルゴリズム2022

    • Author(s)
      栗田 和宏,土中 哲秀,清見礼,小林 靖明,小林 佑輔,大舘 陽太
    • Organizer
      人工知能学会 第119回人工知能基本問題研究会
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] スプリットグラフにおける分数型ヘドニックゲームの安定性の代償2022

    • Author(s)
      池山 愛梨, 土中 哲秀, 小野 廣隆
    • Organizer
      2021年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] 2種の中継器による端末接続問題2022

    • Author(s)
      杜文博, 土中 哲秀, 小野 廣隆
    • Organizer
      第18回情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 小直径グラフにおけるL(p,q)-ラベリング2022

    • Author(s)
      杉山康恭, 土中哲秀, 小野廣隆
    • Organizer
      OR学会中部支部研究発表会
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] グラフマッチング型ゲームに対する必勝判定アルゴリズム2022

    • Author(s)
      吉渡 叶, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      第16回 組合せゲーム・パズル研究集会
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] 個人の性格特性を考慮したソーシャルネットワーク分析2021

    • Author(s)
      岩田 知旺, 土中 哲秀, 小野廣隆:
    • Organizer
      第48回OR学会中部支部研究発表会
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] トリオ支配集合問題に対する固定パラメータアルゴリズム2021

    • Author(s)
      宇田 冴輝, 土中 哲秀, 大舘 陽太, 小野 廣隆
    • Organizer
      第17回情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] On Tractable Problems of Diversity Optimization2021

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
    • Organizer
      情報処理学会 第183回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-21K17707
  • [Presentation] 辺ケイレスに対する指数時間必勝判定アルゴリズム2021

    • Author(s)
      吉渡 叶, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      第17回情報科学ワークショップ
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] ブロックスプリットグラフにおける分数型ヘドニックゲームの安定性の代償2021

    • Author(s)
      池山 愛梨, 土中 哲秀, 小野 廣隆
    • Organizer
      第17回情報科学ワークショップ
    • Data Source
      KAKENHI-PUBLICLY-21H05852
  • [Presentation] Computing L(p,1)-Labeling with Combined Parameters2021

    • Author(s)
      Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
    • Organizer
      The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Hedonic Seat Arrangement Problems2021

    • Author(s)
      Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
    • Organizer
      電子情報通信学会2021年(令和3年)総合大会 シンポジウムセッション COMP学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 一般化費用分配関数の下での容量制約付きネットワーク設計ゲーム2021

    • Author(s)
      廣瀬 暁之, 土中 哲秀, 小野 廣隆
    • Organizer
      電子情報通信学会2021年(令和3年)総合大会 シンポジウムセッション COMP学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 構造的パラメータに関する最密部分グラフ問題の固定パラメータ容易性2020

    • Author(s)
      土中 哲秀
    • Organizer
      第176回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Parameterized Algorithms for the Happy Set Problem2020

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
    • Organizer
      The 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 最大ハッピー集合問題に対する近似アルゴリズム2020

    • Author(s)
      朝廣 雄一, 江藤 宏, 土中 哲秀, Guohui Lin, 宮野 英次, 寺原 一平
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion2020

    • Author(s)
      Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 多様な部分グラフを発見するアルゴリズム2020

    • Author(s)
      土中 哲秀, 小林 靖明,栗田 和宏,大舘 陽太
    • Organizer
      人工知能学会 第113回人工知能基本問題研究会(SIG-FPAI)
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] (In)approximability of Maximum Minimal FVS2020

    • Author(s)
      Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
    • Organizer
      The 31st International Symposium on Algorithms and Computation (ISAAC 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] コーダルグラフ関連クラスにおける2人プレイヤー拡散競争ゲームのナッシュ均衡”2020

    • Author(s)
      福園 菜央佳, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      2019年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] L(p, 1) ラベリングのための固定パラメータアルゴリズム2020

    • Author(s)
      川井 一馬, 土中 哲秀, 小野 廣隆
    • Organizer
      第16回情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Packing disjoint A-paths with fixed length2020

    • Author(s)
      Remy Belmonte, 土中 哲秀, 神崎 勝彰, 清見 礼, 小林 靖明, 小林 佑輔, Michael Lampis , 小野 廣隆, 大舘 陽太
    • Organizer
      2019年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Graph Classes and Approximability of the Happy Set Problem2020

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
    • Organizer
      The 26th International Computing and Combinatorics Conference (COCOON 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Fixed Parameter Algorithms for L(p,1)-labeling2020

    • Author(s)
      川井 一馬, 土中 哲秀, 小野 廣隆
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 一般化費用分配モデル下での容量制約付きネットワーク設計ゲーム2020

    • Author(s)
      廣瀬 暁之, 土中 哲秀, 小野 廣隆
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 疎グラフにおけるヘドニックゲームの計算量2020

    • Author(s)
      前井 康秀, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      2019年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] An optimal algorithm for Bisection for bounded-treewidth graphs2020

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
    • Organizer
      The 14th International Frontiers of Algorithmics Workshop (FAW 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Capacitated Network Design Games on a Generalized Fair Allocation Model2020

    • Author(s)
      廣瀬 暁之, 土中 哲秀, 小野 廣隆
    • Organizer
      第16回情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Parameterized Complexity of (A,l)-Path Packing2020

    • Author(s)
      Remy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
    • Organizer
      The 31st International Workshop on Combinatorial Algorithms (IWOCA 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Two-player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium2020

    • Author(s)
      Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi
    • Organizer
      The 46th International Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Graph partitioning problems parameterized by vertex integrity2020

    • Author(s)
      儀間 達也, 土中 哲秀, 清見 礼, 小林 靖明, 大舘 陽太
    • Organizer
      2019年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Hedonic Seat Arrangement Problems2020

    • Author(s)
      Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
    • Organizer
      The 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Parameterized Algorithms for Maximum Cut with Connectivity Constraints2019

    • Author(s)
      Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
    • Organizer
      The 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Optimal Partition of a Tree with Social Distance2019

    • Author(s)
      Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
    • Organizer
      International Conference and Workshops on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Computational Complexity of Hedonic Games on Sparse Graphs2019

    • Author(s)
      Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
    • Organizer
      The 22nd International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] New Results on Directed Edge Dominating Set2019

    • Author(s)
      Remy Belmonte , 土中 哲秀, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
    • Organizer
      冬の LA シンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Independent Set Reconfiguration Parameterized by Modular-Width2019

    • Author(s)
      Remy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
    • Organizer
      The 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Subgraph Isomorphism on Graph Classes that Exclude a Substructure2019

    • Author(s)
      Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom van der Zanden
    • Organizer
      The 11th International Conference on Algorithms and Complexity (CIAC 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] Parameterized Complexity of Safe Set2019

    • Author(s)
      Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
    • Organizer
      The 11th International Conference on Algorithms and Complexity (CIAC 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 弦グラフ関連クラスにおける 2 人プレイヤー拡散競争ゲームのナッシュ均衡について2019

    • Author(s)
      福園 菜央佳, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      第15回情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 最大連結カットに対するパラメータ化アルゴリズム2019

    • Author(s)
      江藤 宏, 土中 哲秀, 小林 靖明, 小林 佑輔
    • Organizer
      2019年度夏の LA シンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] グラフへドニックゲームにおける総効用最大化 FPT アルゴリズム2019

    • Author(s)
      前井 康秀, 川井 一馬, 木谷 裕紀, 土中 哲秀, 小野 廣隆
    • Organizer
      2019年度夏の LA シンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 距離効用関数に基づく木の分割アルゴリズムの最適性・安定性2019

    • Author(s)
      大久保 壮浩, 土中 哲秀, 小野 廣隆
    • Organizer
      2019年度夏の LA シンポジウム,
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] グラフ制限下のヘドニックゲームにおける安定性探索のPLS完全性2018

    • Author(s)
      前井康秀, 木谷裕紀, 土中哲秀, 小野廣隆
    • Organizer
      第14回 情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] コーダルグラフ関連クラスにおける2人拡散競争ゲームのナッシュ均衡の存在性2018

    • Author(s)
      福薗 菜央佳 , 土中 哲秀 , 木谷 裕紀, 小野 廣隆
    • Organizer
      冬の LA シンポジウム
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 弦グラフ関連クラスにおける拡散競争ゲームのナッシュ均衡の存在性2018

    • Author(s)
      福薗菜央佳, 木谷裕紀, 土中哲秀, 小野 廣隆
    • Organizer
      第14回 情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 有向辺支配集合問題の核と近似2018

    • Author(s)
      Remy Belmonte, 土中哲秀, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
    • Organizer
      第14回 情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-19K21537
  • [Presentation] 帰属分析を用いた環境経済構造の把握2018

    • Author(s)
      土中 哲秀, 金本 圭一朗, 加河 茂美
    • Organizer
      環太平洋産業連関分析学会 第29回(2018年度)全国大会
    • Data Source
      KAKENHI-PROJECT-19K21537
  • 1.  Kanemoto Keiichiro (20736350)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 2.  小野 廣隆 (00346826)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 14 results
  • 3.  柳浦 睦憲 (10263120)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 4.  大舘 陽太 (80610196)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 6 results
  • 5.  脊戸 和寿 (20584056)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 6.  高梨 功次郎 (10632119)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 7.  久保田 康裕 (50295234)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 8.  筧 雄介 (50636727)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 9.  小林 靖明
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 results
  • 10.  伊藤 健洋
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 11.  清見 礼
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 12.  宮野 英次
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 13.  朝廣 雄一
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi