default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristine T. Cheng
Person information
- affiliation: University of Wisconsin-Milwaukee, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Christine T. Cheng:
Tyshkevich's Graph Decomposition and the Distinguishing Numbers of Unigraphs. CoRR abs/2308.03434 (2023)- 2022
- [j19]Christine T. Cheng
, Will Rosenbaum:
Stable Matchings with Restricted Preferences: Structure and Complexity. ACM Trans. Economics and Comput. 10(3): 13:1-13:45 (2022) - 2021
- [j18]Christine T. Cheng, Matthew E. H. Petering, Yong Wu:
The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences. Discret. Appl. Math. 289: 207-218 (2021) - [c11]Christine T. Cheng, Will Rosenbaum:
Stable Matchings with Restricted Preferences: Structure and Complexity. EC 2021: 319-339 - 2020
- [i3]Christine T. Cheng, Will Rosenbaum:
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth. CoRR abs/2008.08479 (2020) - [i2]Christine T. Cheng, Will Rosenbaum:
Stable Matchings with Restricted Preferences: Structure and Complexity. CoRR abs/2008.08480 (2020)
2010 – 2019
- 2016
- [j17]Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings. Discret. Appl. Math. 205: 27-34 (2016) - [j16]Christine T. Cheng, Karen L. Collins, Ann N. Trenk:
Split graphs and Nordhaus-Gaddum graphs. Discret. Math. 339(9): 2345-2356 (2016) - [j15]Christine T. Cheng:
On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One. SIAM J. Discret. Math. 30(4): 2047-2063 (2016) - 2013
- [j14]Christine T. Cheng, Eric McDermid:
Maximum Locally Stable Matchings. Algorithms 6(3): 383-395 (2013) - [c10]Christine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson:
Beyond Knights and Knaves. WG 2013: 394-405 - 2012
- [j13]Christine T. Cheng:
A Poset-based Approach to Embedding Median Graphs in Hypercubes and Lattices. Order 29(1): 147-163 (2012) - 2011
- [j12]Christine T. Cheng, Ichiro Suzuki:
Weak sense of direction labelings and graph embeddings. Discret. Appl. Math. 159(5): 303-310 (2011) - [j11]Christine T. Cheng, Anhua Lin:
Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings. SIAM J. Discret. Math. 25(1): 72-94 (2011) - [c9]Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices. ICALP (1) 2011: 678-689 - [c8]Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs. WG 2011: 107-118 - 2010
- [j10]Christine T. Cheng:
Understanding the Generalized Median Stable Matchings. Algorithmica 58(1): 34-51 (2010)
2000 – 2009
- 2009
- [j9]Christine T. Cheng:
On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results. Discret. Math. 309(16): 5169-5182 (2009) - 2008
- [j8]Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur:
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach. SIAM J. Discret. Math. 22(4): 1297-1324 (2008) - [j7]Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
A unified approach to finding good stable matchings in the hospitals/residents setting. Theor. Comput. Sci. 400(1-3): 84-99 (2008) - [c7]Christine T. Cheng:
The Generalized Median Stable Matchings: Finding Them Is Not That Easy. LATIN 2008: 568-579 - [r1]Christine T. Cheng, Ravi Jain, Eric van den Berg:
Mobile Wireless Systems: Location Prediction Algorithms. Encyclopedia of Wireless and Mobile Communications 2008 - 2007
- [j6]Christine T. Cheng:
The test suite generation problem: Optimal instances and their implications. Discret. Appl. Math. 155(15): 1943-1957 (2007) - [j5]Eric McDermid, Christine T. Cheng, Ichiro Suzuki:
Hardness results on the man-exchange stable marriage problem with short preference lists. Inf. Process. Lett. 101(1): 13-19 (2007) - [i1]Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur:
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach. CoRR abs/math/0703927 (2007) - 2006
- [j4]Christine T. Cheng:
On Computing the Distinguishing Numbers of Trees and Forests. Electron. J. Comb. 13(1) (2006) - 2005
- [j3]Peter Haddawy, Christine T. Cheng, Namthip Rujikeadkumjorn, Khaimook Dhananaiyapergse:
Optimizing ad hoc trade in a commercial barter trade exchange. Electron. Commer. Res. Appl. 4(4): 299-314 (2005) - 2004
- [j2]Chung-Min Chen, Christine T. Cheng:
From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries. J. ACM 51(1): 46-73 (2004) - [j1]Christine T. Cheng:
Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings. SIAM J. Discret. Math. 17(3): 384-402 (2004) - [c6]Peter Haddawy, Namthip Rujikeadkumjorn, Khaimook Dhananaiyapergse, Christine T. Cheng:
Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model. ICEC 2004: 85-94 - 2003
- [c5]Chung-Min Chen, Christine T. Cheng:
Replication and retrieval strategies of multidimensional data on parallel disks. CIKM 2003: 32-39 - [c4]Christine T. Cheng, Adrian Dumitrescu, Patrick J. Schroeder:
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships. QSIC 2003: 76-82 - 2002
- [c3]Chung-Min Chen, Christine T. Cheng:
From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries. PODS 2002: 29-38 - [c2]Christine T. Cheng, Howard L. Lemberg, Sumesh J. Philip, Eric van den Berg, Tao Zhang:
SLALoM: a scalable location management scheme for large mobile ad-hoc networks. WCNC 2002: 574-578
1990 – 1999
- 1999
- [c1]Christine T. Cheng:
A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on Rings. RANDOM-APPROX 1999: 209-220
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-05 00:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
