Christine T. Cheng

39 papers A* 2A 1B 4C 1Journal 27Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Algorithmic Applications of Tyshkevich's Graph Decomposition: A Primer and a Toolkit.
CoRR
Christine T. Cheng, Chelsea Ann Lambert
2026 J jnl
Bridging the Gap Between Stable Marriage and Stable Roommates: A Parametrized Algorithm for Optimal Stable Matchings.
CoRR
Christine T. Cheng, Will Rosenbaum
2025 J jnl
Breaking the Symmetries of Amenable Graphs.
CoRR
Christine T. Cheng
2025 J jnl
Tyshkevich's graph decomposition and the distinguishing numbers of unigraphs.
Discret. Math.
Christine T. Cheng
2023 J jnl
Tyshkevich's Graph Decomposition and the Distinguishing Numbers of Unigraphs.
CoRR
Christine T. Cheng
2022 J jnl
Stable Matchings with Restricted Preferences: Structure and Complexity.
ACM Trans. Economics and Comput.
Christine T. Cheng, Will Rosenbaum
2021 A* conf
Stable Matchings with Restricted Preferences: Structure and Complexity.
EC
Christine T. Cheng, Will Rosenbaum
2021 J jnl
The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences.
Discret. Appl. Math.
Christine T. Cheng, Matthew E. H. Petering, Yong Wu
2020 J jnl
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth.
CoRR
Christine T. Cheng, Will Rosenbaum
2020 J jnl
Stable Matchings with Restricted Preferences: Structure and Complexity.
CoRR
Christine T. Cheng, Will Rosenbaum
2016 J jnl
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings.
Discret. Appl. Math.
Christine T. Cheng, Eric McDermid, Ichiro Suzuki
2016 J jnl
On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One.
SIAM J. Discret. Math.
Christine T. Cheng
2016 J jnl
Split graphs and Nordhaus-Gaddum graphs.
Discret. Math.
Christine T. Cheng, Karen L. Collins, Ann N. Trenk
2013 B conf
Beyond Knights and Knaves.
WG
Christine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson
2013 J jnl
Maximum Locally Stable Matchings.
Algorithms
Christine T. Cheng, Eric McDermid
2012 J jnl
A Poset-based Approach to Embedding Median Graphs in Hypercubes and Lattices.
Order
Christine T. Cheng
2011 — conf
Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices.
ICALP (1)
Christine T. Cheng, Eric McDermid, Ichiro Suzuki
2011 B conf
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs.
WG
Christine T. Cheng, Eric McDermid, Ichiro Suzuki
2011 J jnl
Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings.
SIAM J. Discret. Math.
Christine T. Cheng, Anhua Lin
2011 J jnl
Weak sense of direction labelings and graph embeddings.
Discret. Appl. Math.
Christine T. Cheng, Ichiro Suzuki
2010 J jnl
Understanding the Generalized Median Stable Matchings.
Algorithmica
Christine T. Cheng
2009 J jnl
On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results.
Discret. Math.
Christine T. Cheng
2008 J jnl
A unified approach to finding good stable matchings in the hospitals/residents setting.
Theor. Comput. Sci.
Christine T. Cheng, Eric McDermid, Ichiro Suzuki
2008 — ch.
Mobile Wireless Systems: Location Prediction Algorithms.
Encyclopedia of Wireless and Mobile Communications
Christine T. Cheng, Ravi Jain, Eric van den Berg
2008 J jnl
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach.
SIAM J. Discret. Math.
Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur
2008 B conf
The Generalized Median Stable Matchings: Finding Them Is Not That Easy.
LATIN
Christine T. Cheng
2007 J jnl
Hardness results on the man-exchange stable marriage problem with short preference lists.
Inf. Process. Lett.
Eric McDermid, Christine T. Cheng, Ichiro Suzuki
2007 J jnl
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
CoRR
Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur
2007 J jnl
The test suite generation problem: Optimal instances and their implications.
Discret. Appl. Math.
Christine T. Cheng
2006 J jnl
On Computing the Distinguishing Numbers of Trees and Forests.
Electron. J. Comb.
Christine T. Cheng
2005 J jnl
Optimizing ad hoc trade in a commercial barter trade exchange.
Electron. Commer. Res. Appl.
Peter Haddawy, Christine T. Cheng, Namthip Rujikeadkumjorn, Khaimook Dhananaiyapergse
2004 C conf
Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model.
ICEC
Peter Haddawy, Namthip Rujikeadkumjorn, Khaimook Dhananaiyapergse, Christine T. Cheng
2004 J jnl
From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries.
J. ACM
Chung-Min Chen, Christine T. Cheng
2004 J jnl
Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings.
SIAM J. Discret. Math.
Christine T. Cheng
2003 — conf
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships.
QSIC
Christine T. Cheng, Adrian Dumitrescu, Patrick J. Schroeder
2003 A conf
Replication and retrieval strategies of multidimensional data on parallel disks.
CIKM
Chung-Min Chen, Christine T. Cheng
2002 A* conf
From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries.
PODS
Chung-Min Chen, Christine T. Cheng
2002 B conf
SLALoM: a scalable location management scheme for large mobile ad-hoc networks.
WCNC
Christine T. Cheng, Howard L. Lemberg, Sumesh J. Philip, Eric van den Berg, Tao Zhang
1999 — conf
A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on Rings.
RANDOM-APPROX
Christine T. Cheng