A Fixed-Parameter Algorithm for Max Edge Domination. - Tesshu Hanaka; Hirotaka Ono 001 (SOFSEM (Student Research Forum Papers / Posters), 2015)

Subgraph Isomorphism on Graph Classes that Exclude a Substructure. - Hans L. Bodlaender; Tesshu Hanaka; Yoshio Okamoto; Yota Otachi; Tom C. van der Zanden (CIAC, 2019)

Parameterized Algorithms for Maximum Cut with Connectivity Constraints. - Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001 (IPEC, 2019)

Computational Complexity of Hedonic Games on Sparse Graphs. - Tesshu Hanaka; Hironori Kiya; Yasuhide Maei; Hirotaka Ono 001 (PRIMA, 2019)

Optimal Partition of a Tree with Social Distance. - Masahiro Okubo; Tesshu Hanaka; Hirotaka Ono 001 (WALCOM, 2019)

On directed covering and domination problems. - Tesshu Hanaka; Naomi Nishimura; Hirotaka Ono 001 (Discret. Appl. Math., 2019)

On the maximum weight minimal separator. - Tesshu Hanaka; Hans L. Bodlaender; Tom C. van der Zanden; Hirotaka Ono 001 (Theor. Comput. Sci., 2019)

Graph Classes and Approximability of the Happy Set Problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (COCOON, 2020)

An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. - Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone (FAW, 2020)

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. - Naoka Fukuzono; Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001; Ryogo Yamaguchi (SOFSEM, 2020)

Independent Set Reconfiguration Parameterized by Modular-Width. - Rémy Belmonte; Tesshu Hanaka; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2020)

Subgraph Isomorphism on Graph Classes that Exclude a Substructure. - Hans L. Bodlaender; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Yoshio Okamoto; Yota Otachi; Tom C. van der Zanden (Algorithmica, 2020)

Parameterized Orientable Deletion. - Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Yota Otachi; Florian Sikora (Algorithmica, 2020)

An optimal algorithm for Bisection for bounded-treewidth graphs. - Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone (CoRR, 2020)

Parameterized Complexity of Safe Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Hirotaka Ono 001; Yota Otachi (J. Graph Algorithms Appl., 2020)

Reconfiguring spanning and induced subgraphs. - Tesshu Hanaka; Takehiro Ito; Haruka Mizuta; Benjamin R. Moore; Naomi Nishimura; Vijay Subramanya; Akira Suzuki 001; Krishna Vaidyanathan (Theor. Comput. Sci., 2020)

Finding Diverse Trees, Paths, and More. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; Yota Otachi (AAAI, 2021)

Computing the Largest Bond and the Maximum Connected Cut of a Graph. - Gabriel L. Duarte; Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Daniel Lokshtanov; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Uéverton S. Souza (Algorithmica, 2021)

Parameterized algorithms for the Happy Set problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (Discret. Appl. Math., 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)

Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. - Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Tsuyoshi Yagita (Theor. Comput. Sci., 2021)

A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. - Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone (Theor. Comput. Sci., 2021)

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; See Woo Lee; Yota Otachi (AAAI, 2022)

Capacitated Network Design Games on a Generalized Fair Allocation Model. - Tesshu Hanaka; Toshiyuki Hirose; Hirotaka Ono 001 (AAMAS, 2022)

Hedonic Games and Treewidth Revisited. - Tesshu Hanaka; Michael Lampis (ESA, 2022)

Parameterized Complexity of (A, ℓ )-Path Packing. - Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 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 001 (Discret. Appl. Math., 2022)

(In)approximability of maximum minimal FVS. - Louis Dublois; Tesshu Hanaka; Mehdi Khosravian Ghadikolaei; Michael Lampis; Nikolaos Melissinos (J. Comput. Syst. Sci., 2022)

Computing L(p, 1)-Labeling with Combined Parameters. - Tesshu Hanaka; Kazuma Kawai; Hirotaka Ono 001 (J. Graph Algorithms Appl., 2022)

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. - Yuuki Aoike; Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (Theory Comput. Syst., 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)

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. - Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (AAAI, 2023)

Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP*. - Tesshu Hanaka; Hirotaka Ono 001; Kosuke Sugiyama (IPDPS Workshops, 2023)

Shortest Beer Path Queries Based on Graph Decomposition. - Tesshu Hanaka; Hirotaka Ono 001; Kunihiko Sadakane; Kosuke Sugiyama (ISAAC, 2023)

Turning Tiles is PSPACE-complete. - Kanae Yoshiwatari; Hironori Kiya; Koki Suetsugu; Tesshu Hanaka; Hirotaka Ono 001 (CoRR, 2023)

New Results on Directed Edge Dominating Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Eun Jung Kim 002; Michael Lampis (Discret. Math. Theor. Comput. Sci., 2023)

Computing densest k-subgraph with structural parameters. - Tesshu Hanaka (J. Comb. Optim., 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., 2023)

Algorithms for Optimally Shifting Intervals Under Intersection Graph Models. - Nicolás Honorato Droguett; Kazuhiro Kurita; Tesshu Hanaka; Hirotaka Ono 001 (IJTCS-FAW, 2024)

Basis Sequence Reconfiguration in the Union of Matroids. - Tesshu Hanaka; Yuni Iwamasa; Yasuaki Kobayashi; Yuto Okada; Rin Saito (ISAAC, 2024)

Core Stability in Additively Separable Hedonic Games of Low Treewidth. - Tesshu Hanaka; Noleen Köhler; Michael Lampis (ISAAC, 2024)

Parameterized Vertex Integrity Revisited. - Tesshu Hanaka; Michael Lampis; Manolis Vasilakis; Kanae Yoshiwatari (MFCS, 2024)

Faster Winner Determination Algorithms for (Colored) Arc Kayles. - Tesshu Hanaka; Hironori Kiya; Michael Lampis; Hirotaka Ono 001; Kanae Yoshiwatari (SOFSEM, 2024)

On the complexity of finding a spanning even tree in a graph. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; Yasuko Matsui; Atsuki Nagao; Hirotaka Ono 001; Kazuhisa Seto (CoRR, 2024)

On a Spectral Lower Bound of Treewidth. - Tatsuya Gima; Tesshu Hanaka; Kohei Noro; Hirotaka Ono 001; Yota Otachi (IEICE Trans. Inf. Syst., 2024)

Collecting Balls on a Line by Robots with Limited Energy. - Tesshu Hanaka; Nicolás Honorato Droguett; Kazuhiro Kurita; Hirotaka Ono 001; Yota Otachi (IEICE Trans. Inf. Syst., 2024)

Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. - Tesshu Hanaka; Hirotaka Ono 001; Kosuke Sugiyama (Int. J. Netw. Comput., 2024)

Grouped domination parameterized by vertex cover, twin cover, and beyond. - Tesshu Hanaka; Hirotaka Ono 001; Yota Otachi; Saeki Uda (Theor. Comput. Sci., 2024)

Winner Determination Algorithms for Graph Games with Matching Structures. - Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001; Kanae Yoshiwatari (Algorithmica, 2024)

Computational complexity of Turning Tiles. - Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001; Koki Suetsugu; Kanae Yoshiwatari (Int. J. Game Theory, 2024)

Broadcasting Under Structural Restrictions. - Yudai Egami; Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)

Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs. - Suguru Yamada; Tesshu Hanaka (Discret. Appl. Math., 2025)

An improved spectral lower bound of treewidth. - Tatsuya Gima; Tesshu Hanaka; Kohei Noro; Hirotaka Ono 001; Yota Otachi (Inf. Process. Lett., 2025)

Structural parameterizations of vertex integrity. - Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Ryota Murai; Hirotaka Ono 001; Yota Otachi (Theor. Comput. Sci., 2025)

On the complexity of list H-packing for sparse graph classes. - Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Yota Otachi; Tomohito Shirai; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (Theor. Comput. Sci., 2025)

Finding a minimum spanning tree with a small non-terminal set. - Tesshu Hanaka; Yasuaki Kobayashi (Theor. Comput. Sci., 2025)

On the Complexity of Minimising the Moving Distance for Dispersing Objects. - Nicolás Honorato Droguett; Kazuhiro Kurita; Tesshu Hanaka; Hirotaka Ono 001 (CoRR, 2025)

Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs. - Tesshu Hanaka; Airi Ikeyama; Hirotaka Ono 001 (J. Comb. Optim., 2025)

Structural Parameters for Steiner Orientation. - Tesshu Hanaka; Michael Lampis; Nikolaos Melissinos; Edouard Nemery; Hirotaka Ono 001; Manolis Vasilakis (CoRR, 2025)

Hedonic seat arrangement problems. - Hans L. Bodlaender; Tesshu Hanaka; Lars Jaffke; Hirotaka Ono 001; Yota Otachi; Tom C. van der Zanden (Auton. Agents Multi Agent Syst., 2025)