Tesshu Hanaka
Citata da
Citata da
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
Reconfiguring spanning and induced subgraphs
T Hanaka, T Ito, H Mizuta, B Moore, N Nishimura, V Subramanya, ...
Theoretical Computer Science 806, 553-566, 2020
Industrial clusters with substantial carbon-reduction potential
K Kanemoto, T Hanaka, S Kagawa, K Nansai
Economic Systems Research 31 (2), 248-266, 2019
Parameterized algorithms for maximum cut with connectivity constraints
H Eto, T Hanaka, Y Kobayashi, Y Kobayashi
arXiv preprint arXiv:1908.03389, 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
On the maximum weight minimal separator
T Hanaka, HL Bodlaender, TC Van Der Zanden, H Ono
International Conference on Theory and Applications of Models of Computation …, 2017
Subgraph isomorphism on graph classes that exclude a substructure
HL Bodlaender, T Hanaka, Y Kobayashi, Y Kobayashi, Y Okamoto, ...
Algorithmica, 1-22, 2020
Hedonic Seat Arrangement Problems
HL Bodlaender, T Hanaka, L Jaffke, H Ono, Y Otachi, TC van der Zanden
arXiv preprint arXiv:2002.10898, 2020
Parameterized orientable deletion
T Hanaka, I Katsikarelis, M Lampis, Y Otachi, F Sikora
Algorithmica, 1-30, 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
Computing the Largest Bond and the Maximum Connected Cut of a Graph
GL Duarte, H Eto, T Hanaka, Y Kobayashi, Y Kobayashi, D Lokshtanov, ...
arXiv preprint arXiv:2007.04513, 2020
Parameterized Complexity of -Path Packing
R Belmonte, T Hanaka, M Kanzaki, M Kiyomi, Y Kobayashi, Y Kobayashi, ...
International Workshop on Combinatorial Algorithms, 43-55, 2020
Parameterized Algorithms for the Happy Set Problem
Y Asahiro, H Eto, T Hanaka, G Lin, E Miyano, I Terabaru
International Workshop on Algorithms and Computation, 323-328, 2020
Independent Set Reconfiguration Parameterized by Modular-Width
R Belmonte, T Hanaka, M Lampis, H Ono, Y Otachi
Algorithmica, 1-20, 2020
An optimal algorithm for Bisection for bounded-treewidth graphs
T Hanaka, Y Kobayashi, T Sone
arXiv preprint arXiv:2002.12706, 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
Boosting Economic Competitiveness: The Industrial Clusters in Input-Output Networks
S Tokito, F Nagashima, T Hanaka
Optimal partition of a tree with social distance
M Okubo, T Hanaka, H Ono
International Workshop on Algorithms and Computation, 121-132, 2019
New results on directed edge dominating set
R Belmonte, T Hanaka, I Katsikarelis, EJ Kim, M Lampis
arXiv preprint arXiv:1902.04919, 2019
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20