Rchr
J-GLOBAL ID:201601002248769544
Update date: Mar. 11, 2024
Kobayashi Yasuaki
Kobayashi Yasuaki
Contact this researcher
You can send email directly to the researcher.
Affiliation and department:
Hokkaido University
About Hokkaido University
Search "Hokkaido University"
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 (55):
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001. On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM. 2024. 421-435
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi. Structural Parameterizations of Vertex Integrity. WALCOM2024, LNCS. 2024. 14549. 406-420
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki. Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. CoRR. 2023. abs/2312.10599
Tesshu Hanaka, Yasuaki Kobayashi. Finding a Minimum Spanning Tree with a Small Non-Terminal Set. CoRR. 2023. abs/2310.05494
Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi. Finding a reconfiguration sequence between longest increasing subsequences. CoRR. 2023. abs/2310.01066
more...
MISC (56):
藤原 優, 吉岡 和希, 小林 靖明. 連結制約のある頂点符号付きグラフ分割問題の緩和問題に対する高速なアルゴリズム. 人工知能学会研究会資料 人工知能基本問題研究会. 2023. 126. 44-48
小林 靖明, 栗田 和宏. 要素数制約付き極小辺被覆の多項式遅延列挙. 人工知能学会研究会資料 人工知能基本問題研究会. 2023. 126. 39-43
小林 靖明. 組合せゲームにおけるアルゴリズムと計算量-特集 パズルの発想. オペレーションズ・リサーチ = Communications of the Operations Research Society of Japan : 経営の科学. 2023. 68. 3. 131-137
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki. Reconfiguration of Time-Respecting Arborescences. CoRR. 2023. abs/2305.07262
Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi. Minimum Consistent Subset for Trees Revisited. CoRR. 2023. abs/2305.07259
more...
Professional career (1):
博士(理学) (明治大学)
Awards (6):
2024 - WALCOM 2024 Best Paper Award
2021 - 人工知能学会 研究会優秀賞
2019 - IWOCA 2019 Best Paper Award
2017 - The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge Track B, 1st place
2014 - 情報処理学会 コンピューターサイエンス領域奨励賞
2012 - 日本オペレーションズ・リサーチ学会 「OR横断若手の会研究部会」 学生優秀発表賞
Show all
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in
researchmap
.
For details, see here
.
Return to Previous Page
TOP
BOTTOM