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

小林佑輔

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

Kobayashi, Yusuke

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

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

1. Rerouting Planar Curves and Disjoint Paths Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi (+3 著者) Kenta Ozeki
ACM Transactions on Algorithms 21: 1 (2025)
2. Optimal general factor problem and jump system intersection. Yusuke Kobayashi
Math. Program. 210: 591 (2025)
3. Reforming an Envy-Free Matching Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama (+3 著者) Kenta Ozeki
Algorithmica (2025)
4. Finding spanning trees with perfect matchings. Kristóf Bérczi; Tamás Király; Yusuke Kobayashi; Yutaro YamaguchiYu Yokoi
Discret. Appl. Math. 371: 137 (2025)
5. Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem. Yusuke Kobayashi; Takashi Noguchi
SOSA 281 (2025)
6. Pinwheel Covering. Akitoshi Kawamura; Yusuke Kobayashi; Yosuke Kusano
CIAC 185 (2025)
7. EFX allocations for indivisible chores: Matching-based approach. Yusuke Kobayashi; Ryoga Mahara; Souta Sakamoto
Theoretical Computer Science 1026: 115010 (2025)
8. Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. Yusuke Kobayashi; Ryoga Mahara
SIAM J. Discret. Math. 39: 533 (2025)
9. 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
10. Subquadratic Submodular Maximization with a General Matroid Constraint. Yusuke Kobayashi; Tatsuya Terao
51st International Colloquium on Automata, Languages, and Programming(ICALP) 100 (2024)
11. Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. Yuni Iwamasa; Yusuke Kobayashi; Kenjiro Takazawa
32nd Annual European Symposium on Algorithms(ESA) 75 (2024)
12. 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
13. On reachable assignments under dichotomous preferences Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi (+2 著者) Kenta Ozeki
Theoretical Computer Science 979: 114196 (2023)
14. 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
15. 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)
16. EFX Allocations for Indivisible Chores: Matching-Based Approach. Yusuke Kobayashi; Ryoga Mahara; Souta Sakamoto
Algorithmic Game Theory - 16th International Symposium(SAGT) 257 (2023)
17. Reconfiguration of the Union of Arborescences. Yusuke Kobayashi; Ryoga Mahara; Tamás Schwarcz
34th International Symposium on Algorithms and Computation(ISAAC) 48 (2023)
18. Reconfiguration of Time-Respecting Arborescences. Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi (+2 著者) Akira Suzuki
CoRR abs/2305.07262: (2023) Semantic Scholar
19. 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
20. 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)