Follow
Naonori Kakimura
Title
Cited by
Cited by
Year
Optimal budget allocation: Theoretical guarantee and efficient algorithm
T Soma, N Kakimura, K Inaba, K Kawarabayashi
International Conference on Machine Learning, 351-359, 2014
1032014
Packing cycles through prescribed vertices
N Kakimura, K Kawarabayashi, D Marx
Journal of Combinatorial Theory, Series B 101 (5), 378-381, 2011
592011
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
382012
Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
CC Huang, N Kakimura, Y Yoshida
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017
272017
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
272010
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
242016
Efficient stabilization of cooperative matching games
T Ito, N Kakimura, N Kamiyama, Y Kobayashi, Y Okamoto
Theoretical Computer Science 677, 69-82, 2017
182017
Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
CC Huang, N Kakimura
Workshop on Algorithms and Data Structures, 438-451, 2019
172019
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
172018
Threshold influence model for allocating advertising budgets
A Miyauchi, Y Iwamasa, T Fukunaga, N Kakimura
International Conference on Machine Learning, 1395-1404, 2015
162015
Computing knapsack solutions with cardinality robustness
N Kakimura, K Makino, K Seimi
Japan journal of industrial and applied mathematics 29 (3), 469-483, 2012
162012
Packing directed circuits through prescribed vertices bounded fractionally
N Kakimura, K Kawarabayashi
SIAM Journal on Discrete Mathematics 26 (3), 1121-1133, 2012
152012
Exact and approximation algorithms for weighted matroid intersection
CC Huang, N Kakimura, N Kamiyama
Mathematical Programming 177 (1), 85-112, 2019
142019
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
132019
Finding a dense subgraph with sparse cut
A Miyauchi, N Kakimura
Proceedings of the 27th ACM International Conference on Information and …, 2018
112018
Multi-pass streaming algorithms for monotone submodular function maximization
CC Huang, N Kakimura
arXiv preprint arXiv:1802.06212, 2018
11*2018
Fixed-parameter tractability for subset feedback set problems with parity constraints
N Kakimura, K Kawarabayashi
Theoretical Computer Science 576, 61-76, 2015
112015
Half-integral packing of odd cycles through prescribed vertices
N Kakimura, K Kawarabayashi
Combinatorica 33 (5), 549-572, 2013
112013
Tight approximability of the server allocation problem for real-time applications
T Ito, N Kakimura, N Kamiyama, Y Kobayashi, Y Okamoto, T Shiitada
International Workshop on Algorithmic Aspects of Cloud Computing, 41-55, 2017
102017
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
92020
The system can't perform the operation now. Try again later.
Articles 1–20