| The disjoint paths problem in quadratic time K Kawarabayashi, Y Kobayashi, B Reed Journal of Combinatorial Theory, Series B 102 (2), 424-435, 2012 | 251 | 2012 |
| On shortest disjoint paths in planar graphs Y Kobayashi, C Sommer Discrete Optimization 7 (4), 234-245, 2010 | 74 | 2010 |
| 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 | 53 | 2012 |
| Fence patrolling by mobile agents with distinct speeds A Kawamura, Y Kobayashi Distributed Computing 28, 147-154, 2015 | 51 | 2015 |
| 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 | 51 | 2009 |
| The induced disjoint paths problem K Kawarabayashi, Y Kobayashi Integer Programming and Combinatorial Optimization: 13th International …, 2008 | 42 | 2008 |
| The directed disjoint shortest paths problem K Bérczi, Y Kobayashi 25th Annual European Symposium on Algorithms (ESA 2017), 2017 | 39 | 2017 |
| 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 | 39 | 2012 |
| Improved analysis of highest-degree branching for feedback vertex set Y Iwata, Y Kobayashi Algorithmica 83, 2503-2520, 2021 | 37 | 2021 |
| 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 | 37 | 2012 |
| Fence patrolling by mobile agents with distinct speeds A Kawamura, Y Kobayashi Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei …, 2012 | 33 | 2012 |
| 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 | 31 | 2012 |
| 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 | 30 | 2014 |
| A weighted linear matroid parity algorithm S Iwata, Y Kobayashi Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 29 | 2017 |
| 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 | 29 | 2014 |
| The perfect matching reconfiguration problem M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ... arXiv preprint arXiv:1904.06184, 2019 | 26 | 2019 |
| Even factors, jump systems, and discrete convexity Y Kobayashi, K Takazawa Journal of Combinatorial Theory, Series B 99 (1), 139-161, 2009 | 26 | 2009 |
| A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs Y Kobayashi Discrete Optimization 7 (4), 197-202, 2010 | 24 | 2010 |
| Operations on M-convex functions on jump systems Y Kobayashi, K Murota, K Tanaka SIAM Journal on Discrete Mathematics 21 (1), 107-129, 2007 | 23 | 2007 |
| Envy-free relaxations for goods, chores, and mixed items K Bérczi, ER Bérczi-Kovács, E Boros, FT Gedefa, N Kamiyama, T Kavitha, ... arXiv preprint arXiv:2006.04428, 2020 | 22 | 2020 |
