Affiliation: Master's Program in Mathematical Informatics, Graduate School of Informatics, Nagoya University
Research interests: Graph algorithms, enumeration algorithms.
Contact: contact@pwll.dev
Research
International Workshops and Meetings
Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “The Complexity of Maximal/Closed Frequent Tree Mining on Bounded Height Trees”. Workshop on Enumeration Problems and Applications (WEPA2026). Marseille, France, November 6, 2026.
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). Busan, Korea, August 20, 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). Matsue, Japan, March 17, 2026.
Domestic Workshops and Meetings
Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Computational Complexity of Maximal Frequent Subtree Mining for Rooted Trees of Constant Height”. Enumeration Algorithms Seminar. Kitsuki, Oita, Japan, March 20, 2026.
Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees”. 207th Algorithms Research Meeting. March 9, 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. November 13, 2025.
Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Polynomial-delay Enumeration of Frequent Closed Subtrees in Rooted Trees of Height 2”. LA Symposium Summer 2025. July 24, 2025.
Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “Computational Complexity of Maximal Frequent Subtree Mining for Labeled Trees”. Enumeration Algorithms Seminar. March 5, 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. March 1, 2025.
Preprint
Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono. “The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees”. arXiv
Experience
March 2025: Graduated from the Department of Natural Science Informatics, School of Informatics, Nagoya University.
March 2027 (expected): Complete the Master’s Program in Mathematical Informatics, Graduate 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)