Tesshu Hanaka

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 99

Top Topics

Winner Determination

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

Publications

Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM (2024)
Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
Grouped domination parameterized by vertex cover, twin cover, and beyond. Theor. Comput. Sci. 996 (2024)
Tesshu Hanaka, Nicolás Honorato Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi
Collecting Balls on a Line by Robots with Limited Energy. IEICE Trans. Inf. Syst. 107 (3) (2024)
Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
An improved spectral lower bound of treewidth. CoRR (2024)
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari
Parameterized Vertex Integrity Revisited. MFCS (2024)
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari
Parameterized Vertex Integrity Revisited. CoRR (2024)
Tesshu Hanaka, Noleen Köhler, Michael Lampis
Core Stability in Additively Separable Hedonic Games of Low Treewidth. CoRR (2024)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
Structural Parameterizations of Vertex Integrity [Best Paper]. WALCOM (2024)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM (2024)
Suguru Yamada, Tesshu Hanaka
Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs. ISCO (2024)
Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
On a Spectral Lower Bound of Treewidth. IEICE Trans. Inf. Syst. 107 (3) (2024)
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. Int. J. Netw. Comput. 14 (1) (2024)
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari
Winner Determination Algorithms for Graph Games with Matching Structures. Algorithmica 86 (3) (2024)
Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono
Turning Tiles is PSPACE-complete. CoRR (2023)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. Discret. Math. Theor. Comput. Sci. 25 (2023)
Tesshu Hanaka
Computing densest k-subgraph with structural parameters. J. Comb. Optim. 45 (1) (2023)
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
Algorithms for Optimally Shifting Intervals under Intersection Graph Models. CoRR (2023)
Tesshu Hanaka, Yasuaki Kobayashi
Finding a Minimum Spanning Tree with a Small Non-Terminal Set. CoRR (2023)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. Theor. Comput. Sci. 975 (2023)
Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CIAC (2023)
Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs. CoRR (2023)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
On the complexity of list H-packing for sparse graph classes. CoRR (2023)
Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
Shortest Beer Path Queries Based on Graph Decomposition. ISAAC (2023)
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
. IPDPS Workshops (2023)
Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CoRR (2023)
Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
Shortest Beer Path Queries based on Graph Decomposition. CoRR (2023)
Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs. COCOA (1) (2023)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI (2023)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
Structural Parameterizations of Vertex Integrity. CoRR (2023)
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. CoRR (2023)
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Exploring the gap between treedepth and vertex cover through vertex integrity. Theor. Comput. Sci. 918 (2022)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. 66 (2) (2022)
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
Computing L(p, 1)-Labeling with Combined Parameters. J. Graph Algorithms Appl. 26 (2) (2022)
Tesshu Hanaka, Michael Lampis
Hedonic Games and Treewidth Revisited. ESA (2022)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84 (4) (2022)
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
(In)approximability of maximum minimal FVS. J. Comput. Syst. Sci. 124 (2022)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. AAAI (2022)
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality. Discret. Appl. Math. 321 (2022)
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari
Winner Determination Algorithms for Graph Games with Matching Structures. CoRR (2022)
Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
Capacitated Network Design Games on a Generalized Fair Allocation Model. AAMAS (2022)
Tesshu Hanaka
Computing Densest k-Subgraph with Structural Parameters. CoRR (2022)
Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono
Winner Determination Algorithms for Graph Games with Matching Structures. IWOCA (2022)
Tesshu Hanaka, Michael Lampis
Hedonic Games and Treewidth Revisited. CoRR (2022)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR (2022)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
Finding Diverse Trees, Paths, and More. AAAI (2021)
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CIAC (2021)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304 (2021)
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
Computing L(p, 1)-Labeling with Combined Parameters. WALCOM (2021)
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
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83 (5) (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. Theor. Comput. Sci. 873 (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. CoRR (2021)
Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
Capacitated Network Design Games on a Generalized Fair Allocation Model. CoRR (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci. 865 (2021)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866 (2021)
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CoRR (2021)
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
(In)approximability of Maximum Minimal FVS. CoRR (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR (2020)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
Hedonic Seat Arrangement Problems. AAMAS (2020)
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
Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR (2020)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Graph Classes and Approximability of the Happy Set Problem. COCOON (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA (2020)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. 24 (3) (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
Finding Diverse Trees, Paths, and More. CoRR (2020)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Parameterized Algorithms for the Happy Set Problem. WALCOM (2020)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica 82 (9) (2020)
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
(In)approximability of Maximum Minimal FVS. ISAAC (2020)
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. SOFSEM (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. FAW (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability. CoRR (2020)
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
Reconfiguring spanning and induced subgraphs. Theor. Comput. Sci. 806 (2020)
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica 82 (12) (2020)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
Parameterized Orientable Deletion. Algorithmica 82 (7) (2020)
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
Computing L(p, 1)-Labeling with Combined Parameters. CoRR (2020)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
Hedonic Seat Arrangement Problems. CoRR (2020)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
An optimal algorithm for Bisection for bounded-treewidth graphs. CoRR (2020)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR (2019)
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC (2019)
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
On the maximum weight minimal separator. Theor. Comput. Sci. 796 (2019)
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR (2019)
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA (2019)
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
Computational Complexity of Hedonic Games on Sparse Graphs. CoRR (2019)
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
On directed covering and domination problems. Discret. Appl. Math. 259 (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. CoRR (2019)
Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
Optimal Partition of a Tree with Social Distance. WALCOM (2019)
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. CIAC (2019)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. WG (2019)
Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CIAC (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. CoRR (2019)
Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
Optimal Partition of a Tree with Social Distance. CoRR (2018)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
Parameterized Orientable Deletion. CoRR (2018)
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
Reconfiguring spanning and induced subgraphs. CoRR (2018)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. MFCS (2018)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
Parameterized Orientable Deletion. SWAT (2018)
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
Reconfiguring Spanning and Induced Subgraphs. COCOON (2018)
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
On the Maximum Weight Minimal Separator. TAMC (2017)
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
On Directed Covering and Domination Problems. ISAAC (2017)
Tesshu Hanaka, Hirotaka Ono
A Fixed-Parameter Algorithm for Max Edge Domination. SOFSEM (Student Research Forum Papers / Posters) (2015)