Christine T. Cheng

According to our database1, Christine T. Cheng authored at least 26 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences.
Discret. Appl. Math., 2021

2020
Stable Matchings with Restricted Preferences: Structure and Complexity.
CoRR, 2020

Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth.
CoRR, 2020

2016
On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One.
SIAM J. Discret. Math., 2016

Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings.
Discret. Appl. Math., 2016

2013
Maximum Locally Stable Matchings.
Algorithms, 2013

Beyond Knights and Knaves.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012
A Poset-based Approach to Embedding Median Graphs in Hypercubes and Lattices.
Order, 2012

2011
Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings.
SIAM J. Discret. Math., 2011

Weak sense of direction labelings and graph embeddings.
Discret. Appl. Math., 2011

Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Understanding the Generalized Median Stable Matchings.
Algorithmica, 2010

2009
On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results.
Discret. Math., 2009

2008
Mobile Wireless Systems: Location Prediction Algorithms.
Encyclopedia of Wireless and Mobile Communications, 2008

A unified approach to finding good stable matchings in the hospitals/residents setting.
Theor. Comput. Sci., 2008

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach.
SIAM J. Discret. Math., 2008

2007
Hardness results on the man-exchange stable marriage problem with short preference lists.
Inf. Process. Lett., 2007

The test suite generation problem: Optimal instances and their implications.
Discret. Appl. Math., 2007

2006
On Computing the Distinguishing Numbers of Trees and Forests.
Electron. J. Comb., 2006

2004
Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings.
SIAM J. Discret. Math., 2004

From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries.
J. ACM, 2004

2003
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships.
Proceedings of the 3rd International Conference on Quality Software (QSIC 2003), 2003

Replication and retrieval strategies of multidimensional data on parallel disks.
Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, 2003

2002
SLALoM: a scalable location management scheme for large mobile ad-hoc networks.
Proceedings of the 2002 IEEE Wireless Communications and Networking Conference Record, 2002

1999
A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on Rings.
Proceedings of the Randomization, 1999


  Loading...