| Year |
Citation |
Score |
| 2009 |
Ngo HQ, Nguyen T, Ha DT. Analyzing Nonblocking Multilog Networks With The König–Egevarý Theorem Discrete Mathematics, Algorithms and Applications. 1: 127-139. DOI: 10.1142/S1793830909000117 |
0.399 |
|
| 2009 |
Yoon S, Ha DT, Ngo HQ, Qiao C. MoPADS: A mobility profile aided file downloading service in vehicular networks Ieee Transactions On Vehicular Technology. 58: 5235-5246. DOI: 10.1109/Tvt.2009.2029121 |
0.331 |
|
| 2009 |
Ngo HQ, Wang Y, Pan D. Rearrangeable and nonblocking [w,f]-distributors Ieee/Acm Transactions On Networking. 17: 990-1001. DOI: 10.1109/Tnet.2008.2001728 |
0.308 |
|
| 2008 |
Ngo HQ, Wang Y, Le A. A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5092: 510-520. DOI: 10.1007/S10878-009-9240-Y |
0.403 |
|
| 2008 |
Ngo HQ. On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design Journal of Combinatorial Optimization. 15: 61-76. DOI: 10.1007/S10878-007-9084-2 |
0.377 |
|
| 2007 |
Ha DT, Ngo HQ. On the trade-off between speed and resiliency of flashworms and similar malcodes Worm'07 - Proceedings of the 2007 Acm Workshop On Recurring Malcode. 23-30. DOI: 10.1007/S11416-009-0124-6 |
0.315 |
|
| 2007 |
Wang Y, Ngo HQ, Nguyen TN. Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors 2007 Ieee Workshop On High Performance Switching and Routing, Hpsr. 199-204. DOI: 10.1007/S10878-011-9402-6 |
0.385 |
|
| 2005 |
Ngo HQ. WDM switching networks, rearrangeable and nonblocking [w, f]-connectors Siam Journal On Computing. 35: 766-785. DOI: 10.1137/S0097539704442714 |
0.347 |
|
| 2005 |
Ngo HQ, Pan D, Yang Y. Optical switching networks with minimum number of limited range wavelength converters Proceedings - Ieee Infocom. 2: 1128-1138. DOI: 10.1109/Tnet.2007.896256 |
0.346 |
|
| 2005 |
Chinchani R, Ha D, Iyer A, Ngo HQ, Upadhyaya S. On the hardness of approximating the Min-Hack problem Journal of Combinatorial Optimization. 9: 295-311. DOI: 10.1007/S10878-005-1413-8 |
0.346 |
|
| 2004 |
Ruan L, Han S, Li D, Ngo HQ, Huang SC-. Transmission Fault-Tolerance Of Iterated Line Digraphs Journal of Interconnection Networks. 5: 475-487. DOI: 10.1142/S021926590400126X |
0.557 |
|
| 2003 |
Cheng X, Du X, Min M, Ngo HQ, Ruan L, Sun J, Wu W. Super link-connectivity of iterated line digraphs Theoretical Computer Science. 304: 461-469. DOI: 10.1016/S0304-3975(03)00282-2 |
0.611 |
|
| 2003 |
Ngo HQ. A new routing algorithm for multirate rearrangeable Clos networks Theoretical Computer Science. 290: 2157-2167. DOI: 10.1016/S0304-3975(02)00579-0 |
0.344 |
|
| 2002 |
Du DZ, Hwang FK, Jia X, Ngo HQ. Optimal consecutive-k-out-of-n: G cycle for n ≤ 2k + 1 Siam Journal On Discrete Mathematics. 15: 305-316. DOI: 10.1137/S0895480100375041 |
0.49 |
|
| 2002 |
Ngo HQ, Du DZ, Graham RL. New bounds on a hypercube coloring problem Information Processing Letters. 84: 265-269. DOI: 10.1016/S0020-0190(02)00301-0 |
0.482 |
|
| 2002 |
Du D, Hsu D, Ngo HQ, Peck G. On connectivity of consecutive-d digraphs Discrete Mathematics. 257: 371-384. DOI: 10.1016/S0012-365X(02)00436-3 |
0.53 |
|
| 2002 |
Ngo HQ, Du D. New constructions of non-adaptive and error-tolerance pooling designs Discrete Mathematics. 243: 161-170. DOI: 10.1016/S0012-365X(00)00465-9 |
0.493 |
|
| 2001 |
Ngo HQ, Du DZ, Graham RL. New bounds on a hypercube coloring problem and linear codes Proceedings - International Conference On Information Technology: Coding and Computing, Itcc 2001. 542-546. DOI: 10.1109/ITCC.2001.918853 |
0.483 |
|
| 2001 |
Du DZ, Hwang FK, Jung Y, Ngo HQ. Optimal Consecutive-k-out-of-(2k + 1): G Cycle Journal of Global Optimization. 19: 51-60. DOI: 10.1023/A:1008308211943 |
0.464 |
|
| Show low-probability matches. |