He Sun
Loading Google Thumbnails...
| 2011 |
|---|
| 9 | Minimum Manhattan Network is NP-Complete. Francis Y. L. Chin, Zeyu Guo, He Sun. Discrete & Computational Geometry (45): 701-722 (2011). Web SearchBibTeXDownload |
| 8 | Greedy Construction of 2-Approximate Minimum Manhattan Networks. Zeyu Guo, He Sun, Hong Zhu. Int. J. Comput. Geometry Appl. (21): 331-350 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 7 | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang. TAMC 2010, 308-319. Web SearchBibTeXDownload |
| 2009 |
|---|
| 6 | On Construction of Almost-Ramanujan Graphs. He Sun, Hong Zhu. COCOA 2009, 197-207. Web SearchBibTeXDownload |
| 5 | Minimum Manhattan network is NP-complete. Francis Y. L. Chin, Zeyu Guo, He Sun. Symposium on Computational Geometry 2009, 393-402. Web SearchBibTeXDownload |
| 4 | Two improved range-efficient algorithms for F0 estimation. He Sun, Chung Keung Poon. Theor. Comput. Sci. (410): 1073-1080 (2009). Web SearchBibTeXDownload |
| 2008 |
|---|
| 3 | A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. Zeyu Guo, He Sun, Hong Zhu. AAIM 2008, 212-223. Web SearchBibTeXDownload |
| 2 | Greedy Construction of 2-Approximation Minimum Manhattan Network. Zeyu Guo, He Sun, Hong Zhu. ISAAC 2008, 4-15. Web SearchBibTeXDownload |
| 2007 |
|---|
| 1 | Two Improved Range-Efficient Algorithms for F 0 Estimation. He Sun, Chung Keung Poon. TAMC 2007, 659-669. Web SearchBibTeXDownload |
from DBLP and Google Scholar
