A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on Rings. - Christine T. Cheng (RANDOM-APPROX, 1999)

SLALoM: a scalable location management scheme for large mobile ad-hoc networks. - Christine T. Cheng; Howard L. Lemberg; Sumesh J. Philip; Eric van den Berg; Tao Zhang 005 (WCNC, 2002)

Replication and retrieval strategies of multidimensional data on parallel disks. - Chung-Min Chen; Christine T. Cheng (CIKM, 2003)

Generating Small Combinatorial Test Suites to Cover Input-Output Relationships. - Christine T. Cheng; Adrian Dumitrescu; Patrick J. Schroeder (QSIC, 2003)

Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model. - Peter Haddawy; Namthip Rujikeadkumjorn; Khaimook Dhananaiyapergse; Christine T. Cheng (ICEC, 2004)

From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries. - Chung-Min Chen; Christine T. Cheng (J. ACM, 2004)

Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings. - Christine T. Cheng (SIAM J. Discret. Math., 2004)

Optimizing ad hoc trade in a commercial barter trade exchange. - Peter Haddawy; Christine T. Cheng; Namthip Rujikeadkumjorn; Khaimook Dhananaiyapergse (Electron. Commer. Res. Appl., 2005)

On Computing the Distinguishing Numbers of Trees and Forests. - Christine T. Cheng (Electron. J. Comb., 2006)

The test suite generation problem: Optimal instances and their implications. - Christine T. Cheng (Discret. Appl. Math., 2007)

Hardness results on the man-exchange stable marriage problem with short preference lists. - Eric McDermid; Christine T. Cheng; Ichiro Suzuki (Inf. Process. Lett., 2007)

The Generalized Median Stable Matchings: Finding Them Is Not That Easy. - Christine T. Cheng (LATIN, 2008)

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach. - Vikraman Arvind; Christine T. Cheng; Nikhil R. Devanur (SIAM J. Discret. Math., 2008)

A unified approach to finding good stable matchings in the hospitals/residents setting. - Christine T. Cheng; Eric McDermid; Ichiro Suzuki (Theor. Comput. Sci., 2008)

Mobile Wireless Systems: Location Prediction Algorithms. - Christine T. Cheng; Ravi Jain; Eric van den Berg (Encyclopedia of Wireless and Mobile Communications, 2008)

On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results. - Christine T. Cheng (Discret. Math., 2009)

Understanding the Generalized Median Stable Matchings. - Christine T. Cheng (Algorithmica, 2010)

Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices. - Christine T. Cheng; Eric McDermid; Ichiro Suzuki (ICALP (1), 2011)

Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs. - Christine T. Cheng; Eric McDermid; Ichiro Suzuki (WG, 2011)

Weak sense of direction labelings and graph embeddings. - Christine T. Cheng; Ichiro Suzuki (Discret. Appl. Math., 2011)

Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings. - Christine T. Cheng; Anhua Lin (SIAM J. Discret. Math., 2011)

A Poset-based Approach to Embedding Median Graphs in Hypercubes and Lattices. - Christine T. Cheng (Order, 2012)

Beyond Knights and Knaves. - Christine T. Cheng; Andrew McConvey; Drew Onderko; Nathaniel Shar; Charles Tomlinson (WG, 2013)

Maximum Locally Stable Matchings. - Christine T. Cheng; Eric McDermid (Algorithms, 2013)

Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings. - Christine T. Cheng; Eric McDermid; Ichiro Suzuki (Discret. Appl. Math., 2016)

Split graphs and Nordhaus-Gaddum graphs. - Christine T. Cheng; Karen L. Collins; Ann N. Trenk (Discret. Math., 2016)

On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One. - Christine T. Cheng (SIAM J. Discret. Math., 2016)

Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth. - Christine T. Cheng; Will Rosenbaum (CoRR, 2020)

The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences. - Christine T. Cheng; Matthew E. H. Petering; Yong Wu 001 (Discret. Appl. Math., 2021)

Stable Matchings with Restricted Preferences: Structure and Complexity. - Christine T. Cheng; Will Rosenbaum (ACM Trans. Economics and Comput., 2022)

Tyshkevich's graph decomposition and the distinguishing numbers of unigraphs. - Christine T. Cheng (Discret. Math., 2025)

Breaking the Symmetries of Amenable Graphs. - Christine T. Cheng (CoRR, 2025)