LAU, Lap Chi

Selected Publications:

• L.C. Lau, M. Singh. Additive approximation for bounded degree survivable network design. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pages 759-768, 2008.
• M. Singh and L.C. Lau. Approximating minimum bounded degree spanning trees to within one of optimal. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 661-670, 2007.
• T. Kiraly and L.C. Lau. Approximate min-max theorems on Steiner rooted orientations of graphs and hypergraphs. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 283-292, 2006.
• L.C. Lau. An approximate max-Steiner-tree-packing min-Steiner-cut theorem. Combinatorica, 27:71-90, 2007. (A preliminary version appeared in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 61-70, 2004.)
• L.C. Lau. Bipartite roots of graphs. ACM Transactions on Algorithms, 2:178-208, 2006. (A preliminary version appeared in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 952-961, 2004.)