Sign-Solvable Linear Complementarity Problems. - Naonori Kakimura (IPCO, 2007)

Computing the inertia from sign patterns. - Naonori Kakimura; Satoru Iwata 001 (Math. Program., 2007)

Solving linear programs from sign patterns. - Satoru Iwata 001; Naonori Kakimura (Math. Program., 2008)

Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem. - Naonori Kakimura (J. Comb. Theory B, 2010)

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. - Friedrich Eisenbrand; Naonori Kakimura; Thomas Rothvoß; Laura Sanità (IPCO, 2011)

Computing Knapsack Solutions with Cardinality Robustness. - Naonori Kakimura; Kazuhisa Makino; Kento Seimi (ISAAC, 2011)

Packing cycles through prescribed vertices. - Naonori Kakimura; Ken-ichi Kawarabayashi; Dániel Marx (J. Comb. Theory B, 2011)

Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. - Naonori Kakimura; Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SODA, 2012)

Packing cycles through prescribed vertices under modularity constraints. - Naonori Kakimura; Ken-ichi Kawarabayashi (Adv. Appl. Math., 2012)

Packing Directed Circuits through Prescribed Vertices Bounded Fractionally. - Naonori Kakimura; Ken-ichi Kawarabayashi (SIAM J. Discret. Math., 2012)

Sparse Linear Complementarity Problems. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (CIAC, 2013)

Half-integral packing of odd cycles through prescribed vertices. - Naonori Kakimura; Ken-ichi Kawarabayashi (Comb., 2013)

Robust Independence Systems. - Naonori Kakimura; Kazuhisa Makino (SIAM J. Discret. Math., 2013)

Maximum lifetime coverage problems with battery recovery effects. - Norie Fu; Vorapong Suppakitpaisarn; Kei Kimura; Naonori Kakimura (GLOBECOM, 2014)

Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. - Tasuku Soma; Naonori Kakimura; Kazuhiro Inaba; Ken-ichi Kawarabayashi (ICML, 2014)

Matching Problems with Delta-Matroid Constraints. - Naonori Kakimura; Mizuyo Takamatsu (SIAM J. Discret. Math., 2014)

Threshold Influence Model for Allocating Advertising Budgets. - Atsushi Miyauchi 001; Yuni Iwamasa; Takuro Fukunaga; Naonori Kakimura (ICML, 2015)

The Linear Complementarity Problems with a Few Variables per Constraint. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (Math. Oper. Res., 2015)

Fixed-parameter tractability for subset feedback set problems with parity constraints. - Naonori Kakimura; Ken-ichi Kawarabayashi (Theor. Comput. Sci., 2015)

Maximizing Time-Decaying Influence in Social Networks. - Naoto Ohsaka; Yutaro Yamaguchi 001; Naonori Kakimura; Ken-ichi Kawarabayashi (ECML/PKDD (1), 2016)

Coloring immersion-free graphs. - Naonori Kakimura; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2016)

Tight Approximability of the Server Allocation Problem for Real-Time Applications. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto; Taichi Shiitada (ALGOCLOUD, 2017)

Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations. - Prompong Pakawanwong; Vorapong Suppakitpaisarn; Liwen Xu; Naonori Kakimura (GLOBECOM, 2017)

An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. - Hanna Sumita; Yuma Yonebayashi; Naonori Kakimura; Ken-ichi Kawarabayashi (IJCAI, 2017)

Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NIPS, 2017)

Parameterized Complexity of Sparse Linear Complementarity Problems. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (Algorithmica, 2017)

Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. - Naonori Kakimura; Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2017)

Efficient stabilization of cooperative matching games. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Theor. Comput. Sci., 2017)

Online Regression with Partial Information: Generalization and Linear Projection. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AISTATS, 2018)

Finding a Dense Subgraph with Sparse Cut. - Atsushi Miyauchi 001; Naonori Kakimura (CIKM, 2018)

Boosting PageRank Scores by Optimizing Internal Link Structure. - Naoto Ohsaka; Tomohiro Sonobe; Naonori Kakimura; Takuro Fukunaga; Sumio Fujita; Ken-ichi Kawarabayashi (DEXA (1), 2018)

Causal Bandits with Propagating Inference. - Akihiro Yabe; Daisuke Hatano; Hanna Sumita; Shinji Ito; Naonori Kakimura; Takuro Fukunaga; Ken-ichi Kawarabayashi (ICML, 2018)

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2018)

The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs. - Naonori Kakimura; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2018)

Maximum lifetime coverage problem with battery recovery effect. - Norie Fu; Naonori Kakimura; Kei Kimura; Vorapong Suppakitpaisarn (Sustain. Comput. Informatics Syst., 2018)

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2019)

Improved Regret Bounds for Bandit Combinatorial Optimization. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2019)

Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. - Charalampos E. Tsourakakis; Tianyi Chen; Naonori Kakimura; Jakub Pachocki (ECML/PKDD (1), 2019)

Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. - Daisuke Hatano; Yuko Kuroki; Yasushi Kawase; Hanna Sumita; Naonori Kakimura; Ken-ichi Kawarabayashi (PRICAI (1), 2019)

Minimum-Cost b-Edge Dominating Sets on Trees. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Algorithmica, 2019)

Total dual integrality of the linear complementarity problem. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (Ann. Oper. Res., 2019)

Online Spectral Approximation in Random Order Streams. - Masataka Gohda; Naonori Kakimura (CoRR, 2019)

Reconfiguration of maximum-weight b-matchings in a graph. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (J. Comb. Optim., 2019)

Exact and approximation algorithms for weighted matroid intersection. - Chien-Chung Huang 001; Naonori Kakimura; Naoyuki Kamiyama (Math. Program., 2019)

Delay and Cooperation in Nonstochastic Linear Bandits. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2020)

Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. - Chien-Chung Huang 001; Naonori Kakimura; Yuichi Yoshida (Algorithmica, 2020)

The b-branching problem in digraphs. - Naonori Kakimura; Naoyuki Kamiyama; Kenjiro Takazawa (Discret. Appl. Math., 2020)

Spectral aspects of symmetric matrix signings. - Charles Carlson 002; Karthekeyan Chandrasekaran; Hsien-Chih Chang; Naonori Kakimura; Alexandra Kolla (Discret. Optim., 2020)

Complexity of the multi-service center problem. - Takehiro Ito; Naonori Kakimura; Yusuke Kobayashi 001 (Theor. Comput. Sci., 2020)

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. - Kei Takemura; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2021)

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. - Kei Takemura; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AISTATS, 2021)

Dynamic Bipartite Matching Market with Arrivals and Departures. - Naonori Kakimura; Donghao Zhu (WINE, 2021)

Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. - Chien-Chung Huang 001; Naonori Kakimura (Algorithmica, 2021)

Market Pricing for Matroid Rank Valuations. - Kristóf Bérczi; Naonori Kakimura; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2021)

Online Task Assignment Problems with Reusable Resources. - Hanna Sumita; Shinji Ito; Kei Takemura; Daisuke Hatano; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2022)

Submodular reassignment problem for reallocating agents to tasks with synergy effects. - Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Discret. Optim., 2022)

Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. - Chien-Chung Huang 001; Naonori Kakimura (Theory Comput. Syst., 2022)

A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Oper. Res. Lett., 2022)

Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. - Chien-Chung Huang 001; Naonori Kakimura; Simon Mauras; Yuichi Yoshida (SIAM J. Discret. Math., 2022)

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (SIAM J. Discret. Math., 2022)

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto (ICALP, 2023)

Bandit Task Assignment with Unknown Processing Time. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2023)

Algorithmic Theory of Qubit Routing. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (WADS, 2023)

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2023)

On reachable assignments under dichotomous preferences. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Theor. Comput. Sci., 2023)

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. - Koji Ichikawa; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2024)

Reconfiguration of Labeled Matchings in Triangular Grid Graphs. - Naonori Kakimura; Yuta Mishima (ISAAC, 2024)

Parameterized Complexity of Submodular Minimization Under Uncertainty. - Naonori Kakimura; Ildikó Schlotter (SWAT, 2024)

On Approximating the Weighted Region Problem in Square Tessellations. - Naonori Kakimura; Rio Katsu (CoRR, 2024)

Loss Minimization for Electrical Flows over Spanning Trees on Grids. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (CoRR, 2024)

Randomized counter-based algorithms for frequency estimation over data streams in O(log⁡log⁡N) space. - Naonori Kakimura; Riku Nitta (Theor. Comput. Sci., 2024)

Rerouting Planar Curves and Disjoint Paths. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2025)

Deterministic primal-dual algorithms for online k-way matching with delays. - Naonori Kakimura; Tomohiro Nakayoshi (Theor. Comput. Sci., 2025)

Reforming an Envy-Free Matching. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Algorithmica, 2025)

Simultaneous Network Design with Restricted Link Usage. - Naonori Kakimura; Péter Madarasi; Jannik Matuschke; Kitti Varga (CoRR, 2025)