![]() | ![]() |
Google / University of Illinois at Urbana-Champaign
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
| 2009 | ||
|---|---|---|
| 9 | Ke Chen, Haim Kaplan, Micha Sharir: Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Transactions on Algorithms 5(2): (2009) | |
| 8 | Ke Chen: On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications. SIAM J. Comput. 39(3): 923-947 (2009) | |
| 2008 | ||
| 7 | Ke Chen: A constant factor approximation algorithm for k-median clustering with outliers. SODA 2008: 826-835 | |
| 6 | Ke Chen, Sariel Har-Peled: The Euclidean Orienteering Problem Revisited. SIAM J. Comput. 38(1): 385-397 (2008) | |
| 2007 | ||
| 5 | Shuang Liang, Ke Chen, Song Jiang, Xiaodong Zhang: Cost-Aware Caching Algorithms for Distributed Storage Servers. DISC 2007: 373-387 | |
| 4 | Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl: Online Conflict-Free Coloring for Intervals. SIAM J. Comput. 36(5): 1342-1359 (2007) | |
| 2006 | ||
| 3 | Ke Chen: On k-Median clustering in high dimensions. SODA 2006: 1177-1185 | |
| 2 | Ke Chen, Sariel Har-Peled: The orienteering problem in the plane revisited. Symposium on Computational Geometry 2006: 247-254 | |
| 1 | Ke Chen: How to play a coloring game against a color-blind adversary. Symposium on Computational Geometry 2006: 44-51 | |
| 1 | Amos Fiat | [4] |
| 2 | Sariel Har-Peled | [2] [6] |
| 3 | Song Jiang | [5] |
| 4 | Haim Kaplan | [4] [9] |
| 5 | Meital Levy | [4] |
| 6 | Shuang Liang | [5] |
| 7 | Jirí Matousek | [4] |
| 8 | Elchanan Mossel | [4] |
| 9 | János Pach | [4] |
| 10 | Micha Sharir | [4] [9] |
| 11 | Shakhar Smorodinsky | [4] |
| 12 | Uli Wagner | [4] |
| 13 | Emo Welzl | [4] |
| 14 | Xiaodong Zhang | [5] |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page