Yusuke KOBAYASHI
Yusuke KOBAYASHI
Verified email at kurims.kyoto-u.ac.jp
Title
Cited by
Cited by
Year
The disjoint paths problem in quadratic time
K Kawarabayashi, Y Kobayashi, B Reed
Journal of Combinatorial Theory, Series B 102 (2), 424-435, 2012
1602012
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid
K Kawarabayashi, Y Kobayashi
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 278-289, 2012
512012
On shortest disjoint paths in planar graphs
Y Kobayashi, C Sommer
Discrete Optimization 7 (4), 234-245, 2010
502010
Fence patrolling by mobile agents with distinct speeds
A Kawamura, Y Kobayashi
Distributed Computing 28 (2), 147-154, 2015
422015
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
Y Kobayashi, K Kawarabayashi
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
412009
Fence patrolling by mobile agents with distinct speeds
A Kawamura, Y Kobayashi
International Symposium on Algorithms and Computation, 598-608, 2012
332012
The induced disjoint paths problem
K Kawarabayashi, Y Kobayashi
International Conference on Integer Programming and Combinatorial …, 2008
332008
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem
K Kawarabayashi, Y Kobayashi
Journal of Combinatorial Theory, Series B 102 (4), 1020-1034, 2012
312012
Erdős-Pósa property and its algorithmic applications—parity constraints, subset feedback set, and subset packing
N Kakimura, K Kawarabayashi, Y Kobayashi
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012
312012
Even factors, jump systems, and discrete convexity
Y Kobayashi, K Takazawa
Journal of Combinatorial Theory, Series B 99 (1), 139-161, 2009
252009
A weighted linear matroid parity algorithm
S Iwata, Y Kobayashi
SIAM Journal on Computing, STOC17-238-STOC17-280, 2021
222021
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
K Kawarabayashi, Y Kobayashi, S Kreutzer
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
222014
An algorithm for (n− 3)-connectivity augmentation problem: Jump system approach
K Bérczi, Y Kobayashi
Journal of Combinatorial Theory, Series B 102 (3), 565-587, 2012
202012
Operations on M-convex functions on jump systems
Y Kobayashi, K Murota, K Tanaka
SIAM Journal on Discrete Mathematics 21 (1), 107-129, 2007
182007
Max-flow min-cut theorem and faster algorithms in a circular disk failure model
Y Kobayashi, K Otsuki
IEEE INFOCOM 2014-IEEE Conference on Computer Communications, 1635-1643, 2014
172014
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
K Kawarabayashi, Y Kobayashi
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
172011
A proof of Cunninghamʼs conjecture on restricted subgraphs and jump systems
Y Kobayashi, J Szabó, K Takazawa
Journal of Combinatorial Theory, Series B 102 (4), 948-966, 2012
162012
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
K Kawarabayashi, Y Kobayashi
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
162010
Covering intersecting bi-set families under matroid constraints
K Bérczi, T Király, Y Kobayashi
SIAM Journal on Discrete Mathematics 30 (3), 1758-1774, 2016
152016
A linear time algorithm for the induced disjoint paths problem in planar graphs
K Kawarabayashi, Y Kobayashi
Journal of Computer and System Sciences 78 (2), 670-680, 2012
152012
The system can't perform the operation now. Try again later.
Articles 1–20