Tesshu Hanaka
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
41
Venues
16
Active years
2015–2026
Best venue rank
A*
Where they publish
Papers
41 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SOFSEM | Finding a HIST: Chordality, Structural Parameters, and Diameter. | Tesshu Hanaka, Hironori Kiya, Hirotaka Ono |
| 2026 | WALCOM | Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion. | Nicols Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff |
| 2026 | WALCOM | Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited. | Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk |
| 2025 | FCT | On the Complexity of Locally Rainbow Path. | Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Shuya Yoshida |
| 2025 | ISAAC | Structural Parameters for Steiner Orientation. | Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis |
| 2025 | MFCS | Broadcasting Under Structural Restrictions. | Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2025 | PRIMA | Colored Node Kayles: Algorithms and Computational Complexity. | Tesshu Hanaka, Hirotaka Ono, Kanae Yoshiwatari |
| 2025 | WADS | On the Complexity of Minimising the Moving Distance for Dispersing Objects. | Nicols Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono |
| 2024 | FAW | Algorithms for Optimally Shifting Intervals Under Intersection Graph Models. | Nicols Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono |
| 2024 | ISAAC | Basis Sequence Reconfiguration in the Union of Matroids. | Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito |
| 2024 | ISAAC | Core Stability in Additively Separable Hedonic Games of Low Treewidth. | Tesshu Hanaka, Noleen Khler, Michael Lampis |
| 2024 | MFCS | Parameterized Vertex Integrity Revisited. | Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari |
| 2024 | SOFSEM | Faster Winner Determination Algorithms for (Colored) Arc Kayles. | Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari |
| 2024 | WALCOM | Structural Parameterizations of Vertex Integrity. | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi |
| 2024 | WALCOM | 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 |
| 2023 | AAAI | 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 |
| 2023 | CIAC | Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. | Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda |
| 2023 | COCOA | Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs. | Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono |
| 2023 | ISAAC | Shortest Beer Path Queries Based on Graph Decomposition. | Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama |
| 2022 | AAAI | Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. | Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi |
| 2022 | ESA | Hedonic Games and Treewidth Revisited. | Tesshu Hanaka, Michael Lampis |
| 2022 | IWOCA | Winner Determination Algorithms for Graph Games with Matching Structures. | Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono |
| 2021 | AAAI | Finding Diverse Trees, Paths, and More. | Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi |
| 2021 | CIAC | Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. | Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi |
| 2021 | WALCOM | Computing L(p, 1)-Labeling with Combined Parameters. | Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono |
| 2020 | COCOON | Graph Classes and Approximability of the Happy Set Problem. | Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
| 2020 | FAW | An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. | Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone |
| 2020 | ISAAC | (In)approximability of Maximum Minimal FVS. | Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos |
| 2020 | IWOCA | Parameterized Complexity of (A, ℓ )-Path Packing. | Rmy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2020 | SOFSEM | Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. | Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi |
| 2020 | WALCOM | Parameterized Algorithms for the Happy Set Problem. | Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
| 2019 | CIAC | Parameterized Complexity of Safe Set. | Rmy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2019 | CIAC | Subgraph Isomorphism on Graph Classes that Exclude a Substructure. | Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden |
| 2019 | PRIMA | Computational Complexity of Hedonic Games on Sparse Graphs. | Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono |
| 2019 | WALCOM | Optimal Partition of a Tree with Social Distance. | Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono |
| 2019 | WG | Independent Set Reconfiguration Parameterized by Modular-Width. | Rmy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2018 | COCOON | Reconfiguring Spanning and Induced Subgraphs. | Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan |
| 2018 | MFCS | New Results on Directed Edge Dominating Set. | Rmy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis |
| 2017 | ISAAC | On Directed Covering and Domination Problems. | Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono |
| 2017 | TAMC | On the Maximum Weight Minimal Separator. | Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono |
| 2015 | SOFSEM | A Fixed-Parameter Algorithm for Max Edge Domination. | Tesshu Hanaka, Hirotaka Ono |