The Graduate University for Advanced Studies, SOKENDAI · National Institute of Informatics

Research keywordsgraph algorithms・graphlets・longest common subsequences・graph bond enumeration・combinatorial optimization・Twitter topic analysis

This is a public-data preview. Personalized fit, contact angles, and saved workflows require sign-in.

• Finding Diverse Strings and Longest Common Subsequences in a Graph. DOI: 10.4230/LIPIcs.CPM.2024.27 出版年: 2024 ジャーナル名: CPM URL: https://researchmap.jp/uno/published_papers/468564152024 · 論文一覧（最新5件）
• Listing the bonds of a graph in O(n~)–delay DOI: 10.1016/j.dam.2024.01.004 出版年: 2024 ジャーナル名: Discrete Applied Mathematics URL: https://researchmap.jp/uno/published_papers/493262212024 · 論文一覧（最新5件）
• Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. DOI: 10.48550/arXiv.2405.13613 出版年: 2024 ジャーナル名: CoRR URL: https://researchmap.jp/uno/published_papers/468564182024 · 論文一覧（最新5件）
• 出版年: 20242024 · 論文一覧（最新5件）

• Official profile