Research field (3):
Mathematical informatics
, Intelligent informatics
, Information theory
Research theme for competitive and other funds (8):
2023 - 2028 離散最適化問題に対する多様な解発見のためのアルゴリズム理論基盤の構築
2020 - 2025 Development of Next-generation Semi-Structured Data Mining Technology Towards The Real-World Knowledge Creation Infrastructure
2021 - 2024 高次元ブール値テンソルデータからの多項閉集合を用いた知識発見
2020 - 2023 計算機科学アプローチによる組合せ遷移の展開:アルゴリズムの自動生成に向けて
2020 - 2023 グラフの木分解を用いた高速なメタアルゴリズムの研究
2017 - 2020 Properties of Weakly Closed Itemsets and their Application to Knowledge Discovery
2014 - 2017 Knowledge Discovery Methods based on Closed Set Construction for Data with Attributes Whose Values are from Ordered Sets
2014 - 2016 Exact algorithms for Sugiyama method in layered graph drawings
Show all
Papers (58):
AOIKE Yuuki, KIYOMI Masashi, KOBAYASHI Yasuaki, OTACHI Yota. Finding a Reconfiguration Sequence between Longest Increasing Subsequences. IEICE Transactions on Information and Systems. 2024. E107.D. 4. 559-563
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa. Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR. 2024. abs/2405.13613
Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura. Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM. 2024. 27:1-27:19
藤原優, 吉岡和希, 小林靖明. A fast algorithm for a relaxation problem to Graph Partitioning Problem on vertex-signed graphs with connectivity constraints. 人工知能学会人工知能基本問題研究会資料. 2023. 126. 44-48