Research
International Workshops and Meetings
- Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “The Hardness of Frequent Ordered Tree Mining on Bounded-Height Trees”. The 26th Korea–Japan Joint Workshop on Algorithms and Computation (WAAC2026). 2026.
- Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees”. International Workshop on Discrete Mathematics and Algorithms 2026 (DMA2026). 2026.
Domestic Workshops and Meetings
- Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees”. Enumeration Algorithms Seminar, 2026.
- Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees”. 207th Algorithms Research Meeting, 2026.
- Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Computational Complexity of Maximal/Closed Frequent Subtree Mining for Rooted Trees with Constant Height”. 205th Algorithms Research Meeting, 2025.
- Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Polynomial-delay Enumeration of Frequent Closed Subtrees in Rooted Trees of Height 2”. LA Symposium Summer 2025, 2025.
- Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Computational Complexity of Maximal Frequent Subtree Mining for Labeled Trees”. Enumeration Algorithms Seminar, 2025.
- 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, 2025.
Preprint
- Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees”. arXiv
Experience
Graduated from the Department of Natural Science Informatics, School of Informatics, Nagoya University.
Industry Experience
- LY Corporation — Backend Engineer Intern
- AVILEN Inc. — Backend Engineer
- AIxtal Inc. — Data Scientist
- Nagoya University NUOCW Project — Backend Engineer (Part-time)