Research Output per year

## Fingerprint Dive into the research topics where Hiroshi Eto is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

- 4 Similar Profiles

Independent Set
Mathematics

Polynomials
Engineering & Materials Science

Chordal Graphs
Mathematics

Bipartite Graph
Mathematics

Approximation algorithms
Engineering & Materials Science

Induced Subgraph
Mathematics

Graph in graph theory
Mathematics

Approximation Algorithms
Mathematics

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Research Output 2012 2018

### Complexity of the minimum single dominating cycle problem for graph classes

Eto, H., Kawahara, H., Miyano, E. & Nonoue, N., Mar 1 2018, In : IEICE Transactions on Information and Systems. E101D, 3, p. 574-581 8 p.Research output: Contribution to journal › Article

3
Citations
(Scopus)

### Approximation algorithm for the distance-3 independent set problem on cubic graphs

Eto, H., Ito, T., Liu, Z. & Miyano, E., Jan 1 2017,*WALCOM: Algorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings.*Rahman, M. S., Yen, H-C. & Poon, S-H. (eds.). Springer Verlag, p. 228-240 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10167 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Cubic Graph

Approximation algorithms

Independent Set

Approximation Algorithms

Computational complexity

5
Citations
(Scopus)

### Approximability of the distance independent set problem on regular graphs and planar graphs

Eto, H., Ito, T., Liu, Z. & Miyano, E., Jan 1 2016,*Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings.*Li, M., Wang, L. & Chan, T-H. H. (eds.). Springer Verlag, p. 270-284 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10043 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Approximability

Approximation algorithms

Independent Set

Regular Graph

Planar graph

1
Citation
(Scopus)

### Complexity of finding maximum regular induced subgraphs with prescribed degree

Asahiro, Y., Eto, H., Ito, T. & Miyano, E., Jan 1 2014, In : Theoretical Computer Science. 550, C, p. 21-35 15 p.Research output: Contribution to journal › Article

Induced Subgraph

Polynomials

Graph in graph theory

NP-complete problem

Bounded Treewidth

10
Citations
(Scopus)

### Distance-d independent set problems for bipartite and chordal graphs

Eto, H., Guo, F. & Miyano, E., Jan 1 2014, In : Journal of Combinatorial Optimization. 27, 1, p. 88-99 12 p.Research output: Contribution to journal › Article

Chordal Graphs

Independent Set

Bipartite Graph

Hardness

NP-complete problem