( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Market Pricing for Matroid Rank Valuations.

, , и . SIAM J. Discret. Math., 35 (4): 2662-2678 (2021)

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.

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

Другие публикации лиц с тем же именем

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