Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems. - Yuichi Asahiro; Hiroshi Eto; Eiji Miyano (IEICE Trans. Inf. Syst., 2013)

Distance- $$d$$ independent set problems for bipartite and chordal graphs. - Hiroshi Eto; Fengrui Guo; Eiji Miyano (J. Comb. Optim., 2014)

Complexity of finding maximum regular induced subgraphs with prescribed degree. - Yuichi Asahiro; Hiroshi Eto; Takehiro Ito; Eiji Miyano (Theor. Comput. Sci., 2014)

Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. - Hiroshi Eto; Takehiro Ito; Zhilong Liu; Eiji Miyano (WALCOM, 2017)

Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes. - Hiroshi Eto; Hiroyuki Kawahara; Eiji Miyano; Natsuki Nonoue (IEICE Trans. Inf. Syst., 2018)

Parameterized Algorithms for Maximum Cut with Connectivity Constraints. - Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001 (IPEC, 2019)

Graph Classes and Approximability of the Happy Set Problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (COCOON, 2020)

Computing the Largest Bond and the Maximum Connected Cut of a Graph. - Gabriel L. Duarte; Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Daniel Lokshtanov; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Uéverton S. Souza (Algorithmica, 2021)

Parameterized algorithms for the Happy Set problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (Discret. Appl. Math., 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)

Reconfiguration of Regular Induced Subgraphs. - Hiroshi Eto; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi; Kunihiro Wasa (WALCOM, 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., 2022)

Independent Set Under a Change Constraint from an Initial Solution. - Yuichi Asahiro; Hiroshi Eto; Kana Korenaga; Guohui Lin; Eiji Miyano; Reo Nonoue (CIAC, 2023)

Approximation Algorithms for the Longest Run Subsequence Problem. - Yuichi Asahiro; Hiroshi Eto; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Shunichi Tanaka (CPM, 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., 2023)

Happy Set Problem on Subclasses of Co-comparability Graphs. - Hiroshi Eto; Takehiro Ito; Eiji Miyano; Akira Suzuki 001; Yuma Tamura (Algorithmica, 2023)

Directed Path Partition Problem on Directed Acyclic Graphs. - Hiroshi Eto; Shunsuke Kawaharada; Guohui Lin; Eiji Miyano; Tugce Ozdemir (IWOCA, 2024)

Reconfiguration of vertex-disjoint shortest paths on graphs. - Rin Saito; Hiroshi Eto; Takehiro Ito; Ryuhei Uehara (J. Graph Algorithms Appl., 2024)

Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs. - Yuichi Asahiro; Hiroshi Eto; Guohui Lin; Eiji Miyano; Yudai Oka (CIAC (2), 2025)