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

小林佑輔

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

Kobayashi, Yusuke

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

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

121. Fence patrolling by mobile agents with distinct speeds Akitoshi Kawamura; Yusuke Kobayashi
Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012) 598 (2012)
122. Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid minor Ken-Ichi Kawarabayashi; Yusuke Kobayashi
Leibniz International Proceedings in Informatics, LIPIcs 14: 278 (2012) Semantic Scholar
123. Edge-disjoint odd cycles in 4-edge-connected Graphs Ken-Ichi Kawarabayashi; Yusuke Kobayashi
Leibniz International Proceedings in Informatics, LIPIcs 14: 206 (2012) Semantic Scholar
124. List-coloring graphs without subdivisions and without immersions Ken-ichi Kawarabayashi; Yusuke Kobayashi
Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) 1425 (2012)
125. ErdH{o}s-P'osa property and its algorithmic applications --- parity constraints, subset feedback set, and subset packing Naonori Kakimura; Ken-ichi Kawarabayashi; Yusuke Kobayashi
Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) 1726 (2012)
126. Algorithms for finding a maximum non-k-linked graph Yusuke Kobayashi; Yuichi Yoshida
SIAM Journal on Discrete Mathematics 26: 591 (2012) Semantic Scholar
127. The complexity of the node capacitated in-tree packing problem Shinji Imahori; Yuichiro Miyamoto; Hideki Hashimoto; Yusuke Kobayashi (+1 著者) Mutsunori Yagiura
Networks 59: 13 (2012) Semantic Scholar
128. Algorithms for finding a maximum non-kappa;-linked graph Yusuke Kobayashi; Yuichi Yoshida
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6942: 131 (2011) Semantic Scholar
129. Breaking O(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two Ken-Ichi Kawarabayashi; Yusuke Kobayashi
Proceedings of the Annual ACM Symposium on Theory of Computing 81 (2011) Semantic Scholar
130. An improved algorithm for the half-disjoint paths problem Ken-Ichi Kawarabayashi; Yusuke Kobayashi
SIAM Journal on Discrete Mathematics 25: 1322 (2011) Semantic Scholar
131. Algorithms for finding an induced cycle in planar graphs Ken-ichi Kawarabayashi; Yusuke Kobayashi
Combinatorica 30: 715 (2010) Semantic Scholar
132. On shortest disjoint paths in planar graphs Yusuke Kobayashi; Christian Sommer
Discrete Optimization 7: 234 (2010) Semantic Scholar
133. A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs Yusuke Kobayashi
Discrete Optimization 7: 197 (2010) Semantic Scholar
134. An algorithm for minimum cost arc-connectivity orientations Satoru Iwata; Yusuke Kobayashi
Algorithmica (New York) 56: 437 (2010) Semantic Scholar
135. Robust Matchings and Matroid Intersections Ryo Fujita; Yusuke Kobayashi; Kazuhisa Makino
ALGORITHMS-ESA 2010, PT II 6347: 123 (2010) Semantic Scholar
136. 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
137. 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
138. 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)
139. Induced disjoint paths problem in a planar digraph Yusuke Kobayashi
Discrete Applied Mathematics 157: 3231 (2009) Semantic Scholar
140. 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