Ke Chen

According to our database, Ke Chen authored at least 11 papers between 2006 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2018

Comparisons among Six Numerical Methods for Solving Repetitive Motion Planning of Redundant Robot Manipulators.

Zhijun Zhang, Lingdong Kong, Ziyi Yan, Ke Chen, Shuai Li, Xilong Qu, Ning Tan

Proceedings of the IEEE International Conference on Robotics and Biomimetics, 2018

2009

Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles.

Ke Chen, Haim Kaplan, Micha Sharir

ACM Trans. Algorithms, 2009

On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications.

Ke Chen

SIAM J. Comput., 2009

2008

The Euclidean Orienteering Problem Revisited.

Ke Chen, Sariel Har-Peled

SIAM J. Comput., 2008

A constant factor approximation algorithm for <i>k</i>-median clustering with outliers.

Ke Chen

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Algorithms on Clustering, Orienteering, and Conflict -Free Coloring

Ke Chen

PhD thesis, 2007

Online Conflict-Free Coloring for Intervals.

Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl

SIAM J. Comput., 2007

Cost-Aware Caching Algorithms for Distributed Storage Servers.

Shuang Liang, Ke Chen, Song Jiang, Xiaodong Zhang

Proceedings of the Distributed Computing, 21st International Symposium, 2007

2006

On <i>k</i>-Median clustering in high dimensions.

Ke Chen

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

The orienteering problem in the plane revisited.

Ke Chen, Sariel Har-Peled

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

How to play a coloring game against a color-blind adversary.

Ke Chen

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006