Author of the publication

The Linear Complementarity Problems with a Few Variables per Constraint.

, , and . Math. Oper. Res., 40 (4): 1015-1026 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Kakimura, Naonori
add a person with the name Kakimura, Naonori
 

Other publications of authors with the same name

Half-integral packing of odd cycles through prescribed vertices., and . Combinatorica, 33 (5): 549-572 (2013)Parameterized Complexity of Sparse Linear Complementarity Problems., , and . Algorithmica, 79 (1): 42-65 (2017)Computing Knapsack Solutions with Cardinality Robustness., , and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 693-702. Springer, (2011)An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization., , , and . IJCAI, page 4412-4418. ijcai.org, (2017)Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm., , , and . ICML, volume 32 of JMLR Workshop and Conference Proceedings, page 351-359. JMLR.org, (2014)Fixed-parameter tractability for subset feedback set problems with parity constraints., and . Theor. Comput. Sci., (2015)Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem.. J. Comb. Theory, Ser. B, 100 (6): 650-670 (2010)Matching Problems with Delta-Matroid Constraints., and . CATS, volume 128 of CRPIT, page 83-92. Australian Computer Society, (2012)Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint., , and . APPROX-RANDOM, volume 81 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Delay and Cooperation in Nonstochastic Linear Bandits., , , , , , and . NeurIPS, (2020)