小林 佑輔
Kobayashi, Yusuke
京都大学 , 数理解析研究所 , 准教授 Kyoto University , Research Institute for Mathematical Sciences , Associate Professor
関連記事はまだありません。
-
101.
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem
Ken-ichi Kawarabayashi; Yusuke Kobayashi
Journal of Combinatorial Theory. Series B 102: 1020 (2012) Semantic Scholar
-
102.
A proof of Cunningham's conjecture on restricted subgraphs and jump systems
Yusuke Kobayashi; Jácint Szabó; Kenjiro Takazawa
Journal of Combinatorial Theory. Series B 102: 948 (2012) Semantic Scholar
-
103.
Testing the (s, t) -disconnectivity of graphs and digraphs
Yuichi Yoshida; Yusuke Kobayashi
Theoretical Computer Science 434: 98 (2012) Semantic Scholar
-
104.
An algorithm for finding a maximum t-matching excluding complete partite subgraphs
Yusuke Kobayashi; Xin Yin
Discrete Optimization 9: 98 (2012) Semantic Scholar
-
105.
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Kristóf Bérczi; Yusuke Kobayashi
Journal of Combinatorial Theory. Series B 102: 565 (2012) Semantic Scholar
-
106.
An immersion of a square in 4-edge-connected graphs
Ken-ichi Kawarabayashi; Yusuke Kobayashi
Progress in Informatics 9: 35 (2012) Semantic Scholar
-
107.
A linear time algorithm for the induced disjoint paths problem in planar graphs
Ken-Ichi Kawarabayashi; Yusuke Kobayashi
Journal of Computer and System Sciences 78: 670 (2012) Semantic Scholar
-
108.
The disjoint paths problem in quadratic time
Ken-ichi Kawarabayashi; Yusuke Kobayashi; Bruce Reed
Journal of Combinatorial Theory. Series B 102: 424 (2012) Semantic Scholar
-
109.
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)
-
110.
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
-
111.
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
-
112.
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)
-
113.
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)
-
114.
Algorithms for finding a maximum non-k-linked graph
Yusuke Kobayashi; Yuichi Yoshida
SIAM Journal on Discrete Mathematics 26: 591 (2012) Semantic Scholar
-
115.
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
-
116.
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
-
117.
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
-
118.
An improved algorithm for the half-disjoint paths problem
Ken-Ichi Kawarabayashi; Yusuke Kobayashi
SIAM Journal on Discrete Mathematics 25: 1322 (2011) Semantic Scholar
-
119.
Algorithms for finding an induced cycle in planar graphs
Ken-ichi Kawarabayashi; Yusuke Kobayashi
Combinatorica 30: 715 (2010) Semantic Scholar
-
120.
On shortest disjoint paths in planar graphs
Yusuke Kobayashi; Christian Sommer
Discrete Optimization 7: 234 (2010) Semantic Scholar
書籍等出版物情報はまだありません。
講演・口頭発表情報はまだありません。
知財情報はまだありません。
1,281 total views