Tesshu Hanaka

According to our database, Tesshu Hanaka authored at least 52 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Winner Determination Algorithms for Graph Games with Matching Structures.

Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari

Algorithmica, March, 2024

Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP.

Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama

Int. J. Netw. Comput., 2024

Collecting Balls on a Line by Robots with Limited Energy.

Tesshu Hanaka, Nicolás Honorato Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi

IEICE Trans. Inf. Syst., 2024

On a Spectral Lower Bound of Treewidth.

Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi

IEICE Trans. Inf. Syst., 2024

Core Stability in Additively Separable Hedonic Games of Low Treewidth.

Tesshu Hanaka, Noleen Köhler, Michael Lampis

CoRR, 2024

Parameterized Vertex Integrity Revisited.

Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari

CoRR, 2024

On the Complexity of List H-Packing for Sparse Graph Classes.

Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou

Proceedings of the WALCOM: Algorithms and Computation, 2024

Structural Parameterizations of Vertex Integrity.

Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi

Proceedings of the WALCOM: Algorithms and Computation, 2024

Faster Winner Determination Algorithms for (Colored) Arc Kayles.

Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144].

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Theor. Comput. Sci., October, 2023

Computing densest k-subgraph with structural parameters.

Tesshu Hanaka

J. Comb. Optim., 2023

New Results on Directed Edge Dominating Set.

Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis

Discret. Math. Theor. Comput. Sci., 2023

Algorithms for Optimally Shifting Intervals under Intersection Graph Models.

Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono

CoRR, 2023

Finding a Minimum Spanning Tree with a Small Non-Terminal Set.

Tesshu Hanaka, Yasuaki Kobayashi

CoRR, 2023

Turning Tiles is PSPACE-complete.

Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono

CoRR, 2023

Shortest Beer Path Queries Based on Graph Decomposition.

Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP^*.

Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

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

Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono

Proceedings of the Combinatorial Optimization and Applications, 2023

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

Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.

Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Exploring the gap between treedepth and vertex cover through vertex integrity.

Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi

Theor. Comput. Sci., 2022

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.

Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

Theory Comput. Syst., 2022

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

Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono

J. Graph Algorithms Appl., 2022

(In)approximability of maximum minimal FVS.

Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos

J. Comput. Syst. Sci., 2022

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

Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono

Discret. Appl. Math., 2022

Parameterized Complexity of (A, ℓ )-Path Packing.

Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi

Algorithmica, 2022

Hedonic Games and Treewidth Revisited.

Tesshu Hanaka, Michael Lampis

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Capacitated Network Design Games on a Generalized Fair Allocation Model.

Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

A (probably) optimal algorithm for Bisection on bounded-treewidth graphs.

Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone

Theor. Comput. Sci., 2021

Finding a maximum minimal separator: Graph classes and fixed-parameter tractability.

Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita

Theor. Comput. Sci., 2021

Complexity and approximability of the happy set problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Theor. Comput. Sci., 2021

Parameterized algorithms for the Happy Set problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Discret. Appl. Math., 2021

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

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

Algorithmica, 2021

Finding Diverse Trees, Paths, and More.

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Reconfiguring spanning and induced subgraphs.

Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan

Theor. Comput. Sci., 2020

Parameterized Complexity of Safe Set.

Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi

J. Graph Algorithms Appl., 2020

An optimal algorithm for Bisection for bounded-treewidth graphs.

Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone

CoRR, 2020

Parameterized Orientable Deletion.

Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora

Algorithmica, 2020

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden

Algorithmica, 2020

Independent Set Reconfiguration Parameterized by Modular-Width.

Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi

Algorithmica, 2020

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

Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

An Optimal Algorithm for Bisection for Bounded-Treewidth Graph.

Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone

Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

Graph Classes and Approximability of the Happy Set Problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Hedonic Seat Arrangement Problems.

Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

On the maximum weight minimal separator.

Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono

Theor. Comput. Sci., 2019

On directed covering and domination problems.

Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono

Discret. Appl. Math., 2019

Optimal Partition of a Tree with Social Distance.

Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Computational Complexity of Hedonic Games on Sparse Graphs.

Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono

Proceedings of the PRIMA 2019: Principles and Practice of Multi-Agent Systems, 2019

Parameterized Algorithms for Maximum Cut with Connectivity Constraints.

Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2015

A Fixed-Parameter Algorithm for Max Edge Domination.

Tesshu Hanaka, Hirotaka Ono

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015