KOMOTO Kenta

甲本 健太

JP EN

Affiliation: Master's Program in Mathematical Informatics, Graduate School of Informatics, Nagoya University

Email: komoto.kenta.v1(at)s.mail.nagoya-u.ac.jp

Research

Domestic Workshops and Meetings (Non-peer-reviewed)

  1. Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees”. Algorithms Research Meeting, Okayama, March 9, 2026.
  2. Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Computational Complexity of Maximal/Closed Frequent Subtree Mining for Rooted Trees with Constant Height”. Algorithms Research Meeting, Kochi, November 13, 2025.
  3. Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Polynomial-delay Enumeration of Frequent Closed Subtrees in Rooted Trees of Height 2”. LA Symposium Summer 2025, Iwate, July 23, 2025.
  4. Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Computational Complexity of Maximal Frequent Subtree Mining for Labeled Trees”. Enumeration Algorithms Seminar, Gunma, March 6, 2025.
  5. Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Computational Complexity of Maximal Frequent Induced Subtree Mining for Labeled Trees”. 52nd Chubu Branch Conference of the Operations Research Society of Japan, Aichi, March 1, 2025.

Preprint

  1. Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees”. arXiv

Work Experience

Internships

Education

Certifications