Kyushu University Academic Staff Educational and Research Activities Database
Researcher information (To researchers) Need Help? How to update
Eto Hiroshi Last modified date:2018.06.28



Graduate School
経済学研究院・経済工学部門


E-Mail
Academic Degree
Doctor of Computer Science
Field of Specialization
Combinatorial Optimization
Research
Research Interests
  • Discrete Mathematics
    keyword : Graph theory
    2010.06~2019.03.
Academic Activities
Papers
1. Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue, Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes., IEICE Transactions, 101-D(3): 574-581, 2018.04.
2. Yuichi Asahiro, Eto Hiroshi, Ito Takehiro, Eiji Miyano, Complexity of finding maximum regular induced subgraphs with prescribed degree, Theor. Comput. Sci. 550, DOI: 10.1016/j.tcs.2014.07.008, 21-35, 2014.07.
3. Eto Hiroshi, Fengrui Guo, Eiji Miyano, Distance-d Independent Set Problems for Bipartite and Chordal Graphs, Journal of Combinatorial Optimization, 27, 1, 88-99, 2014.01.
4. Eto Hiroshi, Yuichi Asahiro, Eiji Miyano, Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems, IEICE Transactions on Information and Systems, Vol.E96-D, No.3, 443-449, 2013.03.
Presentations
1. Eto Hiroshi, Ito Takehiro, 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, 2017.03, [URL].
2. Eto Hiroshi, Complexity of Finding Subgraphs with Prescribed Degrees, Japan-Korea workshop on algebra and combinatorics, 2017.02, [URL].
3. Yuichi ASAHIRO, Eto Hiroshi, Ito Takehiro, Eiji Miyano, Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree,, Proc. 19th International Symposium on Fundamentals of Computation Theory, 2013.08, [URL].