default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaonori Kakimura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j35]Naonori Kakimura
, Riku Nitta:
Randomized counter-based algorithms for frequency estimation over data streams in O(loglogN) space. Theor. Comput. Sci. 984: 114317 (2024)- [c52]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: 12708-12716 - [c51]Naonori Kakimura, Ildikó Schlotter:
Parameterized Complexity of Submodular Minimization Under Uncertainty. SWAT 2024: 30:1-30:17 - [i24]Naonori Kakimura, Ildikó Schlotter:
Parameterized Complexity of Submodular Minimization under Uncertainty. CoRR abs/2404.07516 (2024) - [i23]Naonori Kakimura, Rio Katsu:
On Approximating the Weighted Region Problem in Square Tessellations. CoRR abs/2407.18758 (2024) - [i22]Naonori Kakimura, Yuta Mishima:
Reconfiguration of labeled matchings in triangular grid graphs. CoRR abs/2409.11723 (2024) - 2023
- [j34]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): 6:1-6:22 (2023) - [j33]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979: 114196 (2023) - [c50]Naonori Kakimura, Tomohiro Nakayoshi:
Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays. COCOON (2) 2023: 238-249 - [c49]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: 81:1-81:19 - [c48]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: 82:1-82:17 - [c47]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Bandit Task Assignment with Unknown Processing Time. NeurIPS 2023 - [c46]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. WADS 2023: 533-546 - [e1]Satoru Iwata, Naonori Kakimura:
34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan. LIPIcs 283, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-289-1 [contents] - [i21]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 abs/2304.14782 (2023) - [i20]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. CoRR abs/2305.02059 (2023) - [i19]Naonori Kakimura, Tomohiro Nakayoshi:
Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays. CoRR abs/2310.18071 (2023) - [i18]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 abs/2312.12400 (2023) - 2022
- [j32]Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. 44(Part): 100631 (2022) - [j31]Chien-Chung Huang, Naonori Kakimura:
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. Theory Comput. Syst. 66(1): 354-394 (2022) - [j30]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): 370-375 (2022) - [j29]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): 355-382 (2022) - [j28]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. 36(2): 1102-1123 (2022) - [c45]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. AAAI 2022: 5084-5091 - [c44]Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Task Assignment Problems with Reusable Resources. AAAI 2022: 5199-5207 - [c43]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments Under Dichotomous Preferences. PRIMA 2022: 650-658 - [c42]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: 1342-1355 - [i17]Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Task Assignment Problems with Reusable Resources. CoRR abs/2203.07605 (2022) - [i16]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. CoRR abs/2207.02641 (2022) - [i15]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments under Dichotomous Preferences. CoRR abs/2209.10262 (2022) - [i14]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Rerouting Planar Curves and Disjoint Paths. CoRR abs/2210.11778 (2022) - 2021
- [j27]Chien-Chung Huang, Naonori Kakimura:
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. Algorithmica 83(3): 879-902 (2021) - [j26]Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. SIAM J. Discret. Math. 35(4): 2662-2678 (2021) - [c41]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: 9791-9798 - [c40]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: 3367-3375 - [c39]Naonori Kakimura, Donghao Zhu:
Dynamic Bipartite Matching Market with Arrivals and Departures. WINE 2021: 544 - [i13]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 abs/2101.07957 (2021) - [i12]Naonori Kakimura, Donghao Zhu:
Dynamic Bipartite Matching Market with Arrivals and Departures. CoRR abs/2110.10824 (2021) - [i11]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 abs/2110.11585 (2021) - 2020
- [j25]Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida:
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. Algorithmica 82(4): 1006-1032 (2020) - [j24]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-branching problem in digraphs. Discret. Appl. Math. 283: 565-576 (2020) - [j23]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral aspects of symmetric matrix signings. Discret. Optim. 37: 100582 (2020) - [j22]Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi:
Complexity of the multi-service center problem. Theor. Comput. Sci. 842: 18-27 (2020) - [c38]Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. ISAAC 2020: 39:1-39:15 - [c37]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS 2020 - [i10]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 abs/2002.05477 (2020) - [i9]Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. CoRR abs/2007.08759 (2020)
2010 – 2019
- 2019
- [j21]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica 81(1): 343-366 (2019) - [j20]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Total dual integrality of the linear complementarity problem. Ann. Oper. Res. 274(1-2): 531-553 (2019) - [j19]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. 37(2): 454-464 (2019) - [j18]Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama:
Exact and approximation algorithms for weighted matroid intersection. Math. Program. 177(1-2): 85-112 (2019) - [c36]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA 2019: 61:1-61:15 - [c35]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral Aspects of Symmetric Matrix Signings. MFCS 2019: 81:1-81:13 - [c34]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: 10589-10598 - [c33]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS 2019: 12027-12036 - [c32]Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki:
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. ECML/PKDD (1) 2019: 378-394 - [c31]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: 568-582 - [c30]Chien-Chung Huang, Naonori Kakimura:
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. WADS 2019: 438-451 - [i8]Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki:
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. CoRR abs/1904.08178 (2019) - [i7]Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi:
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR abs/1906.05998 (2019) - [i6]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR abs/1907.01700 (2019) - [i5]Masataka Gohda, Naonori Kakimura:
Online Spectral Approximation in Random Order Streams. CoRR abs/1911.08800 (2019) - 2018
- [j17]Naonori Kakimura, Ken-ichi Kawarabayashi:
The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs. J. Comb. Theory B 131: 138-169 (2018) - [j16]Norie Fu, Naonori Kakimura, Kei Kimura, Vorapong Suppakitpaisarn:
Maximum lifetime coverage problem with battery recovery effect. Sustain. Comput. Informatics Syst. 18: 1-13 (2018) - [c29]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: 1599-1607 - [c28]Atsushi Miyauchi, Naonori Kakimura:
Finding a Dense Subgraph with Sparse Cut. CIKM 2018: 547-556 - [c27]Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi:
Boosting PageRank Scores by Optimizing Internal Link Structure. DEXA (1) 2018: 424-439 - [c26]Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Causal Bandits with Propagating Inference. ICML 2018: 5508-5516 - [c25]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-Branching Problem in Digraphs. MFCS 2018: 12:1-12:15 - [c24]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: 10611-10620 - [i4]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-branching problem in digraphs. CoRR abs/1802.02381 (2018) - [i3]Chien-Chung Huang, Naonori Kakimura:
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. CoRR abs/1802.06212 (2018) - [i2]Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Causal Bandits with Propagating Inference. CoRR abs/1806.02252 (2018) - 2017
- [j15]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Parameterized Complexity of Sparse Linear Complementarity Problems. Algorithmica 79(1): 42-65 (2017) - [j14]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): 766-782 (2017) - [j13]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Efficient stabilization of cooperative matching games. Theor. Comput. Sci. 677: 69-82 (2017) - [c23]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: 41-55 - [c22]Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida:
Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. APPROX-RANDOM 2017: 11:1-11:14 - [c21]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON 2017: 287-296 - [c20]Prompong Pakawanwong, Vorapong Suppakitpaisarn, Liwen Xu, Naonori Kakimura:
Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations. GLOBECOM 2017: 1-7 - [c19]Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi:
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. IJCAI 2017: 4412-4418 - [c18]Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi:
Complexity of the Multi-Service Center Problem. ISAAC 2017: 48:1-48:12 - [c17]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: 4099-4108 - 2016
- [j12]Naonori Kakimura, Ken-ichi Kawarabayashi:
Coloring immersion-free graphs. J. Comb. Theory B 121: 284-307 (2016) - [c16]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Efficient Stabilization of Cooperative Matching Games. AAMAS 2016: 41-49 - [c15]Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi:
Maximizing Time-Decaying Influence in Social Networks. ECML/PKDD (1) 2016: 132-147 - [c14]Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama:
Exact and Approximation Algorithms for Weighted Matroid Intersection. SODA 2016: 430-444 - 2015
- [j11]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
The Linear Complementarity Problems with a Few Variables per Constraint. Math. Oper. Res. 40(4): 1015-1026 (2015) - [j10]Naonori Kakimura, Ken-ichi Kawarabayashi:
Fixed-parameter tractability for subset feedback set problems with parity constraints. Theor. Comput. Sci. 576: 61-76 (2015) - [c13]Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura:
Threshold Influence Model for Allocating Advertising Budgets. ICML 2015: 1395-1404 - [c12]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Parameterized Complexity of Sparse Linear Complementarity Problems. IPEC 2015: 355-364 - 2014
- [j9]Naonori Kakimura, Mizuyo Takamatsu:
Matching Problems with Delta-Matroid Constraints. SIAM J. Discret. Math. 28(2): 942-961 (2014) - [c11]Norie Fu, Vorapong Suppakitpaisarn, Kei Kimura, Naonori Kakimura:
Maximum lifetime coverage problems with battery recovery effects. GLOBECOM 2014: 118-124 - [c10]Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi:
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. ICML 2014: 351-359 - [c9]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC 2014: 195-207 - 2013
- [j8]Naonori Kakimura, Ken-ichi Kawarabayashi:
Half-integral packing of odd cycles through prescribed vertices. Comb. 33(5): 549-572 (2013) - [j7]Naonori Kakimura, Kazuhisa Makino:
Robust Independence Systems. SIAM J. Discret. Math. 27(3): 1257-1273 (2013) - [c8]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Sparse Linear Complementarity Problems. CIAC 2013: 358-369 - 2012
- [j6]Naonori Kakimura, Ken-ichi Kawarabayashi:
Packing cycles through prescribed vertices under modularity constraints. Adv. Appl. Math. 49(2): 97-110 (2012) - [j5]Naonori Kakimura, Ken-ichi Kawarabayashi:
Packing Directed Circuits through Prescribed Vertices Bounded Fractionally. SIAM J. Discret. Math. 26(3): 1121-1133 (2012) - [c7]Naonori Kakimura, Mizuyo Takamatsu:
Matching Problems with Delta-Matroid Constraints. CATS 2012: 83-92 - [c6]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: 1726-1736 - 2011
- [j4]Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx:
Packing cycles through prescribed vertices. J. Comb. Theory B 101(5): 378-381 (2011) - [c5]Naonori Kakimura, Kazuhisa Makino:
Robust Independence Systems. ICALP (1) 2011: 367-378 - [c4]Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità:
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. IPCO 2011: 170-182 - [c3]Naonori Kakimura, Kazuhisa Makino, Kento Seimi:
Computing Knapsack Solutions with Cardinality Robustness. ISAAC 2011: 693-702 - 2010
- [j3]Naonori Kakimura:
Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem. J. Comb. Theory B 100(6): 650-670 (2010) - [i1]Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità:
Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps. CoRR abs/1012.3295 (2010)
2000 – 2009
- 2008
- [j2]Satoru Iwata, Naonori Kakimura:
Solving linear programs from sign patterns. Math. Program. 114(2): 393-418 (2008) - 2007
- [j1]Naonori Kakimura, Satoru Iwata:
Computing the inertia from sign patterns. Math. Program. 110(1): 229-244 (2007) - [c2]Naonori Kakimura:
Sign-Solvable Linear Complementarity Problems. IPCO 2007: 397-409 - 2005
- [c1]Naonori Kakimura, Satoru Iwata:
Computing the Inertia from Sign Patterns. IPCO 2005: 236-248
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
