| Optimal budget allocation: Theoretical guarantee and efficient algorithm T Soma, N Kakimura, K Inaba, K Kawarabayashi International Conference on Machine Learning, 351-359, 2014 | 134 | 2014 |
| Packing cycles through prescribed vertices N Kakimura, K Kawarabayashi, D Marx Journal of Combinatorial Theory, Series B 101 (5), 378-381, 2011 | 63 | 2011 |
| Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint CC Huang, N Kakimura, Y Yoshida Algorithmica 82 (4), 1006-1032, 2020 | 43 | 2020 |
| Causal bandits with propagating inference A Yabe, D Hatano, H Sumita, S Ito, N Kakimura, T Fukunaga, ... International Conference on Machine Learning, 5512-5520, 2018 | 38 | 2018 |
| 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 |
| A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices N Kakimura Linear Algebra and its Applications 433 (4), 819-823, 2010 | 34 | 2010 |
| Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint CC Huang, N Kakimura Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019 | 33 | 2019 |
| 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 | 31 | 2016 |
| Delay and cooperation in nonstochastic linear bandits S Ito, D Hatano, H Sumita, K Takemura, T Fukunaga, N Kakimura, ... Advances in Neural Information Processing Systems 33, 4872-4883, 2020 | 29 | 2020 |
| Novel dense subgraph discovery primitives: Risk aversion and exclusion queries CE Tsourakakis, T Chen, N Kakimura, J Pachocki Joint European Conference on Machine Learning and Knowledge Discovery in …, 2019 | 27 | 2019 |
| Threshold influence model for allocating advertising budgets A Miyauchi, Y Iwamasa, T Fukunaga, N Kakimura International Conference on Machine Learning, 1395-1404, 2015 | 23 | 2015 |
| Finding a dense subgraph with sparse cut A Miyauchi, N Kakimura Proceedings of the 27th ACM International Conference on Information and …, 2018 | 22 | 2018 |
| Efficient stabilization of cooperative matching games T Ito, N Kakimura, N Kamiyama, Y Kobayashi, Y Okamoto Theoretical Computer Science 677, 69-82, 2017 | 22 | 2017 |
| Exact and approximation algorithms for weighted matroid intersection CC Huang, N Kakimura, N Kamiyama Mathematical Programming 177 (1), 85-112, 2019 | 21 | 2019 |
| A parameter-free algorithm for misspecified linear contextual bandits K Takemura, S Ito, D Hatano, H Sumita, T Fukunaga, N Kakimura, ... International Conference on Artificial Intelligence and Statistics, 3367-3375, 2021 | 20 | 2021 |
| Multi-pass streaming algorithms for monotone submodular function maximization CC Huang, N Kakimura arXiv preprint arXiv:1802.06212, 2018 | 20* | 2018 |
| Computing knapsack solutions with cardinality robustness N Kakimura, K Makino, K Seimi Japan Journal of Industrial and Applied Mathematics 29 (3), 469-483, 2012 | 18 | 2012 |
| Approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model CC Huang, N Kakimura, S Mauras, Y Yoshida SIAM Journal on Discrete Mathematics 36 (1), 355-382, 2022 | 16 | 2022 |
| Shortest reconfiguration of perfect matchings via alternating cycles T Ito, N Kakimura, N Kamiyama, Y Kobayashi, Y Okamoto SIAM Journal on Discrete Mathematics 36 (2), 1102-1123, 2022 | 15 | 2022 |
| Packing directed circuits through prescribed vertices bounded fractionally N Kakimura, K Kawarabayashi SIAM Journal on Discrete Mathematics 26 (3), 1121-1133, 2012 | 14 | 2012 |
Ken-ichi KawarabayashiNational Institute of Informatics, The University of TokyoVerified email at nii.ac.jp
