Personal information

Japan

Biography

Kyushu University

Activities

Works (45)

Algorithms for Optimally Shifting Intervals Under Intersection Graph Models

2025 | Book chapter
Contributors: Nicolás Honorato-Droguett; Kazuhiro Kurita; Tesshu Hanaka; Hirotaka Ono
Source: check_circle
Crossref

Finding a minimum spanning tree with a small non-terminal set

Theoretical Computer Science
2025-04 | Journal article
Contributors: Tesshu Hanaka; Yasuaki Kobayashi
Source: check_circle
Crossref

Faster Winner Determination Algorithms for (Colored) Arc Kayles

2024 | Book chapter
Contributors: Tesshu Hanaka; Hironori Kiya; Michael Lampis; Hirotaka Ono; Kanae Yoshiwatari
Source: check_circle
Crossref

Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs

2024 | Book chapter
Contributors: Suguru Yamada; Tesshu Hanaka
Source: check_circle
Crossref

Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs

2024 | Book chapter
Contributors: Tesshu Hanaka; Airi Ikeyama; Hirotaka Ono
Source: check_circle
Crossref

On the Complexity of List $$\mathcal H$$-Packing for Sparse Graph Classes

2024 | Book chapter
Contributors: Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Yota Otachi; Tomohito Shirai; Akira Suzuki; Yuma Tamura; Xiao Zhou
Source: check_circle
Crossref

Structural Parameterizations of Vertex Integrity [Best Paper]

2024 | Book chapter
Contributors: Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Ryota Murai; Hirotaka Ono; Yota Otachi
Source: check_circle
Crossref

Changes in domestic value added from exports: a structural decomposition approach

Spatial Economic Analysis
2024-08-27 | Journal article
Contributors: Shohei Tokito; Fumiya Nagashima; Tesshu Hanaka
Source: check_circle
Crossref

An application of the graph approach to life-cycle optimisation of vehicle electrification

Environmental Research Communications
2024-05-01 | Journal article
Contributors: Shohei Tokito; Yuya Nakamoto; Tesshu Hanaka
Source: check_circle
Crossref

Strategic roadmap for optimising vehicle emission reductions and electrification

Environmental Research Letters
2024-05-01 | Journal article
Contributors: Yuya Nakamoto; Shohei Tokito; Tesshu Hanaka
Source: check_circle
Crossref

Measuring exposure to network concentration risk in global supply chains: Volume versus frequency

Structural Change and Economic Dynamics
2024-03 | Journal article
Contributors: Satoshi Inomata; Tesshu Hanaka
Source: check_circle
Crossref

Identifying critical transmission sectors by a new approach: Intermediate-based accounting

Journal of Cleaner Production
2024-01 | Journal article
Contributors: Shohei Tokito; Fumiya Nagashima; Tesshu Hanaka
Source: check_circle
Crossref

Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond

2023 | Book chapter
Contributors: Tesshu Hanaka; Hirotaka Ono; Yota Otachi; Saeki Uda
Source: check_circle
Crossref

Computing densest k-subgraph with structural parameters

Journal of Combinatorial Optimization
2023-01 | Journal article
Contributors: Tesshu Hanaka
Source: check_circle
Crossref

Winner Determination Algorithms for Graph Games with Matching Structures

2022 | Book chapter
Contributors: Kanae Yoshiwatari; Hironori Kiya; Tesshu Hanaka; Hirotaka Ono
Source: check_circle
Crossref

The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality

Discrete Applied Mathematics
2022-11 | Journal article
Contributors: Naoka Fukuzono; Tesshu Hanaka; Hironori Kiya; Hirotaka Ono
Source: check_circle
Crossref

Exploring the gap between treedepth and vertex cover through vertex integrity

Theoretical Computer Science
2022-05 | Journal article
Contributors: Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yota Otachi
Source: check_circle
Crossref

Multi-perspective structural analysis of supply chain networks

Economic Systems Research
2022-04-03 | Journal article
Contributors: Tesshu Hanaka; Keiichiro Kanemoto; Shigemi Kagawa
Source: check_circle
Crossref

(In)approximability of maximum minimal FVS

Journal of Computer and System Sciences
2022-03 | Journal article
Contributors: Louis Dublois; Tesshu Hanaka; Mehdi Khosravian Ghadikolaei; Michael Lampis; Nikolaos Melissinos
Source: check_circle
Crossref

Computing L(p, 1)-Labeling with Combined Parameters

2021 | Book chapter
Contributors: Tesshu Hanaka; Kazuma Kawai; Hirotaka Ono
Source: check_circle
Crossref

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity

2021 | Book chapter
Contributors: Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yota Otachi
Source: check_circle
Crossref

Parameterized algorithms for the Happy Set problem

Discrete Applied Mathematics
2021-12 | Journal article
Contributors: Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru
Source: check_circle
Crossref

Computing the Largest Bond and the Maximum Connected Cut of a Graph

Algorithmica
2021-05 | Journal article
Contributors: Gabriel L. Duarte; Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi; Daniel Lokshtanov; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Uéverton S. Souza
Source: check_circle
Crossref

An Optimal Algorithm for Bisection for Bounded-Treewidth Graph

2020 | Book chapter
Contributors: Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone
Source: check_circle
Crossref

Parameterized algorithms for the happy set problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2020 | Book
EID:

2-s2.0-85080915754

Contributors: Asahiro, Y.; Eto, H.; Hanaka, T.; Lin, G.; Miyano, E.; Terabaru, I.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Parameterized Complexity of $$(A,\ell )$$-Path Packing

2020 | Book chapter
Contributors: Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi; Michael Lampis; Hirotaka Ono; Yota Otachi
Source: check_circle
Crossref

Parameterized Orientable Deletion

Algorithmica
2020 | Journal article
EID:

2-s2.0-85078418629

Contributors: Hanaka, T.; Katsikarelis, I.; Lampis, M.; Otachi, Y.; Sikora, F.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Reconfiguring spanning and induced subgraphs

Theoretical Computer Science
2020 | Journal article
EID:

2-s2.0-85072273843

Contributors: Hanaka, T.; Ito, T.; Mizuta, H.; Moore, B.; Nishimura, N.; Subramanya, V.; Suzuki, A.; Vaidyanathan, K.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2020 | Book
EID:

2-s2.0-85079084710

Contributors: Fukuzono, N.; Hanaka, T.; Kiya, H.; Ono, H.; Yamaguchi, R.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Computational Complexity of Hedonic Games on Sparse Graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2019 | Book
EID:

2-s2.0-85076393259

Contributors: Hanaka, T.; Kiya, H.; Maei, Y.; Ono, H.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Independent Set Reconfiguration Parameterized by Modular-Width

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2019 | Book
EID:

2-s2.0-85072864150

Contributors: Belmonte, R.; Hanaka, T.; Lampis, M.; Ono, H.; Otachi, Y.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier
grade
Preferred source (of 2)‎

Industrial clusters with substantial carbon-reduction potential

Economic Systems Research
2019 | Journal article
EID:

2-s2.0-85050518054

Contributors: Kanemoto, K.; Hanaka, T.; Kagawa, S.; Nansai, K.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

On directed covering and domination problems

Discrete Applied Mathematics
2019 | Journal article
EID:

2-s2.0-85059939869

Contributors: Hanaka, T.; Nishimura, N.; Ono, H.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier
grade
Preferred source (of 2)‎

On the maximum weight minimal separator

Theoretical Computer Science
2019 | Journal article
EID:

2-s2.0-85073029754

Contributors: Hanaka, T.; Bodlaender, H.L.; van der Zanden, T.C.; Ono, H.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Optimal Partition of a Tree with Social Distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2019 | Book
EID:

2-s2.0-85062662226

Contributors: Okubo, M.; Hanaka, T.; Ono, H.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Parameterized algorithms for maximum cut with connectivity constraints

Leibniz International Proceedings in Informatics, LIPIcs
2019 | Conference paper
EID:

2-s2.0-85077468897

Contributors: Eto, H.; Hanaka, T.; Kobayashi, Y.; Kobayashi, Y.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Parameterized Complexity of Safe Set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2019 | Book
EID:

2-s2.0-85066895249

Contributors: Belmonte, R.; Hanaka, T.; Katsikarelis, I.; Lampis, M.; Ono, H.; Otachi, Y.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier
grade
Preferred source (of 2)‎

Subgraph Isomorphism on Graph Classes that Exclude a Substructure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2019 | Book
EID:

2-s2.0-85066883492

Contributors: Bodlaender, H.L.; Hanaka, T.; Okamoto, Y.; Otachi, Y.; van der Zanden, T.C.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier
grade
Preferred source (of 2)‎

New results on directed edge dominating set

Leibniz International Proceedings in Informatics, LIPIcs
2018 | Conference paper
EID:

2-s2.0-85053177409

Contributors: Belmonte, R.; Hanaka, T.; Katsikarelis, I.; Kim, E.J.; Lampis, M.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Parameterized orientable deletion

Leibniz International Proceedings in Informatics, LIPIcs
2018 | Conference paper
EID:

2-s2.0-85049033592

Contributors: Hanaka, T.; Katsikarelis, I.; Lampis, M.; Otachi, Y.; Sikora, F.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Reconfiguring spanning and induced subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2018 | Book
EID:

2-s2.0-85049683644

Contributors: Hanaka, T.; Ito, T.; Mizuta, H.; Moore, B.; Nishimura, N.; Subramanya, V.; Suzuki, A.; Vaidyanathan, K.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Finding environmentally critical transmission sectors, transactions, and paths in global supply chain networks

Energy Economics
2017 | Journal article
EID:

2-s2.0-85033438514

Contributors: Hanaka, T.; Kagawa, S.; Ono, H.; Kanemoto, K.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

On directed covering and domination problems

Leibniz International Proceedings in Informatics, LIPIcs
2017 | Conference paper
EID:

2-s2.0-85038598677

Contributors: Hanaka, T.; Nishimura, N.; Ono, H.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

On the maximum weight minimal separator

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2017 | Book
EID:

2-s2.0-85018372737

Contributors: Hanaka, T.; Bodlaender, H.L.; Van Der Zanden, T.C.; Ono, H.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

A fixed-parameter algorithm for max edge domination

CEUR Workshop Proceedings
2015 | Conference paper
EID:

2-s2.0-84961379352

Contributors: Hanaka, T.; Ono, H.
Source: Self-asserted source
Tesshu Hanaka via Scopus - Elsevier

Peer review (2 reviews for 2 publications/grants)

Review activity for Algorithmica. (1)
Review activity for Journal of heuristics. (1)