Pureに変更を加えた場合、すぐここに表示されます。

Fingerprint Hiroshi Etoが取り組む研究トピックをご確認ください。これらのトピックラベルは、この人物の研究に基づいています。これらを共に使用することで、固有の認識が可能になります。

  • 4 同様のプロファイル
Polynomials Engineering & Materials Science
Independent Set Mathematics
Chordal Graphs Mathematics
Bipartite Graph Mathematics
Approximation algorithms Engineering & Materials Science
Induced Subgraph Mathematics
Graph in graph theory Mathematics
Approximation Algorithms Mathematics

ネットワーク 最近の共同研究。丸をクリックして詳細を確認しましょう。

研究成果 2012 2019

  • 26 引用
  • 3 h指数
  • 5 会議での発言
  • 4 記事

Parameterized algorithms for maximum cut with connectivity constraints

Eto, H., Hanaka, T., Kobayashi, Y. & Kobayashi, Y., 12 2019, 14th International Symposium on Parameterized and Exact Computation, IPEC 2019. Jansen, B. M. P. & Telle, J. A. (版). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13. (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 148).

研究成果: 著書/レポートタイプへの貢献会議での発言

Computational complexity
Polynomials

Complexity of the minimum single dominating cycle problem for graph classes

Eto, H., Kawahara, H., Miyano, E. & Nonoue, N., 3 2018, : : IEICE Transactions on Information and Systems. E101D, 3, p. 574-581 8 p.

研究成果: ジャーナルへの寄稿記事

3 引用 (Scopus)

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

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Cubic Graph
Approximation algorithms
Independent Set
Approximation Algorithms
Computational complexity
5 引用 (Scopus)

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

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Approximability
Approximation algorithms
Independent Set
Regular Graph
Planar graph
1 引用 (Scopus)

Complexity of finding maximum regular induced subgraphs with prescribed degree

Asahiro, Y., Eto, H., Ito, T. & Miyano, E., 1 1 2014, : : Theoretical Computer Science. 550, C, p. 21-35 15 p.

研究成果: ジャーナルへの寄稿記事

Induced Subgraph
Polynomials
Graph in graph theory
NP-complete problem
Bounded Treewidth