Published list of Hiroshi Eto

Refereed  journals

1. Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara, Reconfiguration of vertex-disjoint shortest paths on graphs. J. Graph Algorithms Appl. 28(3): 87-101 (2024)[LINK]

2. Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura, Happy Set Problem on Subclasses of Co-comparability Graphs. Algorithmica 85(11): 3327-3347 (2023)

3. 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: 114114 (2023)

4. Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano,  Approximability of the distance independent set problem on regular graphs and planar graphs.  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, (2022) , [LINK]

5. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru, "Parameterized algorithms for the Happy Set problem." Discrete Applied Mathematics. Vol. 304: pp.32-44 (2021)[LINK]

6. Gabriel L Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton LC Pedrosa, Rafael CS Schouery, Uéverton S Souza, "Computing the Largest Bond and the Maximum Connected Cut of a Graph",  Algorithmica, Vol. 83, No.5,  pp.1421-1458 (2021),[LINK]

7. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru, "Complexity and approximability of the happy set problem". Theoretical Computer Science. Vol.866,  pp.123-144 (2021)[LINK]

8. Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue, "Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes".,IEICE TRANSACTIONS on Information and Systems, Vol.E101-D, No.3, pp.574-581(Marchi 1,2018),[LINK]

9. Yuichi Asahiro, Hiroshi Eto, Eiji Miyano, Takehiro Ito. "Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree". Theoretical Computer Science, Vol.550, No.18, pp.21-35 (September 18, 2014),[LINK]

10. Hiroshi Eto, Fengrui Guo, Eiji Miyano. "Distance-d Independent Set Problems for Bipartite and Chordal Graphs". Journal of Combinatorial Optimization, Vol.27, Issue 1, pp.88-99 (January 2014),[LINK]

11. Yuichi Asahiro, Hiroshi Eto, Eiji Miyano. "Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems". IEICE Transactions on Information and Systems, Vol.E96-D, No.3, pp.443-449 (March 2013),[LINK]

Refereed Conferences Proceedings

1. Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir, Directed Path Partition Problem on Directed Acyclic Graphs. IWOCA 2024: 314-326

2. Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue, Independent Set Under a Change Constraint from an Initial Solution. CIAC 2023: 37-51

3. 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: 2:1-2:12

4. Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara, Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs, Proc. 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), LNCS, Vol.13973, pp191--201

5. Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, and Kunihiro Wasa. Reconfiguration of Regular Induced Subgraphs, Proc. 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), LNCS Vol.13174, pp.35-46, [LINK]

6. Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura,  Happy Set Problem on Subclasses of Co-comparability Graphs, Proc. 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), LNCS Vol.13174, pp.149-160, [LINK]

7. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru. Graph classes and approximability of the happy set problem. Proc. 16th International Computing and Combinatorics Conference (COCOON 2020), LNCS12273, pp.335-346, Georgia State University, Atlanta, GA, USA (Fully Online, August 29 – August 31, 2020).

8. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru. Parameterized algorithms for the happy set problem. Proc. 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020), LNCS12049, pp.323-328, Institute for Mathematical Sciences, National University of Singapore (March 31 – April 2, 2020).

9. Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi: “Parameterized Algorithms for Maximum Cut with Connectivity Constraints”, In: Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Vol. 148 of Leibniz International Proceedings in Informatics (LIPIcs), 12:1--12:15, Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2019. 

10. Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano. Approximation algorithm for the distance-3 independent set problem on cubic graphs. Proc. 11th International Conference and Workshops on Algorithms and Computation (WALCOM2017), LNCS10167, pp.228-240, Microelectronics and Information System Research Center, National Chiao Tung University, Hsinchu, Taiwan (March 29 - 31, 2017). DOI:10.1007/978-3-319-53925-6_18

11. Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano. Approximability of the distance independent set problem on regular graphs and planar graphs. Proc. 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA2016), LNCS10043, pp.270-284, City University of Hong Kong, Hong Kong, China (December 16 ? 18, 2016). DOI:10.1007/978-3-319-48749-6_20

12. (Preliminary Version) Yuichi Asahiro, Hiroshi Eto, Eiji Miyano, Takehiro Ito. Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. Proc. 19th International Symposium on Fundamentals of Computation Theory (FCT 2013), LNCS 8070, pp.28-39, Crowne Plaza Liverpool, Liverpool, United Kingdom (August 2013)

13. (Preliminary Version) Hiroshi Eto, Fengrui Guo, Eiji Miyano. Distance-d Independent Set Problems for Bipartite and Chordal Graphs. Proc. 6th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2012), LNCS 7402, pp.234-244, Banff Centre, Banff, Canada (August 2012)

14. (Preliminary Version) Yuichi Asahiro, Hiroshi Eto, Eiji Miyano. Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems. Proc. the 2011 International Conference of Foundation of Computer Science (FCS’2011), pp.102-107, Las Vegas, Nevada, USA (July 2011)

Talks in International Workshops/Meetings

1. Yuichi Asahiro, Hiroshi Eto,◎Taku Kato, Guohui Lin and Eiji Miyano Bounded-Deletion Maximum Independent Set Problem on Chordal Bipartite Graphs.  The 15th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC2024),May 31 and June 1 , Osaka Metropolitan University, Osaka 

2. Hiroshi Eto, Hironori Kiya, Hirotaka Ono. Hardness Results on Generalized Puyopuyo(one-page abstract), The 14th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC2021), October 22- 24 , National Cheng Kung University, Tainan, Taiwan (October 2021)

3. Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano. An improved approximation algorithm for the distance-3 independent set problem on cubic graphs (one-page abstract). The 10th Asian Association for Algorithms and Computation Annual Meeting (AAAC17), May 5-7, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong (May 2017)

4. Hiroshi Eto, Tesshu Hanaka. On the Maximum Induced Subgraph Problem with the Grid and Cycle  (one-page abstract). The 10th Asian Association for Algorithms and Computation Annual Meeting (AAAC17), May 5-7, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong (May 2017)

5. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano. Regular induced subgraphs in bipartite and planar graphs.Proc. 19th Japan-Korean Joint Workshop on Algorithms and Computation (WAAC 2016), 43-1-8, August 30-31, Hakodate Citizen Hall, Hakodate, Hokkaido, Japan (August 2016)

6. Hiroshi Eto, Zhilong Liu, Eiji Miyano. Simple approximation algorithms for the distance-3 independent set problem on cubic graphs (one-page abstract). The 9th Asian Association for Algorithms and Computation Annual Meeting (AAAC16), p.xx, May 14-16, Taipei, Taiwan (May 2016)

7. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano. Maximum r-Regular Induced Subgraph Problems for Chordal Bipartite Graphs (one-page abstract). Seventh Asian Association for Algorithms and Computation Annual Meeting (AAAC14), Page 18, May 17-19, Hangzhou, China (May 2014)

8. Yuichi Asahiro, Hiroshi Eto, Eiji Miyano. Improved Inapproximability of Regular Induced Connected Subgraph Problems. Proc. The 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012), pp.161-168, July 10-11, National Institute of Informatics, Tokyo, Japan (July 2012)

9. Yuichi Asahiro, Hiroshi Eto, Eiji Miyano. W[1]-Hardness of Regular Induced Connected Subgraph Problems (one-page abstract). Fifth Asian Association for Algorithms and Computation Annual Meeting (AAAC12), Page 19, April 21-22, Fundan University, Shanghai, China (April 2012)

10. Hiroshi Eto, Fengrui Guo, Eiji Miyano. Distance-d Independent Set Problems (one-page abstract). Fifth Asian Association for Algorithms and Computation Annual Meeting (AAAC12), Page 20, April 21-22, Fundan University, Shanghai, China (April 2012)

Invited Talks 

1. Complexity of Finding Subgraphs with Prescribed Degree ,Japan-Korea workshop on algebra and combinatorics 2017 , Kumamoto University, (February,2017)