Naonori Kakimura

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 89

Top Venues

CoRR

SIAM J. Discret. Math.

NeurIPS

Theor. Comput. Sci.

Publications

Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. AAAI (2024)
Naonori Kakimura, Ildikó Schlotter
Parameterized Complexity of Submodular Minimization Under Uncertainty. SWAT (2024)
Naonori Kakimura, Ildikó Schlotter
Parameterized Complexity of Submodular Minimization under Uncertainty. CoRR (2024)
Naonori Kakimura, Rio Katsu
On Approximating the Weighted Region Problem in Square Tessellations. CoRR (2024)
Naonori Kakimura, Riku Nitta
Randomized counter-based algorithms for frequency estimation over data streams in O(log⁡log⁡N) space. Theor. Comput. Sci. 984 (2024)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Bandit Task Assignment with Unknown Processing Time. NeurIPS (2023)
Naonori Kakimura, Tomohiro Nakayoshi
Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays. CoRR (2023)
Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem. CoRR (2023)
Naonori Kakimura, Tomohiro Nakayoshi
Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays. COCOON (2) (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithmic Theory of Qubit Routing. WADS (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979 (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithmic Theory of Qubit Routing. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. ICALP (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms 19 (1) (2023)
Chien-Chung Huang, Naonori Kakimura
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. Theory Comput. Syst. 66 (1) (2022)
Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. SIAM J. Discret. Math. 36 (1) (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Oper. Res. Lett. 50 (3) (2022)
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Online Task Assignment Problems with Reusable Resources. AAAI (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. 36 (2) (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments under Dichotomous Preferences. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. CoRR (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments Under Dichotomous Preferences. PRIMA (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. AAAI (2022)
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Online Task Assignment Problems with Reusable Resources. CoRR (2022)
Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. 44 (Part) (2022)
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
Market Pricing for Matroid Rank Valuations. SIAM J. Discret. Math. 35 (4) (2021)
Naonori Kakimura, Donghao Zhu
Dynamic Bipartite Matching Market with Arrivals and Departures. CoRR (2021)
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. CoRR (2021)
Chien-Chung Huang, Naonori Kakimura
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. Algorithmica 83 (3) (2021)
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. AISTATS (2021)
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. AAAI (2021)
Naonori Kakimura, Donghao Zhu
Dynamic Bipartite Matching Market with Arrivals and Departures. WINE (2021)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR (2021)
Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
Spectral aspects of symmetric matrix signings. Discret. Optim. 37 (2020)
Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
Complexity of the multi-service center problem. Theor. Comput. Sci. 842 (2020)
Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. Algorithmica 82 (4) (2020)
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
Market Pricing for Matroid Rank Valuations. CoRR (2020)
Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. CoRR (2020)
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
The b-branching problem in digraphs. Discret. Appl. Math. 283 (2020)
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
Market Pricing for Matroid Rank Valuations. ISAAC (2020)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS (2020)
Chien-Chung Huang, Naonori Kakimura
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. WADS (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA (2019)
Masataka Gohda, Naonori Kakimura
Online Spectral Approximation in Random Order Streams. CoRR (2019)
Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
Exact and approximation algorithms for weighted matroid intersection. Math. Program. 177 (1-2) (2019)
Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. ECML/PKDD (1) (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica 81 (1) (2019)
Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. PRICAI (1) (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR (2019)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. NeurIPS (2019)
Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
Spectral Aspects of Symmetric Matrix Signings. MFCS (2019)
Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR (2019)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
Total dual integrality of the linear complementarity problem. Ann. Oper. Res. 274 (1-2) (2019)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS (2019)
Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. CoRR (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. 37 (2) (2019)
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
The b-branching problem in digraphs. CoRR (2018)
Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
Causal Bandits with Propagating Inference. ICML (2018)
Norie Fu, Naonori Kakimura, Kei Kimura, Vorapong Suppakitpaisarn
Maximum lifetime coverage problem with battery recovery effect. Sustain. Comput. Informatics Syst. 18 (2018)
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
The b-Branching Problem in Digraphs. MFCS (2018)
Atsushi Miyauchi, Naonori Kakimura
Finding a Dense Subgraph with Sparse Cut. CIKM (2018)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. NeurIPS (2018)
Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi
Boosting PageRank Scores by Optimizing Internal Link Structure. DEXA (1) (2018)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Online Regression with Partial Information: Generalization and Linear Projection. AISTATS (2018)
Chien-Chung Huang, Naonori Kakimura
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. CoRR (2018)
Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
Causal Bandits with Propagating Inference. CoRR (2018)
Naonori Kakimura, Ken-ichi Kawarabayashi
The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs. J. Comb. Theory, Ser. B 131 (2018)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON (2017)
Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. NIPS (2017)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Efficient stabilization of cooperative matching games. Theor. Comput. Sci. 677 (2017)
Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
Complexity of the Multi-Service Center Problem. ISAAC (2017)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada
Tight Approximability of the Server Allocation Problem for Real-Time Applications. ALGOCLOUD (2017)
Prompong Pakawanwong, Vorapong Suppakitpaisarn, Liwen Xu, Naonori Kakimura
Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations. GLOBECOM (2017)
Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida
Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. APPROX-RANDOM (2017)
Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. IJCAI (2017)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
Parameterized Complexity of Sparse Linear Complementarity Problems. Algorithmica 79 (1) (2017)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Efficient Stabilization of Cooperative Matching Games. AAMAS (2016)
Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi
Maximizing Time-Decaying Influence in Social Networks. ECML/PKDD (1) (2016)
Naonori Kakimura, Ken-ichi Kawarabayashi
Coloring immersion-free graphs. J. Comb. Theory, Ser. B 121 (2016)
Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
Exact and Approximation Algorithms for Weighted Matroid Intersection. SODA (2016)
Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura
Threshold Influence Model for Allocating Advertising Budgets. ICML (2015)
Naonori Kakimura, Ken-ichi Kawarabayashi
Fixed-parameter tractability for subset feedback set problems with parity constraints. Theor. Comput. Sci. 576 (2015)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
Parameterized Complexity of Sparse Linear Complementarity Problems. IPEC (2015)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
The Linear Complementarity Problems with a Few Variables per Constraint. Math. Oper. Res. 40 (4) (2015)
Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. ICML (2014)
Naonori Kakimura, Mizuyo Takamatsu
Matching Problems with Delta-Matroid Constraints. SIAM J. Discret. Math. 28 (2) (2014)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC (2014)
Norie Fu, Vorapong Suppakitpaisarn, Kei Kimura, Naonori Kakimura
Maximum lifetime coverage problems with battery recovery effects. GLOBECOM (2014)
Naonori Kakimura, Ken-ichi Kawarabayashi
Half-integral packing of odd cycles through prescribed vertices. Comb. 33 (5) (2013)
Naonori Kakimura, Kazuhisa Makino
Robust Independence Systems. SIAM J. Discret. Math. 27 (3) (2013)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
Sparse Linear Complementarity Problems. CIAC (2013)
Naonori Kakimura, Ken-ichi Kawarabayashi
Packing Directed Circuits through Prescribed Vertices Bounded Fractionally. SIAM J. Discret. Math. 26 (3) (2012)
Naonori Kakimura, Mizuyo Takamatsu
Matching Problems with Delta-Matroid Constraints. CATS (2012)
Naonori Kakimura, Ken-ichi Kawarabayashi
Packing cycles through prescribed vertices under modularity constraints. Adv. Appl. Math. 49 (2) (2012)
Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. SODA (2012)

Naonori Kakimura.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Naonori Kakimura