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

小林佑輔

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

Kobayashi, Yusuke

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

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

121. A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs Yusuke Kobayashi
Discrete Optimization 7: 197 (2010) Semantic Scholar
122. An algorithm for minimum cost arc-connectivity orientations Satoru Iwata; Yusuke Kobayashi
Algorithmica (New York) 56: 437 (2010) Semantic Scholar
123. Robust Matchings and Matroid Intersections Ryo Fujita; Yusuke Kobayashi; Kazuhisa Makino
ALGORITHMS-ESA 2010, PT II 6347: 123 (2010) Semantic Scholar
124. Improved Algorithm for the Half-Disjoint Paths Problem Ken-ichi Kawarabayashi; Yusuke Kobayashi
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES 6302: 287 (2010) Semantic Scholar
125. An O(log n)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Gr Ken-ichi Kawarabayashi; Yusuke Kobayashi
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES 6302: 274 (2010) Semantic Scholar
126. The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs Ken-ichi Kawarabayashi; Yusuke Kobayashi
PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS 135: 345 (2010)
127. Induced disjoint paths problem in a planar digraph Yusuke Kobayashi
Discrete Applied Mathematics 157: 3231 (2009) Semantic Scholar
128. On shortest disjoint paths in planar graphs Yusuke Kobayashi; Christian Sommer
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5878: 293 (2009) Semantic Scholar
129. The complexity of the node capacitated in-tree packing problem Shinji Imahori; Yuichiro Miyamoto; Hideki Hashimoto; Yusuke Kobayashi (+1 著者) Mutsunori Yagiura
Proceedings of the International Network Optimization Conference 2009 (2009)
130. Algorithms for finding an induced cycle in planar graphs and bounded genus graphs Yusuke Kobayashi; Ken-ichi Kawarabayashi
Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009) 1146 (2009)
131. Even factors, jump systems, and discrete convexity Yusuke Kobayashi; Kenjiro Takazawa
Journal of Combinatorial Theory. Series B 99: 139 (2009) Semantic Scholar
132. The induced disjoint paths problem Ken-Ichi Kawarabayashi; Yusuke Kobayashi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5035: 47 (2008) Semantic Scholar
133. Induction of M-convex functions by linking systems Yusuke Kobayashi; Kazuo Murota
Discrete Applied Mathematics 155: 1471 (2007) Semantic Scholar
134. Operations on M-convex functions on jump systems Yusuke Kobayashi; Kazuo Murota; Ken'ichiro Tanaka
SIAM Journal on Discrete Mathematics 21: 107 (2007) Semantic Scholar