Christine Cheng

View Dr. Cheng's website.

Dr. Cheng’s general interests lie at the intersection of computer science and discrete mathematics, especially in algorithm design, combinatorial optimization, combinatorics, and graph theory. The main research focus is “stable matchings,” a solution concept used to match medical residents to hospital programs, students to schools, or kidneys to kidney patients.

Education

• PhD, Johns Hopkins University, 1999
• MS, Johns Hopkins University, 1996
• BS, University of the Philippines, 1994

Research Interests

• Algorithm Design
• Graph Algorithms
• Combinatorial Optimization
• Graph Theory
• Combinatorics

Publications

Dr. Cheng's publication list.

• C. Cheng and W. Rosenbaum. Bridging the gap between stable marriage and stable roommates: a parametrized algorithm for optimal stable matchings, presented at MATCH-UP 2026.
• C. Cheng, Breaking the symmetries of amenable graphs, Ars Combinatoria 166 (2026), pp 85–108.
• C. Cheng. Tyshkevich’s graph decomposition and the distinguishing numbers of unigraphs, Discrete Mathematics 348 (2025), Article 114492.
• C. Cheng and W. Rosenbaum. Stable matchings with restricted preferences: structure and complexity, ACM Transactions on Economics and Computation 10 (2022), Article 13, pp. 1 – 45.
• C. Cheng, M Petering, Y. Wu, The multi-spreader crane scheduling problem, Discrete Applied Mathematics 281 (2021) pp. 207-218.

Awards

• Recipient of the 2026 UWM Faculty Distinguished Public Service Award
• Recipient of the Best Paper Award at MATCH-UP 2026
• Recipient of the 2017 CEAS Teaching Award

Community Involvement

• Administrator for Girls Who Code @ UWM
• NCWIT Aspirations Award