Tesshu Hanaka

131 papers A* 3A 3B 26C 8Misc 3Journal 83Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Core stability in additively separable hedonic games of low treewidth.
J. Comput. Syst. Sci.
Tesshu Hanaka, Noleen Köhler, Michael Lampis
2026 J jnl
Faster winner determination algorithms for (Colored) Arc Kayles.
J. Comput. Syst. Sci.
Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
2026 B conf
Finding a HIST: Chordality, Structural Parameters, and Diameter.
SOFSEM
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
2026 B conf
Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited.
WALCOM
Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk
2026 B conf
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion.
WALCOM
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff
2026 J jnl
Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs.
CoRR
Tesshu Hanaka, Nikolaos Melissinos, Hirotaka Ono
2026 J jnl
On the Complexity of Secluded Path Problems.
CoRR
Tesshu Hanaka, Daisuke Tsuru
2025 J jnl
An improved spectral lower bound of treewidth.
Inf. Process. Lett.
Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
2025 B conf
Broadcasting Under Structural Restrictions.
MFCS
Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025 J jnl
Broadcasting under Structural Restrictions.
CoRR
Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025 B conf
Colored Node Kayles: Algorithms and Computational Complexity.
PRIMA
Tesshu Hanaka, Hirotaka Ono, Kanae Yoshiwatari
2025 J jnl
Finding a HIST: Chordality, Structural Parameters, and Diameter.
CoRR
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
2025 J jnl
Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited.
CoRR
Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk
2025 J jnl
Finding a minimum spanning tree with a small non-terminal set.
Theor. Comput. Sci.
Tesshu Hanaka, Yasuaki Kobayashi
2025 J jnl
Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs.
Discret. Appl. Math.
Suguru Yamada, Tesshu Hanaka
2025 J jnl
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion.
CoRR
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff
2025 J jnl
Hedonic seat arrangement problems.
Auton. Agents Multi Agent Syst.
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2025 J jnl
Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs.
J. Comb. Optim.
Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
2025 B conf
On the Complexity of Locally Rainbow Path.
FCT
Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Shuya Yoshida
2025 B conf
On the Complexity of Minimising the Moving Distance for Dispersing Objects.
WADS
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2025 J jnl
On the Complexity of Minimising the Moving Distance for Dispersing Objects.
CoRR
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2025 B conf
On the Complexity of Secluded Path Problems.
IPEC
Tesshu Hanaka, Daisuke Tsuru
2025 J jnl
On the complexity of list H-packing for sparse graph classes.
Theor. Comput. Sci.
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 B conf
Structural Parameters for Steiner Orientation.
ISAAC
Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis
2025 J jnl
Structural Parameters for Steiner Orientation.
CoRR
Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis
2025 J jnl
Structural parameterizations of vertex integrity.
Theor. Comput. Sci.
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2024 — conf
Algorithms for Optimally Shifting Intervals Under Intersection Graph Models.
IJTCS-FAW
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2024 J jnl
An improved spectral lower bound of treewidth.
CoRR
Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
2024 B conf
Basis Sequence Reconfiguration in the Union of Matroids.
ISAAC
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito
2024 J jnl
Basis sequence reconfiguration in the union of matroids.
CoRR
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito
2024 J jnl
Collecting Balls on a Line by Robots with Limited Energy.
IEICE Trans. Inf. Syst.
Tesshu Hanaka, Nicolás Honorato Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi
2024 J jnl
Computational complexity of Turning Tiles.
Int. J. Game Theory
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Koki Suetsugu, Kanae Yoshiwatari
2024 B conf
Core Stability in Additively Separable Hedonic Games of Low Treewidth.
ISAAC
Tesshu Hanaka, Noleen Köhler, Michael Lampis
2024 J jnl
Core Stability in Additively Separable Hedonic Games of Low Treewidth.
CoRR
Tesshu Hanaka, Noleen Köhler, Michael Lampis
2024 B conf
Faster Winner Determination Algorithms for (Colored) Arc Kayles.
SOFSEM
Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
2024 C conf
Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs.
ISCO
Suguru Yamada, Tesshu Hanaka
2024 J jnl
Grouped domination parameterized by vertex cover, twin cover, and beyond.
Theor. Comput. Sci.
Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
2024 J jnl
On a Spectral Lower Bound of Treewidth.
IEICE Trans. Inf. Syst.
Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
2024 B conf
On the Complexity of List H-Packing for Sparse Graph Classes.
WALCOM
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2024 J jnl
On the complexity of finding a spanning even tree in a graph.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Atsuki Nagao, Hirotaka Ono, Kazuhisa Seto
2024 B conf
Parameterized Vertex Integrity Revisited.
MFCS
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari
2024 J jnl
Parameterized Vertex Integrity Revisited.
CoRR
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari
2024 J jnl
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP.
Int. J. Netw. Comput.
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
2024 B conf
Structural Parameterizations of Vertex Integrity.
WALCOM
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2024 J jnl
Winner Determination Algorithms for Graph Games with Matching Structures.
Algorithmica
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari
2023 A* conf
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.
AAAI
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2023 J jnl
Algorithms for Optimally Shifting Intervals under Intersection Graph Models.
CoRR
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2023 J jnl
Computing densest k-subgraph with structural parameters.
J. Comb. Optim.
Tesshu Hanaka
2023 J jnl
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144].
Theor. Comput. Sci.
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2023 J jnl
Finding a Minimum Spanning Tree with a Small Non-Terminal Set.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi
2023 C conf
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond.
CIAC
Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
2023 J jnl
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond.
CoRR
Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
2023 — conf
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs.
COCOA (1)
Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
2023 J jnl
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs.
CoRR
Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
2023 J jnl
New Results on Directed Edge Dominating Set.
Discret. Math. Theor. Comput. Sci.
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
2023 J jnl
On the complexity of list H-packing for sparse graph classes.
CoRR
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2023 B conf
Shortest Beer Path Queries Based on Graph Decomposition.
ISAAC
Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
2023 J jnl
Shortest Beer Path Queries based on Graph Decomposition.
CoRR
Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
2023 — conf
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP
IPDPS Workshops
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
2023 J jnl
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP.
CoRR
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
2023 J jnl
Structural Parameterizations of Vertex Integrity.
CoRR
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2023 J jnl
Turning Tiles is PSPACE-complete.
CoRR
Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono
2022 J jnl
(In)approximability of maximum minimal FVS.
J. Comput. Syst. Sci.
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2022 J jnl
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.
CoRR
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022 J jnl
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.
Theory Comput. Syst.
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022 A conf
Capacitated Network Design Games on a Generalized Fair Allocation Model.
AAMAS
Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
2022 J jnl
Computing Densest k-Subgraph with Structural Parameters.
CoRR
Tesshu Hanaka
2022 A* conf
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.
AAAI
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
2022 J jnl
Computing L(p, 1)-Labeling with Combined Parameters.
J. Graph Algorithms Appl.
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
2022 J jnl
Exploring the gap between treedepth and vertex cover through vertex integrity.
Theor. Comput. Sci.
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2022 A conf
Hedonic Games and Treewidth Revisited.
ESA
Tesshu Hanaka, Michael Lampis
2022 J jnl
Hedonic Games and Treewidth Revisited.
CoRR
Tesshu Hanaka, Michael Lampis
2022 J jnl
Parameterized Complexity of (A, ℓ )-Path Packing.
Algorithmica
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2022 J jnl
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality.
Discret. Appl. Math.
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
2022 C conf
Winner Determination Algorithms for Graph Games with Matching Structures.
IWOCA
Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono
2022 J jnl
Winner Determination Algorithms for Graph Games with Matching Structures.
CoRR
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari
2021 J jnl
A (probably) optimal algorithm for Bisection on bounded-treewidth graphs.
Theor. Comput. Sci.
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
2021 J jnl
Capacitated Network Design Games on a Generalized Fair Allocation Model.
CoRR
Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
2021 J jnl
Complexity and approximability of the happy set problem.
Theor. Comput. Sci.
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2021 J jnl
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
2021 B conf
Computing L(p, 1)-Labeling with Combined Parameters.
WALCOM
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
2021 J jnl
Computing the Largest Bond and the Maximum Connected Cut of a Graph.
Algorithmica
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
2021 C conf
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity.
CIAC
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2021 J jnl
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity.
CoRR
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2021 A* conf
Finding Diverse Trees, Paths, and More.
AAAI
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
2021 J jnl
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability.
Theor. Comput. Sci.
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
2021 J jnl
Parameterized algorithms for the Happy Set problem.
Discret. Appl. Math.
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2020 B conf
(In)approximability of Maximum Minimal FVS.
ISAAC
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2020 J jnl
(In)approximability of Maximum Minimal FVS.
CoRR
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2020 J jnl
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.
CoRR
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2020 Misc conf
An Optimal Algorithm for Bisection for Bounded-Treewidth Graph.
FAW
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
2020 J jnl
An optimal algorithm for Bisection for bounded-treewidth graphs.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone
2020 J jnl
Computing L(p, 1)-Labeling with Combined Parameters.
CoRR
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
2020 J jnl
Computing the Largest Bond and the Maximum Connected Cut of a Graph.
CoRR
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
2020 J jnl
Finding Diverse Trees, Paths, and More.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
2020 J jnl
Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
2020 Misc conf
Graph Classes and Approximability of the Happy Set Problem.
COCOON
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2020 A conf
Hedonic Seat Arrangement Problems.
AAMAS
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020 J jnl
Hedonic Seat Arrangement Problems.
CoRR
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020 J jnl
Independent Set Reconfiguration Parameterized by Modular-Width.
Algorithmica
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2020 B conf
Parameterized Algorithms for the Happy Set Problem.
WALCOM
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2020 C conf
Parameterized Complexity of (A, ℓ )-Path Packing.
IWOCA
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020 J jnl
Parameterized Complexity of (A, 𝓁)-Path Packing.
CoRR
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020 J jnl
Parameterized Complexity of Safe Set.
J. Graph Algorithms Appl.
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2020 J jnl
Parameterized Orientable Deletion.
Algorithmica
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2020 J jnl
Reconfiguring spanning and induced subgraphs.
Theor. Comput. Sci.
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
2020 J jnl
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
Algorithmica
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2020 B conf
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium.
SOFSEM
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi
2019 B conf
Computational Complexity of Hedonic Games on Sparse Graphs.
PRIMA
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
2019 J jnl
Computational Complexity of Hedonic Games on Sparse Graphs.
CoRR
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
2019 B conf
Independent Set Reconfiguration Parameterized by Modular-Width.
WG
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2019 J jnl
Independent Set Reconfiguration Parameterized by Modular-Width.
CoRR
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2019 J jnl
New Results on Directed Edge Dominating Set.
CoRR
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
2019 J jnl
On directed covering and domination problems.
Discret. Appl. Math.
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
2019 J jnl
On the maximum weight minimal separator.
Theor. Comput. Sci.
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
2019 B conf
Optimal Partition of a Tree with Social Distance.
WALCOM
Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
2019 B conf
Parameterized Algorithms for Maximum Cut with Connectivity Constraints.
IPEC
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
2019 J jnl
Parameterized Algorithms for Maximum Cut with Connectivity Constraints.
CoRR
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
2019 C conf
Parameterized Complexity of Safe Set.
CIAC
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2019 J jnl
Parameterized Complexity of Safe Set.
CoRR
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2019 C conf
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
CIAC
Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019 J jnl
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
CoRR
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2018 B conf
New Results on Directed Edge Dominating Set.
MFCS
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
2018 J jnl
Optimal Partition of a Tree with Social Distance.
CoRR
Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
2018 — conf
Parameterized Orientable Deletion.
SWAT
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2018 J jnl
Parameterized Orientable Deletion.
CoRR
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2018 Misc conf
Reconfiguring Spanning and Induced Subgraphs.
COCOON
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
2018 J jnl
Reconfiguring spanning and induced subgraphs.
CoRR
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
2017 B conf
On Directed Covering and Domination Problems.
ISAAC
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
2017 C conf
On the Maximum Weight Minimal Separator.
TAMC
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
2015 — conf
A Fixed-Parameter Algorithm for Max Edge Domination.
SOFSEM (Student Research Forum Papers / Posters)
Tesshu Hanaka, Hirotaka Ono