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

小林佑輔

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

Kobayashi, Yusuke

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

1. A PTAS for Weighted Triangle-free 2-Matching. Miguel Bosch-Calvo; Fabrizio Grandoni 0001; Yusuke Kobayashi 0001; Takashi Noguchi
CoRR abs/2603.09144: (2026) Semantic Scholar
2. Polynomial Kernels with Reachability for Weighted d-Matroid Intersection. Chien-Chung Huang 0001; Naonori Kakimura; Yusuke Kobayashi 0001; Tatsuya Terao
CoRR abs/2603.17345: (2026) Semantic Scholar
3. Reconfiguration of Time-Respecting Arborescences. Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi (+2 著者) Akira Suzuki 0001
Algorithmica 88: 15 (2026) Semantic Scholar
4. Hardness and fixed parameter tractability for pinwheel scheduling problems. Yusuke Kobayashi 0001; Bingkai Lin; Joseph Swernofsky
Theor. Comput. Sci. 1077: 115998 (2026) Semantic Scholar
5. Finding a Maximum Restricted \({t}\)-Matching via Boolean Edge-CSP. Yuni Iwamasa; Yusuke Kobayashi 0001; Kenjiro Takazawa
SIAM J. Discret. Math. 40: 816 (2026) Semantic Scholar
6. Loss minimization for electrical flows over spanning trees on grids. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001Yoshio Okamoto
Theor. Comput. Sci. 1083: 116132 (2026) Semantic Scholar
7. A PTAS for Weighted Triangle-Free 2-Matching. Miguel Bosch-Calvo; Fabrizio Grandoni 0001; Yusuke Kobayashi 0001; Takashi Noguchi
IPCO 17 (2026)
8. Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001 (+2 著者) Yoshio Okamoto
SIAM J. Discret. Math. 40: 554 (2026)
9. Polynomial Kernels with Reachability for Weighted d-Matroid Intersection. Chien-Chung Huang 0001; Naonori Kakimura; Yusuke Kobayashi 0001; Tatsuya Terao
IPCO 362 (2026)
10. A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering. Akitoshi Kawamura; Yusuke Kobayashi 0001
CoRR abs/2510.06533: (2025) Semantic Scholar
11. Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001Yoshio Okamoto
CoRR abs/2509.15080: (2025) Semantic Scholar
12. Reconfiguration of the Union of Arborescences. Yusuke Kobayashi 0001; Ryoga Mahara; Tamás Schwarcz
Algorithmica 87: 1040 (2025) Semantic Scholar
13. Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
ACM Transactions on Quantum Computing 6: 1 (2025) Semantic Scholar
14. Rerouting Planar Curves and Disjoint Paths Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi (+3 著者) Kenta Ozeki
ACM Transactions on Algorithms 21: 1 (2025) Semantic Scholar
15. Optimal general factor problem and jump system intersection. Yusuke Kobayashi
Math. Program. 210: 591 (2025) Semantic Scholar
16. Reforming an Envy-Free Matching Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama (+3 著者) Kenta Ozeki
Algorithmica (2025) Semantic Scholar
17. Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001Yoshio Okamoto
ISAAC 40 (2025)
18. Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems. Yusuke Kobayashi 0001; Bingkai Lin
ISAAC 47 (2025) Semantic Scholar
19. Pinwheel Covering. Akitoshi Kawamura; Yusuke Kobayashi; Yosuke Kusano
CIAC 185 (2025) Semantic Scholar
20. Reconfiguration of colorings in triangulations of the sphere. Takehiro Ito; Yuni Iwamasa; Yusuke Kobayashi 0001; Shun-ichi Maezawa (+2 著者) Kenta Ozeki
J. Comput. Geom. 16: 253 (2025)