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

小林佑輔

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

Kobayashi, Yusuke

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

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

81. Tight Approximation for Unconstrained XOS Maximization. Yasushi Kawase; Yusuke Kobayashi 0001; Yutaro Yamaguchi 0001
CoRR abs/1811.09045: (2018)
82. Randomized strategies for cardinality robustness in the knapsack problem Yusuke Kobayashi; Kenjiro Takazawa
Theoretical Computer Science 699: 53 (2017) Semantic Scholar
83. An algorithm for identifying cycle-plus-triangles graphs Kristóf Bérczi; Yusuke Kobayashi
Discrete Applied Mathematics 226: 10 (2017) Semantic Scholar
84. A weighted linear matroid parity algorithm Satoru Iwata; Yusuke Kobayashi
Proceedings of the Annual ACM Symposium on Theory of Computing 128415: 264 (2017) Semantic Scholar
85. Efficient stabilization of cooperative matching games Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
Theoretical Computer Science 677: 69 (2017) Semantic Scholar
86. On Applications of Weighted Linear Matroid Parity Yusuke Kobayashi; Yutaro Yamaguchi
The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (2017)
87. The directed disjoint shortest paths problem Kristóf Bérczi; Yusuke Kobayashi
Proceedings of the 25th European Symposium on Algorithms (ESA 2017) 13:1 (2017)
88. Reconfiguration of maximum-weight b-matchings in a graph Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017) 287 (2017)
89. Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs Naonori Kakimura; Ken-Ichi Kawarabayashi; Yusuke Kobayashi
SIAM Journal on Discrete Mathematics 31: 766 (2017) Semantic Scholar
90. Finding a shortest non-zero path in group-labeled graphs via permanent computation Yusuke Kobayashi; Sho Toyooka
Algorithmica 77: 1128 (2017) Semantic Scholar
91. An improved approximation algorithm for the edge-disjoint paths problem with congestion two Ken-Ichi Kawarabayashi; Yusuke Kobayashi
ACM Transactions on Algorithms 13: no. 5 (2016) Semantic Scholar
92. Edge-disjoint odd cycles in 4-edge-connected graphs Ken-ichi Kawarabayashi; Yusuke Kobayashi
Journal of Combinatorial Theory. Series B 119: 12 (2016) Semantic Scholar
93. Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network Kensuke Otsuki; Yusuke Kobayashi; Kazuo Murota
European Journal of Operational Research 248: 396 (2016) Semantic Scholar
94. Efficient stabilization of cooperative matching games Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016) 41 (2016)
95. Randomized strategies for cardinality robustness in the knapsack problem Yusuke Kobayashi; Kenjiro Takazawa
Proceedings of the 13th Meeting on Analytic Algorithmics and Combinatorics (ANALCO 2016) 25 (2016)
96. Covering intersecting bi-set families under matroid constraints Kristóf Bérczi; Tamás Király; Yusuke Kobayashi
SIAM Journal on Discrete Mathematics 30: 1758 (2016) Semantic Scholar
97. The complexity of minimizing the difference of two M-convex set functions Yusuke Kobayashi
Operations Research Letters 43: 573 (2015) Semantic Scholar
98. Selecting vertex disjoint paths in plane graphs Holger Flier; Matúš Mihalák; Peter Widmayer; Anna Zych (+1 著者) Anita Schöbel
Networks 66: 136 (2015) Semantic Scholar
99. The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs Ken-Ichi Kawarabayashi; Yusuke Kobayashi
Combinatorica 35: 477 (2015) Semantic Scholar
100. Routing algorithms under mutual interference constraints Kota Ishihara; Yusuke Kobayashi
Journal of the Operations Research Society of Japan 58: 209 (2015) Semantic Scholar