Naonori Kakimura
Orcid: 0000-0002-3918-3479
According to our database1,
Naonori Kakimura
authored at least 73 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Randomized counter-based algorithms for frequency estimation over data streams in O(loglogN) space.
Theor. Comput. Sci., February, 2024
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Theor. Comput. Sci., November, 2023
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams.
ACM Trans. Algorithms, January, 2023
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
2022
SIAM J. Discret. Math., 2022
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model.
SIAM J. Discret. Math., 2022
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty.
Oper. Res. Lett., 2022
Theory Comput. Syst., 2022
Submodular reassignment problem for reallocating agents to tasks with synergy effects.
Discret. Optim., 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint.
Algorithmica, 2021
Proceedings of the Web and Internet Economics - 17th International Conference, 2021
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint.
Algorithmica, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
2019
Math. Program., 2019
Proceedings of the PRICAI 2019: Trends in Artificial Intelligence, 2019
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
2018
Sustain. Comput. Informatics Syst., 2018
J. Comb. Theory B, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
Proceedings of the Database and Expert Systems Applications, 2018
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018
2017
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs.
SIAM J. Discret. Math., 2017
Algorithmica, 2017
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
Proceedings of the 2017 IEEE Global Communications Conference, 2017
Proceedings of the Algorithmic Aspects of Cloud Computing - Third International Workshop, 2017
2016
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016
2015
Fixed-parameter tractability for subset feedback set problems with parity constraints.
Theor. Comput. Sci., 2015
Math. Oper. Res., 2015
Proceedings of the 32nd International Conference on Machine Learning, 2015
2014
Proceedings of the 31th International Conference on Machine Learning, 2014
Proceedings of the IEEE Global Communications Conference, 2014
2013
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013
2012
SIAM J. Discret. Math., 2012
Adv. Appl. Math., 2012
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
2010
Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem.
J. Comb. Theory B, 2010
2008
2007
Proceedings of the Integer Programming and Combinatorial Optimization, 2007