Follow
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
2412012
On shortest disjoint paths in planar graphs
Y Kobayashi, C Sommer
Discrete Optimization 7 (4), 234-245, 2010
712010
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid
K Kawarabayashi, Y Kobayashi
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
542012
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
522009
Fence patrolling by mobile agents with distinct speeds
A Kawamura, Y Kobayashi
Distributed Computing 28, 147-154, 2015
482015
The induced disjoint paths problem
K Kawarabayashi, Y Kobayashi
Integer Programming and Combinatorial Optimization: 13th International …, 2008
402008
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
382012
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
382012
The directed disjoint shortest paths problem
K Bérczi, Y Kobayashi
25th Annual European Symposium on Algorithms (ESA 2017), 2017
362017
Improved analysis of highest-degree branching for feedback vertex set
Y Iwata, Y Kobayashi
Algorithmica 83, 2503-2520, 2021
352021
Fence patrolling by mobile agents with distinct speeds
A Kawamura, Y Kobayashi
Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei …, 2012
332012
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
312014
A weighted linear matroid parity algorithm
S Iwata, Y Kobayashi
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
302017
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
302012
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
282014
Even factors, jump systems, and discrete convexity
Y Kobayashi, K Takazawa
Journal of Combinatorial Theory, Series B 99 (1), 139-161, 2009
262009
The perfect matching reconfiguration problem
M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ...
arXiv preprint arXiv:1904.06184, 2019
232019
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
Y Kobayashi
Discrete Optimization 7 (4), 197-202, 2010
232010
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
222012
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
222012
The system can't perform the operation now. Try again later.
Articles 1–20