LAU, Lap Chi

Selected Publications:

  • T. Kiraly and L.C. Lau. Approximate min-max theorems on Steiner rootedorientations of graphs and hypergraphs. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006. To appear.
  • L.C. Lau. Packing Steiner forests. In Proceedings of the 11th International Integer Programming and Combinatorial Optimization Conference (IPCO), pages 362-276, 2005.
  • L.C. Lau. An approximate max-Steiner-tree-packing min-Steiner-cut theorem. Combinatorica. To appear. (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. To appear. (A preliminary version appeared in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 952-961, 2004.)
  • L.C. Lau and D. Corneil. Recognizing Powers of Proper Interval, Split, and Chordal Graph. SIAM Journal on Discrete Mathematics, 18(1):83-102, 2004.

CUHK   |   Engineering Faculty   |   CSE Webmail   |   Search   |   Sitemap   |   Privacy Statement   |   Contact Us
Copyright © 2008 Department of Computer Science and Engineering, The Chinese University of Hong Kong. All rights reserved.
Email: dept@cse.cuhk.edu.hk       Tel: (852) 26098440       Fax: (852) 26035024