ホーム > 小林佑輔/ Kobayashi, Yusuke

小林佑輔

ALUMNI 2025年5月現在、筑波大学が主たる所属機関ではありません

Kobayashi, Yusuke

京都大学 , 数理解析研究所 , 准教授
Kyoto University , Research Institute for Mathematical Sciences , Associate Professor

オープンアクセス版の論文は「つくばリポジトリ」で読むことができます。

1. Reforming an Envy-Free Matching Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama (+3 著者) Kenta Ozeki
Algorithmica (2025)
2. Envy-free relaxations for goods, chores, and mixed items Kristóf Bérczi; Erika R. Bérczi-Kovács; Endre Boros; Fekadu Tolessa Gedefa (+3 著者) Kazuhisa Makino
Theoretical Computer Science 1002: 114596 (2024) Semantic Scholar
3. Feedback vertex set reconfiguration in planar graphs Nicolas Bousquet; Felix Hommelsheim; Yusuke Kobayashi; Moritz MühlenthalerAkira Suzuki
Theoretical Computer Science 979: 114188 (2023) Semantic Scholar
4. On reachable assignments under dichotomous preferences Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi (+2 著者) Kenta Ozeki
Theoretical Computer Science 979: 114196 (2023)
5. Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. Nicolas Bousquet; Takehiro Ito; Yusuke Kobayashi 0001; Haruka Mizuta (+2 著者) Kunihiro Wasa
Algorithmica 85: 2779 (2023) Semantic Scholar
6. Fixed-parameter algorithms for graph constraint logic. Tatsuhiko Hatanaka; Felix Hommelsheim; Takehiro Ito; Yusuke Kobayashi 0001 (+1 著者) Akira Suzuki
Theor. Comput. Sci. 959: 113863 (2023)
7. On Reachable Assignments Under Dichotomous Preferences Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi (+2 著者) Kenta Ozeki
PRIMA 2022: Principles and Practice of Multi-Agent Systems 650 (2023)
8. Trade-offs among degree, diameter, and number of paths. Toshimasa Ishii; Akitoshi Kawamura; Yusuke Kobayashi; Kazuhisa Makino
Discret. Appl. Math. 327: 96 (2023) Semantic Scholar
9. Reconfiguration of Time-Respecting Arborescences. Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi (+2 著者) Akira Suzuki
CoRR abs/2305.07262: (2023) Semantic Scholar
10. Reconfiguration of Colorings in Triangulations of the Sphere. Takehiro Ito; Yuni Iwamasa; Yusuke Kobayashi 0001; Shun-ichi Maezawa (+2 著者) Kenta Ozeki
SoCG 43:1 (2023)
11. Algorithmic Theory of Qubit Routing. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001Yoshio Okamoto
WADS 533 (2023)
12. Optimal General Factor Problem and Jump System Intersection. Yusuke Kobayashi 0001
Integer Programming and Combinatorial Optimization - 24th International Conference(IPCO) 291 (2023)
13. Reconfiguration of Time-Respecting Arborescences. Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi (+2 著者) Akira Suzuki
WADS 521 (2023)
14. A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 0001 (+1 著者) Yota Otachi
AAAI 3968 (2023)
15. Algorithmic Theory of Qubit Routing. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001Yoshio Okamoto
CoRR abs/2305.02059: (2023) Semantic Scholar
16. Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001 (+2 著者) Yoshio Okamoto
CoRR abs/2304.14782: (2023) Semantic Scholar
17. Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001 (+2 著者) Yoshio Okamoto
ICALP 82:1 (2023)
18. Rerouting Planar Curves and Disjoint Paths. Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 0001 (+3 著者) Kenta Ozeki
ICALP 81:1 (2023)
19. Reforming an Envy-Free Matching Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama (+3 著者) Kenta Ozeki
Proceedings of the AAAI Conference on Artificial Intelligence 36: 5084 (2022) Semantic Scholar
20. Shortest Reconfiguration of Perfect Matchings via Alternating Cycles Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
SIAM Journal on Discrete Mathematics 36: 1102 (2022)