小林佑輔Yusuke Kobayashi

京都大学 · 数理解析研究所 · 准教授

留学神社

基础信息

京都大学 · 数理解析研究所 · 准教授

研究关键词parameterized complexity・graph algorithms・additive spanners・graph reconfiguration・matroid pricing・path packing・double-threshold graphs

以下为公开数据预览。个性化匹配理由、联系角度和保存能力需要登录后使用。

On Reachable Assignments Under Dichotomous Preferences2022 · PRIMA 2022: Principles and Practice of Multi-Agent Systems,
An FPT Algorithm for Minimum Additive Spanner Problem.2020 · Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020),
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles.2020 · Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020),
Shortest Reconfiguration of Colorings Under Kempe Changes.2020 · Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020),

下一步

个性化匹配理由、联系角度与收藏保存需要登录后使用。

留学神社 · 公开教授档案

Public Professor Archive

京都大学 · 数理解析研究所 · 准教授

留学神社

京都大学 · 数理解析研究所 · 准教授

研究关键词parameterized complexity・graph algorithms・additive spanners・graph reconfiguration・matroid pricing・path packing・double-threshold graphs

以下为公开数据预览。个性化匹配理由、联系角度和保存能力需要登录后使用。

On Reachable Assignments Under Dichotomous Preferences2022 · PRIMA 2022: Principles and Practice of Multi-Agent Systems,
An FPT Algorithm for Minimum Additive Spanner Problem.2020 · Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020),
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles.2020 · Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020),
Shortest Reconfiguration of Colorings Under Kempe Changes.2020 · Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020),

下一步

个性化匹配理由、联系角度与收藏保存需要登录后使用。