Christine T. Cheng

	2012
19		Christine T. Cheng: A Poset-based Approach to Embedding Median Graphs in Hypercubes and Lattices. Order 29(1): 147-163 (2012)
	2011
18		Christine T. Cheng, Eric McDermid, Ichiro Suzuki: Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices. ICALP (1) 2011: 678-689
17		Christine T. Cheng, Eric McDermid, Ichiro Suzuki: Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs. WG 2011: 107-118
16		Christine T. Cheng, Ichiro Suzuki: Weak sense of direction labelings and graph embeddings. Discrete Applied Mathematics 159(5): 303-310 (2011)
15		Christine T. Cheng, Anhua Lin: Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings. SIAM J. Discrete Math. 25(1): 72-94 (2011)
	2010
14		Christine T. Cheng: Understanding the Generalized Median Stable Matchings. Algorithmica 58(1): 34-51 (2010)
	2009
13		Christine T. Cheng: On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results. Discrete Mathematics 309(16): 5169-5182 (2009)
	2008
12		Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur: On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach. SIAM J. Discrete Math. 22(4): 1297-1324 (2008)
11		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)
	2007
10		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)
9		Christine T. Cheng: The test suite generation problem: Optimal instances and their implications. Discrete Applied Mathematics 155(15): 1943-1957 (2007)
8		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)
	2006
7		Christine T. Cheng: On Computing the Distinguishing Numbers of Trees and Forests. Electr. J. Comb. 13(1): (2006)
	2004
6		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)
5		Christine T. Cheng: Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings. SIAM J. Discrete Math. 17(3): 384-402 (2004)
	2003
4		Chung-Min Chen, Christine T. Cheng: Replication and retrieval strategies of multidimensional data on parallel disks. CIKM 2003: 32-39
3		Christine T. Cheng, Adrian Dumitrescu, Patrick J. Schroeder: Generating Small Combinatorial Test Suites to Cover Input-Output Relationships. QSIC 2003: 76-82
	2002
2		Chung-Min Chen, Christine T. Cheng: From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries. PODS 2002: 29-38
	1999
1		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

1	Vikraman Arvind	[10] [12]
2	Chung-Min Chen	[2] [4] [6]
3	Nikhil R. Devanur	[10] [12]
4	Adrian Dumitrescu	[3]
5	Anhua Lin	[15]
6	Eric McDermid	[8] [11] [17] [18]
7	Patrick J. Schroeder	[3]
8	Ichiro Suzuki	[8] [11] [16] [17] [18]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page