| Cyber security analysis of power networks by hypergraph cut algorithms Y Yamaguchi, A Ogawa, A Takeda, S Iwata IEEE Transactions on Smart Grid 6 (5), 2189-2199, 2015 | 41 | 2015 |
| Maximizing time-decaying influence in social networks N Ohsaka, Y Yamaguchi, N Kakimura, K Kawarabayashi Joint European conference on machine learning and knowledge discovery in …, 2016 | 35 | 2016 |
| 0/1/all CSPs, half-integral A-path packing, and linear-time FPT algorithms Y Iwata, Y Yamaguchi, Y Yoshida 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 28 | 2018 |
| Hypergraph characterization of split matroids K Bérczi, T Király, T Schwarcz, Y Yamaguchi, Y Yokoi Journal of Combinatorial Theory, Series A 194, 105697, 2023 | 17 | 2023 |
| Packing -Paths in Group-Labelled Graphs via Linear Matroid Parity Y Yamaguchi SIAM Journal on Discrete Mathematics 30 (1), 474-492, 2016 | 17 | 2016 |
| List coloring of two matroids through reduction to partition matroids K Bérczi, T Schwarcz, Y Yamaguchi SIAM Journal on Discrete Mathematics 35 (3), 2192-2209, 2021 | 16 | 2021 |
| Packing non-zero A-paths via matroid matching S Tanigawa, Y Yamaguchi Discrete Applied Mathematics 214, 169-178, 2016 | 16 | 2016 |
| Stochastic packing integer programs with few queries T Maehara, Y Yamaguchi Mathematical Programming 182 (1), 141-174, 2020 | 9 | 2020 |
| Shortest disjoint S-paths via weighted linear matroid parity Y Yamaguchi 27th International Symposium on Algorithms and Computation (ISAAC 2016), 63 …, 2016 | 9 | 2016 |
| Finding a path with two labels forbidden in group-labeled graphs Y Kawase, Y Kobayashi, Y Yamaguchi Journal of Combinatorial Theory, Series B 143, 65-122, 2020 | 7 | 2020 |
| Stochastic packing integer programs with few queries T Maehara, Y Yamaguchi Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 7 | 2018 |
| Finding a shortest non-zero path in group-labeled graphs Y Iwata, Y Yamaguchi Combinatorica 42 (Suppl 2), 1253-1282, 2022 | 6 | 2022 |
| Max-min 3-dispersion on a convex polygon Y Kobayashi, SI Nakano, K Uchizawa, T Uno, Y Yamaguchi, K Yamanaka 37th European Workshop on Computational Geometry, 2021 | 6 | 2021 |
| Realizing symmetric set functions as hypergraph cut capacity Y Yamaguchi Discrete Mathematics 339 (8), 2007-2017, 2016 | 6 | 2016 |
| Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity Y Yamaguchi Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 6 | 2014 |
| Matroid intersection under restricted oracles K Bérczi, T Király, Y Yamaguchi, Y Yokoi SIAM Journal on Discrete Mathematics 37 (2), 1311-1330, 2023 | 5 | 2023 |
| Dynamic programming approach to the generalized minimum Manhattan network problem Y Masumura, T Oki, Y Yamaguchi Algorithmica 83 (12), 3681-3714, 2021 | 5 | 2021 |
| An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position Y Kobayashi, SI Nakano, K Uchizawa, T Uno, Y Yamaguchi, K Yamanaka IEICE TRANSACTIONS on Information and Systems 105 (3), 503-507, 2022 | 4 | 2022 |
| Making bipartite graphs DM-irreducible K Bérczi, S Iwata, J Kato, Y Yamaguchi SIAM Journal on Discrete Mathematics 32 (1), 560-590, 2018 | 4 | 2018 |
| Linear-time FPT algorithms via half-integral non-returning A-path packing Y Iwata, Y Yamaguchi, Y Yoshida CoRR, abs/1704.02700, 2017 | 4 | 2017 |
