Følg
Naonori Kakimura
Naonori Kakimura
Keio University
Verifisert e-postadresse på math.keio.ac.jp - Startside
Tittel
Sitert av
Sitert av
År
Optimal budget allocation: Theoretical guarantee and efficient algorithm
T Soma, N Kakimura, K Inaba, K Kawarabayashi
International Conference on Machine Learning, 351-359, 2014
1372014
Packing cycles through prescribed vertices
N Kakimura, K Kawarabayashi, D Marx
Journal of Combinatorial Theory, Series B 101 (5), 378-381, 2011
652011
Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
CC Huang, N Kakimura, Y Yoshida
Algorithmica 82 (4), 1006-1032, 2020
472020
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
402018
Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
CC Huang, N Kakimura
Algorithmica 83 (3), 879-902, 2021
382021
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
372012
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
352016
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
342010
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
302020
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
282019
Exact and approximation algorithms for weighted matroid intersection
CC Huang, N Kakimura, N Kamiyama
Mathematical Programming 177 (1), 85-112, 2019
232019
Finding a dense subgraph with sparse cut
A Miyauchi, N Kakimura
Proceedings of the 27th ACM International Conference on Information and …, 2018
232018
Threshold influence model for allocating advertising budgets
A Miyauchi, Y Iwamasa, T Fukunaga, N Kakimura
International Conference on Machine Learning, 1395-1404, 2015
232015
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
222021
Multi-pass streaming algorithms for monotone submodular function maximization
CC Huang, N Kakimura
arXiv preprint arXiv:1802.06212, 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
222017
Computing knapsack solutions with cardinality robustness
N Kakimura, K Makino, K Seimi
Japan Journal of Industrial and Applied Mathematics 29 (3), 469-483, 2012
182012
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
172022
Packing directed circuits through prescribed vertices bounded fractionally
N Kakimura, K Kawarabayashi
SIAM Journal on Discrete Mathematics 26 (3), 1121-1133, 2012
162012
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
152022
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20