# Chi-Kit (George) LAM 林子傑

Software Engineer, Google

## Education

- PhD in Computer Science, the University of Texas at Austin
- MPhil in Computer Science and Engineering, the Hong Kong University of Science and Technology
- BSc in Computer Science and Mathematics, the Hong Kong University of Science and Technology

## Publications

- Chi-Kit Lam and C. Gregory Plaxton. On the existence of three-dimensional stable matchings with cyclic preferences. In Proceedings of the 12th International Symposium on Algorithmic Game Theory, pages 329-342, 2019.
- Chi-Kit Lam and C. Gregory Plaxton. Maximum stable matching with one-sided ties of bounded length. In Proceedings of the 12th International Symposium on Algorithmic Game Theory, pages 343-356, 2019.
- Chi-Kit Lam and C. Gregory Plaxton. A (1+1/e)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2823-2840, 2019.
- Nevzat Onur Domanic, Chi-Kit Lam, and C. Gregory Plaxton. Group strategyproof Pareto-stable marriage with indifferences via the generalized assignment game. In Proceedings of the 10th International Symposium on Algorithmic Game Theory, pages 280-291, 2017.
- Nevzat Onur Domanic, Chi-Kit Lam, and C. Gregory Plaxton. Bipartite matching with linear edge weights. In Proceedings of the 27th International Symposium on Algorithms and Computation, pages 28:1-28:13, 2016.
- Siu-Wing Cheng and Chi-Kit Lam. Shape matching under rigid motion. Computational Geometry: Theory and Applications, 46(6):591-603, 2013.

Last updated: Dec 21, 2019