Christine T. Cheng - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2022

Stable Matchings with Restricted Preferences: Structure and ComplexityChristine T. Cheng, Will Rosenbaum. teco, 10(3), September 2022. [doi]

2021

Stable Matchings with Restricted Preferences: Structure and ComplexityChristine T. Cheng, Will Rosenbaum. sigecom 2021: 319-339 [doi]

The Multi-Spreader Crane Scheduling Problem: Partitions and supersequencesChristine T. Cheng, Matthew E. H. Petering, Yong Wu 0001. DAM, 289:207-218, 2021. [doi]

2016

Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchingsChristine T. Cheng, Eric McDermid, Ichiro Suzuki. DAM, 205:27-34, 2016. [doi]

On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By OneChristine T. Cheng. siamdm, 30(4):2047-2063, 2016. [doi]

2013

Maximum Locally Stable MatchingsChristine T. Cheng, Eric McDermid. algorithms, 6(3):383-395, 2013. [doi]

Beyond Knights and KnavesChristine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson. wg 2013: 394-405 [doi]

2012

A Poset-based Approach to Embedding Median Graphs in Hypercubes and LatticesChristine T. Cheng. order, 29(1):147-163, 2012. [doi]

2011

2010

Understanding the Generalized Median Stable MatchingsChristine T. Cheng. algorithmica, 58(1):34-51, 2010. [doi]

2009

On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other resultsChristine T. Cheng. DM, 309(16):5169-5182, 2009. [doi]

2008

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting ApproachVikraman Arvind, Christine T. Cheng, Nikhil R. Devanur. siamdm, 22(4):1297-1324, 2008. [doi]

2007

The test suite generation problem: Optimal instances and their implicationsChristine T. Cheng. DAM, 155(15):1943-1957, 2007. [doi]

2006

On Computing the Distinguishing Numbers of Trees and ForestsChristine T. Cheng. combinatorics, 13(1), 2006. [doi]

2004

From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queriesChung-Min Chen, Christine T. Cheng. JACM, 51(1):46-73, 2004. [doi]

Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on RingsChristine T. Cheng. siamdm, 17(3):384-402, 2004. [doi]

2003

Replication and retrieval strategies of multidimensional data on parallel disksChung-Min Chen, Christine T. Cheng. CIKM 2003: 32-39 [doi]

2002

From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queriesChung-Min Chen, Christine T. Cheng. PODS 2002: 29-38 [doi]

SLALoM: a scalable location management scheme for large mobile ad-hoc networksChristine T. Cheng, Howard L. Lemberg, Sumesh J. Philip, Eric van den Berg, Tao Zhang. wcnc 2002: 574-578 [doi]

1999

A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on RingsChristine T. Cheng. random 1999: 209-220

Sign in or sign up to see more results.

runs on WebDSL