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

研究キーワード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),

• 公式プロフィール