( en | de | ru )

 

Disambiguation of "Kamiyama, Naoyuki"

Author of the publication

copydeleteadd this publication to your clipboard
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.

, , , , , , , , and . SODA, page 1342-1355. SIAM, (2022)

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

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)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)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)On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games., and . CoRR, (2022)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)Exact and approximation algorithms for weighted matroid intersection., , and . Math. Program., 177 (1-2): 85-112 (2019)On Reachable Assignments Under Dichotomous Preferences., , , , , , and . PRIMA, volume 13753 of Lecture Notes in Computer Science, page 650-658. Springer, (2022)Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking., and . CATS, volume 119 of CRPIT, page 137-144. Australian Computer Society, (2011)