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

小林佑輔

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

Kobayashi, Yusuke

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

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

81. 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
82. 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)
83. 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)
84. 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
85. The complexity of minimizing the difference of two M-convex set functions Yusuke Kobayashi
Operations Research Letters 43: 573 (2015) Semantic Scholar
86. 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
87. The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs Ken-Ichi Kawarabayashi; Yusuke Kobayashi
Combinatorica 35: 477 (2015) Semantic Scholar
88. Routing algorithms under mutual interference constraints Kota Ishihara; Yusuke Kobayashi
Journal of the Operations Research Society of Japan 58: 209 (2015) Semantic Scholar
89. Finding a path in group-labeled graphs with two labels forbidden Yasushi Kawase; Yusuke Kobayashi; Yutaro Yamaguchi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 9134: 797 (2015) Semantic Scholar
90. The generalized terminal backup problem Attila Bernáth; Yusuke Kobayashi; Tatsuya Matsuoka
SIAM Journal on Discrete Mathematics 29: 1764 (2015) Semantic Scholar
91. Fence patrolling by mobile agents with distinct speeds Akitoshi Kawamura; Yusuke Kobayashi
Distributed Computing 28: 147 (2015) Semantic Scholar
92. Triangle-free 2-matchings and M-concave functions on jump systems Yusuke Kobayashi
Discrete Applied Mathematics 175: 35 (2014) Semantic Scholar
93. Minimum-cost b-Edge dominating sets on trees Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8889: 195 (2014) Semantic Scholar
94. An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem Ken-Ichi Kawarabayashi; Yusuke Kobayashi; Stephan Kreutzer
Proceedings of the Annual ACM Symposium on Theory of Computing 70 (2014) Semantic Scholar
95. Max-flow min-cut theorem and faster algorithms in a circular disk failure model Yusuke Kobayashi; Kensuke Otsuki
Proceedings - IEEE INFOCOM 1635 (2014) Semantic Scholar
96. The generalized terminal backup problem Attila Bernáth; Yusuke Kobayashi
Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014) 1678 (2014)
97. All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs Ken-Ichi Kawarabayashi; Yusuke Kobayashi
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 187 (2013) Semantic Scholar
98. Robust matchings and matroid intersections Ryo Fujita; Yusuke Kobayashi; Kazuhisa Makino
SIAM Journal on Discrete Mathematics 27: 1234 (2013) Semantic Scholar
99. An O(log n)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs Ken-Ichi Kawarabayashi; Yusuke Kobayashi
ACM Transactions on Algorithms 9: no. 16 (2013) Semantic Scholar
100. Cone superadditivity of discrete convex functions Yusuke Kobayashi; Kazuo Murota; Robert Weismantel
Mathematical Programming 135: 25 (2012) Semantic Scholar