Hiroshi Eto

According to our database, Hiroshi Eto authored at least 18 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Reconfiguration of vertex-disjoint shortest paths on graphs.

Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara

J. Graph Algorithms Appl., 2024

Directed Path Partition Problem on Directed Acyclic Graphs.

Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023

Happy Set Problem on Subclasses of Co-comparability Graphs.

Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura

Algorithmica, November, 2023

Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144].

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Theor. Comput. Sci., October, 2023

Approximation Algorithms for the Longest Run Subsequence Problem.

Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Independent Set Under a Change Constraint from an Initial Solution.

Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs.

Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

Reconfiguration of Regular Induced Subgraphs.

Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

Complexity and approximability of the happy set problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Theor. Comput. Sci., 2021

Parameterized algorithms for the Happy Set problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Discret. Appl. Math., 2021

Computing the Largest Bond and the Maximum Connected Cut of a Graph.

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

Algorithmica, 2021

2020

Graph Classes and Approximability of the Happy Set Problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Parameterized Algorithms for Maximum Cut with Connectivity Constraints.

Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes.

Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue

IEICE Trans. Inf. Syst., 2018

2017

Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs.

Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

Proceedings of the WALCOM: Algorithms and Computation, 2017

2014

Complexity of finding maximum regular induced subgraphs with prescribed degree.

Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano

Theor. Comput. Sci., 2014

Distance- $$d$$ independent set problems for bipartite and chordal graphs.

Hiroshi Eto, Fengrui Guo, Eiji Miyano

J. Comb. Optim., 2014

2013

Inapproximability of Maximum <i>r</i>-Regular Induced Connected Subgraph Problems.

Yuichi Asahiro, Hiroshi Eto, Eiji Miyano

IEICE Trans. Inf. Syst., 2013