( en | de | ru )

 

Disambiguation of "Higashikawa, Yuya"

Author of the publication

copydeleteadd this publication to your clipboard
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity.

, , and . J. Graph Algorithms Appl., 18 (4): 539-555 (2014)

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.

Linda Yuya Gorim

 

Other publications of authors with the same name

Optimally Bracing Grid Frameworks with Holes., , , , , and . COCOA, volume 8881 of Lecture Notes in Computer Science, page 474-489. Springer, (2014)Minimax Regret 1-Median Problem in Dynamic Path Networks., , , , and . Theory Comput. Syst., 62 (6): 1392-1408 (2018)Multiple sink location problems in dynamic path networks., , and . Theor. Comput. Sci., (2015)Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights., , , , and . CoRR, (2020)The mixed evacuation problem., , , , and . J. Comb. Optim., 36 (4): 1299-1314 (2018)Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks., , , and . COCOA, volume 12577 of Lecture Notes in Computer Science, page 198-213. Springer, (2020)Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data"., , , , , , , , and . Rev. Socionetwork Strateg., 13 (2): 99-100 (2019)An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks., , , and . ISAAC, volume 123 of LIPIcs, page 14:1-14:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities., , , , , and . CoRR, (2016)Minmax-Regret Evacuation Planning for Cycle Networks., , , , and . TAMC, volume 11436 of Lecture Notes in Computer Science, page 42-58. Springer, (2019)