Naonori Kakimura

126 papers A* 18A 5B 19C 1Misc 1Journal 70Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Computing Power Indices in Weighted Majority Games with Formal Power Series. WALCOM Naonori Kakimura, Yoshihiko Terai
2026	J	`jnl`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. SIAM J. Discret. Math. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2026	J	`jnl`	Parameterized complexity of submodular minimization under uncertainty. J. Comput. Syst. Sci. Naonori Kakimura, Ildikó Schlotter
2026	J	`jnl`	Polynomial Kernels with Reachability for Weighted d-Matroid Intersection. CoRR Chien-Chung Huang, Naonori Kakimura, Yusuke Kobayashi, Tatsuya Terao
2025	J	`jnl`	Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures. ACM Trans. Quantum Comput. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Computing Power Indices in Weighted Majority Games with Formal Power Series. CoRR Naonori Kakimura, Yoshihiko Terai
2025	J	`jnl`	Deterministic primal-dual algorithms for online k-way matching with delays. Theor. Comput. Sci. Naonori Kakimura, Tomohiro Nakayoshi
2025	B	`conf`	Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. ISAAC Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Reforming an Envy-Free Matching. Algorithmica Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	Rerouting Planar Curves and Disjoint Paths. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	Simultaneous Network Design with Restricted Link Usage. CoRR Naonori Kakimura, Péter Madarasi, Jannik Matuschke, Kitti Varga
2024	J	`jnl`	Loss Minimization for Electrical Flows over Spanning Trees on Grids. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2024	A*	`conf`	New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. AAAI Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2024	J	`jnl`	On Approximating the Weighted Region Problem in Square Tessellations. CoRR Naonori Kakimura, Rio Katsu
2024	—	`conf`	Parameterized Complexity of Submodular Minimization Under Uncertainty. SWAT Naonori Kakimura, Ildikó Schlotter
2024	J	`jnl`	Parameterized Complexity of Submodular Minimization under Uncertainty. CoRR Naonori Kakimura, Ildikó Schlotter
2024	J	`jnl`	Randomized counter-based algorithms for frequency estimation over data streams in O(log⁡log⁡N) space. Theor. Comput. Sci. Naonori Kakimura, Riku Nitta
2024	B	`conf`	Reconfiguration of Labeled Matchings in Triangular Grid Graphs. ISAAC Naonori Kakimura, Yuta Mishima
2024	J	`jnl`	Reconfiguration of labeled matchings in triangular grid graphs. CoRR Naonori Kakimura, Yuta Mishima
2023	B	`ed.`	34th International Symposium on Algorithms and Computation, ISAAC 2023, Kyoto, Japan, December 3-6, 2023 ISAAC Satoru Iwata, Naonori Kakimura
2023	B	`conf`	Algorithmic Theory of Qubit Routing. WADS Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023	J	`jnl`	Algorithmic Theory of Qubit Routing. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023	A*	`conf`	Bandit Task Assignment with Unknown Processing Time. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2023	—	`conf`	Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays. COCOON (2) Naonori Kakimura, Tomohiro Nakayoshi
2023	J	`jnl`	Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays. CoRR Naonori Kakimura, Tomohiro Nakayoshi
2023	A*	`conf`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023	J	`jnl`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023	J	`jnl`	Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	J	`jnl`	New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem. CoRR Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2023	J	`jnl`	On reachable assignments under dichotomous preferences. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	A*	`conf`	Rerouting Planar Curves and Disjoint Paths. ICALP Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Oper. Res. Lett. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	J	`jnl`	Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. SIAM J. Discret. Math. Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida
2022	A*	`conf`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. Theory Comput. Syst. Chien-Chung Huang, Naonori Kakimura
2022	B	`conf`	On Reachable Assignments Under Dichotomous Preferences. PRIMA Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	On Reachable Assignments under Dichotomous Preferences. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	A*	`conf`	Online Task Assignment Problems with Reusable Resources. AAAI Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2022	J	`jnl`	Online Task Assignment Problems with Reusable Resources. CoRR Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2022	A*	`conf`	Reforming an Envy-Free Matching. AAAI Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Reforming an Envy-Free Matching. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Rerouting Planar Curves and Disjoint Paths. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	J	`jnl`	Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2021	A	`conf`	A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. AISTATS Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2021	—	`conf`	Dynamic Bipartite Matching Market with Arrivals and Departures. WINE Naonori Kakimura, Donghao Zhu
2021	J	`jnl`	Dynamic Bipartite Matching Market with Arrivals and Departures. CoRR Naonori Kakimura, Donghao Zhu
2021	J	`jnl`	Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. Algorithmica Chien-Chung Huang, Naonori Kakimura
2021	J	`jnl`	Market Pricing for Matroid Rank Valuations. SIAM J. Discret. Math. Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2021	J	`jnl`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2021	A*	`conf`	Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. AAAI Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2021	J	`jnl`	Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. CoRR Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2020	J	`jnl`	Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. CoRR Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida
2020	J	`jnl`	Complexity of the multi-service center problem. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
2020	A*	`conf`	Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2020	B	`conf`	Market Pricing for Matroid Rank Valuations. ISAAC Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2020	J	`jnl`	Market Pricing for Matroid Rank Valuations. CoRR Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2020	J	`jnl`	Spectral aspects of symmetric matrix signings. Discret. Optim. Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
2020	J	`jnl`	Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. Algorithmica Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida
2020	J	`jnl`	The b-branching problem in digraphs. Discret. Appl. Math. Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
2019	J	`jnl`	Exact and approximation algorithms for weighted matroid intersection. Math. Program. Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
2019	A*	`conf`	Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	B	`conf`	Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. WADS Chien-Chung Huang, Naonori Kakimura
2019	J	`jnl`	Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	—	`conf`	Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. PRICAI (1) Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	J	`jnl`	Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	—	`conf`	Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. ECML/PKDD (1) Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki
2019	J	`jnl`	Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. CoRR Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki
2019	J	`jnl`	Online Spectral Approximation in Random Order Streams. CoRR Masataka Gohda, Naonori Kakimura
2019	A*	`conf`	Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	J	`jnl`	Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	A	`conf`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	B	`conf`	Spectral Aspects of Symmetric Matrix Signings. MFCS Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
2019	J	`jnl`	Total dual integrality of the linear complementarity problem. Ann. Oper. Res. Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2018	—	`conf`	Boosting PageRank Scores by Optimizing Internal Link Structure. DEXA (1) Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi
2018	A*	`conf`	Causal Bandits with Propagating Inference. ICML Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
2018	J	`jnl`	Causal Bandits with Propagating Inference. CoRR Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
2018	A	`conf`	Finding a Dense Subgraph with Sparse Cut. CIKM Atsushi Miyauchi, Naonori Kakimura
2018	J	`jnl`	Maximum lifetime coverage problem with battery recovery effect. Sustain. Comput. Informatics Syst. Norie Fu, Naonori Kakimura, Kei Kimura, Vorapong Suppakitpaisarn
2018	J	`jnl`	Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. CoRR Chien-Chung Huang, Naonori Kakimura
2018	A	`conf`	Online Regression with Partial Information: Generalization and Linear Projection. AISTATS Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2018	A*	`conf`	Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2018	J	`jnl`	The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs. J. Comb. Theory B Naonori Kakimura, Ken-ichi Kawarabayashi
2018	B	`conf`	The b-Branching Problem in Digraphs. MFCS Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
2018	J	`jnl`	The b-branching problem in digraphs. CoRR Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
2017	A*	`conf`	An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. IJCAI Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi
2017	B	`conf`	Complexity of the Multi-Service Center Problem. ISAAC Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
2017	—	`conf`	Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. NIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2017	J	`jnl`	Efficient stabilization of cooperative matching games. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017	J	`jnl`	Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. SIAM J. Discret. Math. Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi
2017	J	`jnl`	Parameterized Complexity of Sparse Linear Complementarity Problems. Algorithmica Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2017	Misc	`conf`	Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017	B	`conf`	Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations. GLOBECOM Prompong Pakawanwong, Vorapong Suppakitpaisarn, Liwen Xu, Naonori Kakimura
2017	—	`conf`	Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. APPROX-RANDOM Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida
2017	—	`conf`	Tight Approximability of the Server Allocation Problem for Real-Time Applications. ALGOCLOUD Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada
2016	J	`jnl`	Coloring immersion-free graphs. J. Comb. Theory B Naonori Kakimura, Ken-ichi Kawarabayashi
2016	A	`conf`	Efficient Stabilization of Cooperative Matching Games. AAMAS Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2016	A*	`conf`	Exact and Approximation Algorithms for Weighted Matroid Intersection. SODA Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
2016	—	`conf`	Maximizing Time-Decaying Influence in Social Networks. ECML/PKDD (1) Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi
2015	J	`jnl`	Fixed-parameter tractability for subset feedback set problems with parity constraints. Theor. Comput. Sci. Naonori Kakimura, Ken-ichi Kawarabayashi
2015	B	`conf`	Parameterized Complexity of Sparse Linear Complementarity Problems. IPEC Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2015	J	`jnl`	The Linear Complementarity Problems with a Few Variables per Constraint. Math. Oper. Res. Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2015	A*	`conf`	Threshold Influence Model for Allocating Advertising Budgets. ICML Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura
2014	J	`jnl`	Matching Problems with Delta-Matroid Constraints. SIAM J. Discret. Math. Naonori Kakimura, Mizuyo Takamatsu
2014	B	`conf`	Maximum lifetime coverage problems with battery recovery effects. GLOBECOM Norie Fu, Vorapong Suppakitpaisarn, Kei Kimura, Naonori Kakimura
2014	B	`conf`	Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2014	A*	`conf`	Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. ICML Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi
2013	J	`jnl`	Half-integral packing of odd cycles through prescribed vertices. Comb. Naonori Kakimura, Ken-ichi Kawarabayashi
2013	J	`jnl`	Robust Independence Systems. SIAM J. Discret. Math. Naonori Kakimura, Kazuhisa Makino
2013	C	`conf`	Sparse Linear Complementarity Problems. CIAC Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2012	A*	`conf`	Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. SODA Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	—	`conf`	Matching Problems with Delta-Matroid Constraints. CATS Naonori Kakimura, Mizuyo Takamatsu
2012	J	`jnl`	Packing Directed Circuits through Prescribed Vertices Bounded Fractionally. SIAM J. Discret. Math. Naonori Kakimura, Ken-ichi Kawarabayashi
2012	J	`jnl`	Packing cycles through prescribed vertices under modularity constraints. Adv. Appl. Math. Naonori Kakimura, Ken-ichi Kawarabayashi
2011	B	`conf`	Computing Knapsack Solutions with Cardinality Robustness. ISAAC Naonori Kakimura, Kazuhisa Makino, Kento Seimi
2011	J	`jnl`	Packing cycles through prescribed vertices. J. Comb. Theory B Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx
2011	—	`conf`	Robust Independence Systems. ICALP (1) Naonori Kakimura, Kazuhisa Makino
2011	B	`conf`	Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. IPCO Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità
2010	J	`jnl`	Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem. J. Comb. Theory B Naonori Kakimura
2010	J	`jnl`	Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps CoRR Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità
2008	J	`jnl`	Solving linear programs from sign patterns. Math. Program. Satoru Iwata, Naonori Kakimura
2007	J	`jnl`	Computing the inertia from sign patterns. Math. Program. Naonori Kakimura, Satoru Iwata
2007	B	`conf`	Sign-Solvable Linear Complementarity Problems. IPCO Naonori Kakimura
2005	B	`conf`	Computing the Inertia from Sign Patterns. IPCO Naonori Kakimura, Satoru Iwata