Inapproximability Results for the Closest Vector Problem with Preprocessing over infty Norm. - Wenbin Chen 002; Jiangtao Meng (Electron. Colloquium Comput. Complex., 2006)

Approximation Algorithms for k -Duplicates Combinatorial Auctions with Subadditive Bidders. - Wenbin Chen 002; Jiangtao Meng (COCOA, 2007)

An improved lower bound for approximating Shortest Integer Relation in linfinity norm (SIRinfinity). - Wenbin Chen 002; Jiangtao Meng (Inf. Process. Lett., 2007)

Hardness of approximating the Minimum Solutions of Linear Diophantine Equations. - Wenbin Chen 002; Jiangtao Meng (Theor. Comput. Sci., 2007)

An improved lower bound for approximating minimum GCD multiplier in linfinity norm (GCDMinfinity). - Wenbin Chen 002; Jiangtao Meng; Dengpan Yin (Theor. Comput. Sci., 2008)

Inapproximability results for equations over infinite groups. - Wenbin Chen 002; Dengpan Yin; Zhengzhang Chen (Theor. Comput. Sci., 2010)