Tesshu Hanaka 土中哲秀
Cited by
Cited by
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
Parameterized algorithms for maximum cut with connectivity constraints
H Eto, T Hanaka, Y Kobayashi, Y Kobayashi
arXiv preprint arXiv:1908.03389, 2019
Reconfiguring spanning and induced subgraphs
T Hanaka, T Ito, H Mizuta, B Moore, N Nishimura, V Subramanya, ...
Theoretical Computer Science 806, 553-566, 2020
On the maximum weight minimal separator
T Hanaka, HL Bodlaender, TC van der Zanden, H Ono
Theoretical Computer Science 796, 294-308, 2019
Industrial clusters with substantial carbon-reduction potential
K Kanemoto, T Hanaka, S Kagawa, K Nansai
Economic Systems Research 31 (2), 248-266, 2019
Parameterized orientable deletion
T Hanaka, I Katsikarelis, M Lampis, Y Otachi, F Sikora
Algorithmica 82 (7), 1909-1938, 2020
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
Subgraph isomorphism on graph classes that exclude a substructure
HL Bodlaender, T Hanaka, Y Okamoto, Y Otachi, TC van der Zanden
International Conference on Algorithms and Complexity, 87-98, 2019
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
New results on directed edge dominating set
R Belmonte, T Hanaka, I Katsikarelis, EJ Kim, M Lampis
arXiv preprint arXiv:1902.04919, 2019
Hedonic seat arrangement problems
HL Bodlaender, T Hanaka, L Jaffke, H Ono, Y Otachi, TC van der Zanden
arXiv preprint arXiv:2002.10898, 2020
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
Hypothetical extraction, betweenness centrality, and supply chain complexity
S Tokito, S Kagawa, T Hanaka
Economic Systems Research, 1-18, 2020
Computational complexity of hedonic games on sparse graphs
T Hanaka, H Kiya, Y Maei, H Ono
International Conference on Principles and Practice of Multi-Agent Systems …, 2019
On directed covering and domination problems
T Hanaka, N Nishimura, H Ono
Discrete Applied Mathematics 259, 76-99, 2019
(In) approximability of Maximum Minimal FVS
L Dublois, T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos
Journal of Computer and System Sciences, 2021
A (probably) optimal algorithm for Bisection on bounded-treewidth graphs
T Hanaka, Y Kobayashi, T Sone
Theoretical Computer Science 873, 38-46, 2021
Complexity and approximability of the happy set problem
Y Asahiro, H Eto, T Hanaka, G Lin, E Miyano, I Terabaru
Theoretical Computer Science 866, 123-144, 2021
Multi-perspective structural analysis of supply chain networks
T Hanaka, K Kanemoto, S Kagawa
Economic Systems Research, 1-16, 2021
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity
T Gima, T Hanaka, M Kiyomi, Y Kobayashi, Y Otachi
Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual …, 2021
The system can't perform the operation now. Try again later.
Articles 1–20