小林 佑輔
Kobayashi, Yusuke
京都大学 , 数理解析研究所 , 准教授 Kyoto University , Research Institute for Mathematical Sciences , Associate Professor
関連記事はまだありません。
-
101.
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
-
102.
The generalized terminal backup problem
Attila Bernáth; Yusuke Kobayashi; Tatsuya Matsuoka
SIAM Journal on Discrete Mathematics 29: 1764 (2015) Semantic Scholar
-
103.
Fence patrolling by mobile agents with distinct speeds
Akitoshi Kawamura; Yusuke Kobayashi
Distributed Computing 28: 147 (2015) Semantic Scholar
-
104.
Triangle-free 2-matchings and M-concave functions on jump systems
Yusuke Kobayashi
Discrete Applied Mathematics 175: 35 (2014) Semantic Scholar
-
105.
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
-
106.
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
-
107.
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
-
108.
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)
-
109.
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
-
110.
Robust matchings and matroid intersections
Ryo Fujita; Yusuke Kobayashi; Kazuhisa Makino
SIAM Journal on Discrete Mathematics 27: 1234 (2013) Semantic Scholar
-
111.
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
-
112.
Cone superadditivity of discrete convex functions
Yusuke Kobayashi; Kazuo Murota; Robert Weismantel
Mathematical Programming 135: 25 (2012) Semantic Scholar
-
113.
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
-
114.
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
-
115.
Testing the (s, t) -disconnectivity of graphs and digraphs
Yuichi Yoshida; Yusuke Kobayashi
Theoretical Computer Science 434: 98 (2012) Semantic Scholar
-
116.
An algorithm for finding a maximum t-matching excluding complete partite subgraphs
Yusuke Kobayashi; Xin Yin
Discrete Optimization 9: 98 (2012) Semantic Scholar
-
117.
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
-
118.
An immersion of a square in 4-edge-connected graphs
Ken-ichi Kawarabayashi; Yusuke Kobayashi
Progress in Informatics 9: 35 (2012) Semantic Scholar
-
119.
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
-
120.
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
書籍等出版物情報はまだありません。
講演・口頭発表情報はまだありません。
知財情報はまだありません。
1,533 total views