( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On packing arborescences in temporal networks.

, и . Inf. Process. Lett., 115 (2): 321-325 (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.

No persons found for author name Kamiyama, Naoyuki
add a person with the name Kamiyama, Naoyuki
 

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

Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints.. WAOA, том 10787 из Lecture Notes in Computer Science, стр. 90-101. Springer, (2017)A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths., и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 802-811. Springer, (2009)On the Complexity of Fair House Allocation., , и . CoRR, (2021)On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games., и . CoRR, (2022)Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints.. SAGT, том 9347 из Lecture Notes in Computer Science, стр. 3-14. Springer, (2015)An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths., , и . AAIM, том 4508 из Lecture Notes in Computer Science, стр. 178-190. Springer, (2007)On Connectedness of Solutions to Integer Linear Systems., и . COCOA (1), том 14461 из Lecture Notes in Computer Science, стр. 421-433. Springer, (2023)Minimum-Cost b -Edge Dominating Sets on Trees., , , , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 195-207. Springer, (2014)Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints.. AAMAS, стр. 583-591. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Algorithms for Gerrymandering over Graphs., , , и . AAMAS, стр. 1413-1421. International Foundation for Autonomous Agents and Multiagent Systems, (2019)