( en | de | ru )

 

Disambiguation of "Kamiyama, Naoyuki"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Approximability of the Server Allocation Problem for Real-Time Applications.

, , , , , and . ALGOCLOUD, volume 10739 of Lecture Notes in Computer Science, page 41-55. Springer, (2017)

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 Kamiyama, Naoyuki
add a person with the name Kamiyama, Naoyuki
 

Other publications of authors with the same name

On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games., and . CoRR, (2022)A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 802-811. Springer, (2009)Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints.. WAOA, volume 10787 of Lecture Notes in Computer Science, page 90-101. Springer, (2017)An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths., , and . AAIM, volume 4508 of Lecture Notes in Computer Science, page 178-190. Springer, (2007)On the Complexity of Fair House Allocation., , and . CoRR, (2021)Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints.. SAGT, volume 9347 of Lecture Notes in Computer Science, page 3-14. Springer, (2015)On Connectedness of Solutions to Integer Linear Systems., and . COCOA (1), volume 14461 of Lecture Notes in Computer Science, page 421-433. Springer, (2023)An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity., , and . AAIM, volume 4041 of Lecture Notes in Computer Science, page 231-242. Springer, (2006)Reconfiguration of Maximum-Weight b-Matchings in a Graph., , , , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 287-296. Springer, (2017)Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints.. AAMAS, page 583-591. International Foundation for Autonomous Agents and Multiagent Systems, (2019)