| |
| 2008 | ||
|---|---|---|
| 6 | EE | Wenbin Chen, Jiangtao Meng, Dengpan Yin: An improved lower bound for approximating minimum GCD multiplier in linfinity norm (GCDMinfinity). Theor. Comput. Sci. 396(1-3): 1-9 (2008) |
| 2007 | ||
| 5 | EE | Wenbin Chen, Jiangtao Meng: Approximation Algorithms for k -Duplicates Combinatorial Auctions with Subadditive Bidders. COCOA 2007: 163-170 |
| 4 | EE | Wenbin Chen, Jiangtao Meng: An improved lower bound for approximating Shortest Integer Relation in linfinity norm (SIRinfinity). Inf. Process. Lett. 101(4): 174-179 (2007) |
| 3 | EE | Wenbin Chen, Jiangtao Meng: Hardness of approximating the Minimum Solutions of Linear Diophantine Equations. Theor. Comput. Sci. 374(1-3): 191-195 (2007) |
| 2006 | ||
| 2 | EE | Wenbin Chen, Jiangtao Meng: Inapproximability Results for the Closest Vector Problem with Preprocessing over infty Norm. Electronic Colloquium on Computational Complexity (ECCC) 13(052): (2006) |
| 2005 | ||
| 1 | EE | Jiangtao Meng: New directions in mechanism design CoRR abs/cs/0512083: (2005) |
| 1 | Wenbin Chen | [2] [3] [4] [5] [6] |
| 2 | Dengpan Yin | [6] |