Hiroshi Eto

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 21

Top Topics

Equivalence Class

Independent Set

Top Venues

Theor. Comput. Sci.

Publications

Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir
Directed Path Partition Problem on Directed Acyclic Graphs. IWOCA (2024)
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. WALCOM (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)
Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
Approximation Algorithms for the Longest Run Subsequence Problem. CPM (2023)
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
Happy Set Problem on Subclasses of Co-comparability Graphs. Algorithmica 85 (11) (2023)
Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue
Independent Set Under a Change Constraint from an Initial Solution. CIAC (2023)
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
Happy Set Problem on Subclasses of Co-comparability Graphs. WALCOM (2022)
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2022)
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
Reconfiguration of Regular Induced Subgraphs. WALCOM (2022)
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
Reconfiguration of Regular Induced Subgraphs. CoRR (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)
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)
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)
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)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Parameterized Algorithms for the Happy Set Problem. WALCOM (2020)
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC (2019)
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR (2019)
Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue
Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes. IEICE Trans. Inf. Syst. (3) (2018)
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. WALCOM (2017)
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. COCOA (2016)
Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distance- $$d$$ independent set problems for bipartite and chordal graphs. J. Comb. Optim. 27 (1) (2014)
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of finding maximum regular induced subgraphs with prescribed degree. Theor. Comput. Sci. 550 (2014)
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. FCT (2013)
Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
-Regular Induced Connected Subgraph Problems. IEICE Trans. Inf. Syst. (3) (2013)
Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distance-d Independent Set Problems for Bipartite and Chordal Graphs. COCOA (2012)