Christine T. Cheng
Orcid: 0000-0003-0524-5368Affiliations:
- University of Wisconsin-Milwaukee, USA
According to our database1,
Christine T. Cheng
authored at least 31 papers
between 1999 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
CoRR, 2023
2022
ACM Trans. Economics and Comput., September, 2022
2021
Discret. Appl. Math., 2021
2020
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
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
2012
Order, 2012
2011
Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings.
SIAM J. Discret. Math., 2011
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
2010
2009
On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results.
Discret. Math., 2009
2008
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
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
2007
Hardness results on the man-exchange stable marriage problem with short preference lists.
Inf. Process. Lett., 2007
Discret. Appl. Math., 2007
2006
Electron. J. Comb., 2006
2005
Electron. Commer. Res. Appl., 2005
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
Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model.
Proceedings of the 6th International Conference on Electronic Commerce, 2004
2003
Proceedings of the 3rd International Conference on Quality Software (QSIC 2003), 2003
Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, 2003
2002
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