Christine Calynn Tan Cheng
Institute for Mathematics and its Applications
University of Minnesota
400 Lind Hall
207 Church St. S.E.
Minneapolis, MN 55455
612.626.1366
ccheng@ima.umn.edu

I'm currently an Industrial Postdoc at the Institute for Mathematics and its Applications. As part of my fellowship, I am also collaborating with researchers at Telcordia Technologies (formerly Bellcore) on projects related to wireless networks, routing algorithms and databases.

Here's a copy of my c.v. [ pdf ] [ ps ]

Education

• Ph.D. in Mathematical Sciences. Thesis Title: Three Problems in Graph Labeling . Thesis Advisor: Prof. Lenore Cowen.
• M.S.E, Mathematical Sciences, The Johns Hopkins University.
• B.S., Mathematics, University of the Philippines.

Research Interests

My general interests lie at the intersection of discrete mathematics and computer science. Specifically, I am interested in combinatorics, graph theory and in the design of efficient algorithms to solve problems that arise in communication networks, databases and graph visualization.

Research Statement [ pdf ] [ ps ]

Papers

• C.T. Cheng and L. J. Cowen, On Local Distinguishing Numbers of Cycles, Discrete Mathematics, 196:1-3(1999) pp.97-108 . [ ps] [ pdf]
• C.T. Cheng, Local Distinguishing Numbers of Trees, Congressus Numerantium, 133(1998) pp.21-30. . [ ps ] [ pdf ]
• C.T. Cheng, A New Approximation Algorithm on the Demand Routing and Slotting Problem with Unit Demands on Rings, Lectures in Computer Science 1671: Randomization, Approximation and Combinatorial Optimization, (1999) pp.290-220. [ ps] [ pdf]
• C.T. Cheng, C.A. Duncan, M.T. Goodrich, K. Kobourov, "Drawing Planar Graphs with Circular Arcs, Discrete and Computational Geometry, 25(2001) pp.405-418. [ ps ] [ pdf ]
• C. Cheng, H. Lemberg, S. Philip, E. van den Berg, T. Zhang, SLALoM: A Scalable Location Management Scheme for Large Mobile Ad-hoc Networks, to appear in Proceedings of Wireless Communications and Networking Conference, March, 2002. [ ps] [ pdf]
• C.-M Chen and C. Cheng, From Discrepancy to Declustering: Near-optimal Multidimensional Declustering Strategies for Range Queries, to appear in Proceedings of Principles of Database Systems, June, 2002. Awarded "PODS 2002 Best Newcomer Paper". [ ps] [ pdf]