| Finding 2-factors closer to TSP tours in cubic graphs S Boyd, S Iwata, K Takazawa SIAM Journal on Discrete Mathematics 27 (2), 918-939, 2013 | 34 | 2013 |
| 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 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 | 22 | 2012 |
| A weighted Kt, t-free t-factor algorithm for bipartite graphs K Takazawa Mathematics of Operations Research 34 (2), 351-362, 2009 | 22 | 2009 |
| A weighted even factor algorithm K Takazawa Mathematical programming 115, 223-237, 2008 | 15 | 2008 |
| Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs K Takazawa Discrete Optimization 26, 26-40, 2017 | 14 | 2017 |
| The independent even factor problem S Iwata, K Takazawa SIAM Journal on Discrete Mathematics 22 (4), 1411-1427, 2008 | 14 | 2008 |
| Minimizing submodular functions on diamonds via generalized fractional matroid matchings S Fujishige, T Király, K Makino, K Takazawa, S Tanigawa Journal of Combinatorial Theory, Series B 157, 294-345, 2022 | 13* | 2022 |
| Optimal matching forests and valuated delta-matroids K Takazawa SIAM Journal on Discrete Mathematics 28 (1), 445-467, 2014 | 13 | 2014 |
| Decomposition theorems for square-free 2-matchings in bipartite graphs K Takazawa Discrete Applied Mathematics 233, 215-223, 2017 | 12 | 2017 |
| Excluded -Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids K Takazawa SIAM Journal on Discrete Mathematics 36 (1), 702-727, 2022 | 11* | 2022 |
| Randomized strategies for cardinality robustness in the knapsack problem Y Kobayashi, K Takazawa 2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and …, 2016 | 10 | 2016 |
| Improving approximation ratios for the clustered traveling salesman problem M Kawasaki, K Takazawa Journal of the Operations Research Society of Japan 63 (2), 60-70, 2020 | 8 | 2020 |
| Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications Y Iwamasa, K Takazawa International Conference on Theory and Applications of Models of Computation …, 2020 | 6 | 2020 |
| A generalized-polymatroid approach to disjoint common independent sets in two matroids K Takazawa, Y Yokoi Discrete Mathematics 342 (7), 2002-2011, 2019 | 6 | 2019 |
| A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs K Takazawa Information Processing Letters 116 (9), 550-553, 2016 | 6 | 2016 |
| Shortest bibranchings and valuated matroid intersection K Takazawa Japan journal of industrial and applied mathematics 29 (3), 561-573, 2012 | 6 | 2012 |
| The b-branching problem in digraphs N Kakimura, N Kamiyama, K Takazawa Discrete Applied Mathematics 283, 565-576, 2020 | 5 | 2020 |
| A weighted independent even factor algorithm K Takazawa Mathematical programming 132, 261-276, 2012 | 5 | 2012 |
| Finding popular branchings in vertex-weighted directed graphs K Natsui, K Takazawa Theoretical Computer Science 953, 113799, 2023 | 3* | 2023 |
Yusuke KOBAYASHIKyoto University在 kurims.kyoto-u.ac.jp 的电子邮件经过验证
