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

小林佑輔

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

Kobayashi, Yusuke

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

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

21. Optimal General Factor Problem and Jump System Intersection. Yusuke Kobayashi 0001
Integer Programming and Combinatorial Optimization - 24th International Conference(IPCO) 291 (2023)
22. Reconfiguration of Time-Respecting Arborescences. Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi (+2 著者) Akira Suzuki
WADS 521 (2023)
23. 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)
24. Algorithmic Theory of Qubit Routing. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001Yoshio Okamoto
CoRR abs/2305.02059: (2023) Semantic Scholar
25. 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
26. 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)
27. Rerouting Planar Curves and Disjoint Paths. Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 0001 (+3 著者) Kenta Ozeki
ICALP 81:1 (2023)
28. 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)
29. Reconfiguration of Time-Respecting Arborescences. Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi (+2 著者) Akira Suzuki
CoRR abs/2305.07262: (2023) Semantic Scholar
30. 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
31. 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
32. 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)
33. A Parameterized View to the Robust Recoverable Base Problem of Matroids Under Structural Uncertainty Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
Operations Research Letters (2022) Semantic Scholar
34. Linear-Time Recognition of Double-Threshold Graphs Yusuke Kobayashi; Yoshio Okamoto; Yota Otachi; Yushi Uno
Algorithmica 84: 1163 (2022) Semantic Scholar
35. Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles Yusuke Kobayashi
Mathematical Programming 192: 675 (2022) Semantic Scholar
36. Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama (+4 著者) Kenta Ozeki
SODA 1342 (2022)
37. Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. Nicolas Bousquet; Takehiro Ito; Yusuke Kobayashi; Haruka Mizuta (+2 著者) Kunihiro Wasa
STACS 15 (2022)
38. Rerouting Planar Curves and Disjoint Paths. Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 0001 (+3 著者) Kenta Ozeki
CoRR abs/2210.11778: (2022) Semantic Scholar
39. Parameterized Complexity of (A, ℓ )-Path Packing. Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi (+4 著者) Yota Otachi
Algorithmica 84: 871 (2022) Semantic Scholar
40. Computing the Largest Bond and the Maximum Connected Cut of a Graph Gabriel L. Duarte; Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi (+4 著者) Uéverton S. Souza
Algorithmica 83: 1421 (2021) Semantic Scholar