| SLALoM: A scalable location management scheme for large mobile ad-hoc networks CT Cheng, HL Lemberg, SJ Philip, E van den Berg, T Zhang 2002 IEEE Wireless Communications and Networking Conference Record. WCNC …, 2002 | 127 | 2002 |
| 11 Location Prediction Algorithms for Mobile Wireless Systems C Cheng, R Jain, E van den Berg WIRELESS INTERNET, 245, 2003 | 126 | 2003 |
| Generating small combinatorial test suites to cover input-output relationships C Cheng, A Dumitrescu, P Schroeder Third International Conference on Quality Software, 2003. Proceedings., 76-82, 2003 | 69 | 2003 |
| From discrepancy to declustering: near-optimal multidimensional declustering strategies for range queries CM Chen, CT Cheng Journal of the ACM (JACM) 51 (1), 46-73, 2004 | 64 | 2004 |
| On computing the distinguishing numbers of trees and forests CT Cheng the electronic journal of combinatorics, R11-R11, 2006 | 44 | 2006 |
| Replication and retrieval strategies of multidimensional data on parallel disks CM Chen, CT Cheng Proceedings of the twelfth international conference on Information and …, 2003 | 27 | 2003 |
| On computing the distinguishing numbers of planar graphs and beyond: a counting approach V Arvind, CT Cheng, NR Devanur SIAM Journal on Discrete Mathematics 22 (4), 1297-1324, 2008 | 24 | 2008 |
| On the local distinguishing numbers of cycles CT Cheng, LJ Cowen Discrete mathematics 196 (1-3), 97-108, 1999 | 24 | 1999 |
| Understanding the generalized median stable matchings CT Cheng Algorithmica 58, 34-51, 2010 | 22 | 2010 |
| A unified approach to finding good stable matchings in the hospitals/residents setting C Cheng, E McDermid, I Suzuki Theoretical Computer Science 400 (1-3), 84-99, 2008 | 21 | 2008 |
| On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results CT Cheng Discrete mathematics 309 (16), 5169-5182, 2009 | 19 | 2009 |
| The test suite generation problem: optimal instances and their implications CT Cheng Discrete Applied Mathematics 155 (15), 1943-1957, 2007 | 14 | 2007 |
| Improved approximation algorithms for the demand routing and slotting problem with unit demands on rings CT Cheng SIAM Journal on Discrete Mathematics 17 (3), 384-402, 2004 | 14 | 2004 |
| A poset-based approach to embedding median graphs in hypercubes and lattices CT Cheng Order 29, 147-163, 2012 | 12 | 2012 |
| Optimizing ad hoc trade in a commercial barter trade exchange P Haddawy, C Cheng, N Rujikeadkumjorn, K Dhananaiyapergse Electronic Commerce Research and Applications 4 (4), 299-314, 2005 | 12 | 2005 |
| Balanced matching of buyers and sellers in e-Marketplaces: the barter trade exchange model P Haddawy, N Rujikeadkumjorn, K Dhananaiyapergse, C Cheng Proceedings of the 6th international conference on Electronic commerce, 85-94, 2004 | 12 | 2004 |
| Maximum locally stable matchings CT Cheng, E McDermid Algorithms 6 (3), 383-395, 2013 | 11 | 2013 |
| The generalized median stable matchings: finding them is not that easy CT Cheng LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Búzios …, 2008 | 11 | 2008 |
| Split graphs and Nordhaus–Gaddum graphs C Cheng, KL Collins, AN Trenk Discrete Mathematics 339 (9), 2345-2356, 2016 | 10 | 2016 |
| On the stable matchings that can be reached when the agents go marching in one by one CT Cheng SIAM Journal on Discrete Mathematics 30 (4), 2047-2063, 2016 | 10 | 2016 |
