How to play a coloring game against a color-blind adversary. - Ke Chen 006 (SCG, 2006)

The orienteering problem in the plane revisited. - Ke Chen 006; Sariel Har-Peled (SCG, 2006)

On k-Median clustering in high dimensions. - Ke Chen 006 (SODA, 2006)

Cost-Aware Caching Algorithms for Distributed Storage Servers. - Shuang Liang; Ke Chen 006; Song Jiang 001; Xiaodong Zhang 001 (DISC, 2007)

Online Conflict-Free Coloring for Intervals. - Ke Chen 006; Amos Fiat; Haim Kaplan; Meital Levy; Jirí Matousek 001; Elchanan Mossel; János Pach; Micha Sharir; Shakhar Smorodinsky; Uli Wagner 001; Emo Welzl (SIAM J. Comput., 2007)

Algorithms on Clustering, Orienteering, and Conflict -Free Coloring - Ke Chen 006 (2007)

A constant factor approximation algorithm for k-median clustering with outliers. - Ke Chen 006 (SODA, 2008)

The Euclidean Orienteering Problem Revisited. - Ke Chen 006; Sariel Har-Peled (SIAM J. Comput., 2008)

On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications. - Ke Chen 006 (SIAM J. Comput., 2009)

Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. - Ke Chen 006; Haim Kaplan; Micha Sharir (ACM Trans. Algorithms, 2009)

Comparisons among Six Numerical Methods for Solving Repetitive Motion Planning of Redundant Robot Manipulators. - Zhijun Zhang 003; Lingdong Kong; Ziyi Yan; Ke Chen 006; Shuai Li 002; Xilong Qu; Ning Tan 003 (ROBIO, 2018)