Hiroshi Eto

31 papers B 9C 4Misc 1Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2025 — conf
Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs.
CIAC (2)
Yuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano, Yudai Oka
2025 — conf
Happy Vertex Game.
CANDAR
Hiroshi Eto, Akiko Fujimoto, Hironori Kiya, Ruka Matsushita, Eiji Miyano, Yuto Murao, Toshiki Saitoh
2025 J jnl
Hardness Results on Generalized Puyo Puyo.
J. Inf. Process.
Hiroshi Eto, Hironori Kiya, Hirotaka Ono
2025 B conf
On the Complexity of Locally Rainbow Path.
FCT
Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Shuya Yoshida
2024 C conf
Directed Path Partition Problem on Directed Acyclic Graphs.
IWOCA
Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir
2024 J jnl
Reconfiguration of vertex-disjoint shortest paths on graphs.
J. Graph Algorithms Appl.
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
2023 B conf
Approximation Algorithms for the Longest Run Subsequence Problem.
CPM
Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
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
Happy Set Problem on Subclasses of Co-comparability Graphs.
Algorithmica
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
2023 C conf
Independent Set Under a Change Constraint from an Initial Solution.
CIAC
Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue
2023 B conf
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs.
WALCOM
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
2022 J jnl
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
2022 B conf
Happy Set Problem on Subclasses of Co-comparability Graphs.
WALCOM
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
2022 B conf
Reconfiguration of Regular Induced Subgraphs.
WALCOM
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
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 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 J jnl
Parameterized algorithms for the Happy Set problem.
Discret. Appl. Math.
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2021 J jnl
Reconfiguration of Regular Induced Subgraphs.
CoRR
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
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 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 B conf
Parameterized Algorithms for the Happy Set Problem.
WALCOM
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
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
2018 J jnl
Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes.
IEICE Trans. Inf. Syst.
Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue
2017 B conf
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs.
WALCOM
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
2016 C conf
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs.
COCOA
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
2014 J jnl
Complexity of finding maximum regular induced subgraphs with prescribed degree.
Theor. Comput. Sci.
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
2014 J jnl
Distance- $$d$$ independent set problems for bipartite and chordal graphs.
J. Comb. Optim.
Hiroshi Eto, Fengrui Guo, Eiji Miyano
2013 B conf
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree.
FCT
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
2013 J jnl
Inapproximability of Maximum
IEICE Trans. Inf. Syst.
Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
2012 C conf
Distance-d Independent Set Problems for Bipartite and Chordal Graphs.
COCOA
Hiroshi Eto, Fengrui Guo, Eiji Miyano