The following pages link to Christine T. Cheng (Q266916):
Displaying 23 items.
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Weak sense of direction labelings and graph embeddings (Q628312) (← links)
- A poset-based approach to embedding median graphs in hypercubes and lattices (Q766140) (← links)
- On computing the distinguishing numbers of trees and forests (Q813439) (← links)
- Hardness results on the man-exchange stable marriage problem with short preference lists (Q845882) (← links)
- (Q930916) (redirect page) (← links)
- A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- Maximum locally stable matchings (Q1736563) (← links)
- Understanding the generalized median stable matchings (Q1959721) (← links)
- The multi-spreader crane scheduling problem: partitions and supersequences (Q2217473) (← links)
- The test suite generation problem: optimal instances and their implications (Q2381816) (← links)
- On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One (Q2832573) (← links)
- Beyond Knights and Knaves (Q2864319) (← links)
- Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices (Q3012842) (← links)
- Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings (Q3094901) (← links)
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs (Q3104769) (← links)
- On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach (Q3648500) (← links)
- (Q4489139) (← links)
- Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings (Q4652599) (← links)
- The Generalized Median Stable Matchings: Finding Them Is Not That Easy (Q5458560) (← links)
- From discrepancy to declustering (Q5501185) (← links)
