Follow
Tesshu Hanaka 土中哲秀
Title
Cited by
Cited by
Year
Finding environmentally critical transmission sectors, transactions, and paths in global supply chain networks
T Hanaka, S Kagawa, H Ono, K Kanemoto
Energy Economics 68, 44-52, 2017
392017
Parameterized algorithms for maximum cut with connectivity constraints
H Eto, T Hanaka, Y Kobayashi, Y Kobayashi
arXiv preprint arXiv:1908.03389, 2019
152019
Industrial clusters with substantial carbon-reduction potential
K Kanemoto, T Hanaka, S Kagawa, K Nansai
Economic Systems Research 31 (2), 248-266, 2019
142019
Reconfiguring spanning and induced subgraphs
T Hanaka, T Ito, H Mizuta, B Moore, N Nishimura, V Subramanya, ...
Theoretical Computer Science 806, 553-566, 2020
102020
On the maximum weight minimal separator
T Hanaka, HL Bodlaender, TC van der Zanden, H Ono
Theoretical Computer Science 796, 294-308, 2019
102019
Hypothetical extraction, betweenness centrality, and supply chain complexity
S Tokito, S Kagawa, T Hanaka
Economic Systems Research 34 (1), 111-128, 2022
82022
Independent set reconfiguration parameterized by modular-width
R Belmonte, T Hanaka, M Lampis, H Ono, Y Otachi
Algorithmica 82 (9), 2586-2605, 2020
82020
Finding diverse trees, paths, and more
T Hanaka, Y Kobayashi, K Kurita, Y Otachi
Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3778-3786, 2021
72021
(In) approximability of maximum minimal FVS
L Dublois, T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos
arXiv preprint arXiv:2009.09971, 2020
72020
Parameterized complexity of safe set
R Belmonte, T Hanaka, I Katsikarelis, M Lampis, H Ono, Y Otachi
International Conference on Algorithms and Complexity, 38-49, 2019
72019
Multi-perspective structural analysis of supply chain networks
T Hanaka, K Kanemoto, S Kagawa
Economic Systems Research 34 (2), 199-214, 2022
62022
Parameterized algorithms for the happy set problem
Y Asahiro, H Eto, T Hanaka, G Lin, E Miyano, I Terabaru
Discrete Applied Mathematics 304, 32-44, 2021
62021
Subgraph isomorphism on graph classes that exclude a substructure
HL Bodlaender, T Hanaka, Y Kobayashi, Y Kobayashi, Y Okamoto, ...
Algorithmica 82 (12), 3566-3587, 2020
62020
Parameterized orientable deletion
T Hanaka, I Katsikarelis, M Lampis, Y Otachi, F Sikora
Algorithmica 82 (7), 1909-1938, 2020
62020
Hedonic seat arrangement problems
HL Bodlaender, T Hanaka, L Jaffke, H Ono, Y Otachi, TC van der Zanden
arXiv preprint arXiv:2002.10898, 2020
62020
New results on directed edge dominating set
R Belmonte, T Hanaka, I Katsikarelis, EJ Kim, M Lampis
arXiv preprint arXiv:1902.04919, 2019
62019
Computing diverse shortest paths efficiently: a theoretical and experimental study
T Hanaka, Y Kobayashi, K Kurita, SW Lee, Y Otachi
Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3758-3766, 2022
52022
Exploring the gap between treedepth and vertex cover through vertex integrity
T Gima, T Hanaka, M Kiyomi, Y Kobayashi, Y Otachi
Theoretical Computer Science 918, 60-76, 2022
52022
Two-player competitive diffusion game: Graph classes and the existence of a Nash equilibrium
N Fukuzono, T Hanaka, H Kiya, H Ono, R Yamaguchi
International Conference on Current Trends in Theory and Practice of …, 2020
52020
Computing the Largest Bond and the Maximum Connected Cut of a Graph
GL Duarte, H Eto, T Hanaka, Y Kobayashi, Y Kobayashi, D Lokshtanov, ...
Algorithmica 83 (5), 1421-1458, 2021
32021
The system can't perform the operation now. Try again later.
Articles 1–20