( en | de | ru )

 

Disambiguation of "Yao, Enyu"

Author of the publication

copydeleteadd this publication to your clipboard
On rearrangeable multirate three-stage Clos networks.

, and . Theor. Comput. Sci., 372 (1): 103-107 (2007)

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.

Yao Yao

Ilknur enyürek

Hongmei Yao

Haimin Yao

Ning Yao

 

Other publications of authors with the same name

Inverse minimum cost flow problems under the weighted Hamming distance., , , and . Eur. J. Oper. Res., 207 (1): 50-54 (2010)Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance., , , and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 26-35. Springer, (2012)Minimizing the sum cost in linear extensions of a poset., , and . J. Comb. Optim., 21 (2): 247-253 (2011)On rearrangeable multirate three-stage Clos networks., and . Theor. Comput. Sci., 372 (1): 103-107 (2007)Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance., and . ESCAPE, volume 4614 of Lecture Notes in Computer Science, page 375-383. Springer, (2007)Some further results on minimum distribution cost flow problems., , and . J. Comb. Optim., 11 (4): 351-371 (2006)Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance., and . Theor. Comput. Sci., 396 (1-3): 28-34 (2008)Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance., , and . J. Comb. Optim., 9 (1): 91-100 (2005)Minimizing the maximum bump cost in linear extensions of a poset., , and . J. Comb. Optim., 26 (3): 509-519 (2013)A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance., and . Asia Pac. J. Oper. Res., 24 (5): 725-736 (2007)