Lap Chi Lau

Lap Chi Lau is an Adjunct Professor in the Department of Computer Science and Engineering at The Chinese University of Hong Kong. He is also affiliated with the Cheriton School of Computer Science at the University of Waterloo, where his research interests include algorithmic graph theory, approximation algorithms, combinatorial optimization, and spectral graph theory. His profile page indicates cross appointment in the Department of Combinatorics and Optimization. His contact email is lapchi@uwaterloo.ca, and his website is https://cs.uwaterloo.ca/~lapchi/.

Lap Chi Lau is a researcher at the University of Waterloo, focusing on theoretical computer science and combinatorial optimization. His work explores algorithms for network design, spanning trees, and graph theory, with an emphasis on achieving optimal throughput and survivability in networks. He has contributed to the analysis of spectral partitioning algorithms, higher-order random walks, and linear programming relaxations for hypergraph matching. His research also addresses degree constraints in matroids and submodular flows, as well as the application of network coding in multicast scenarios. His publications highlight the intersection of graph theory, optimization, and algorithm design, with a focus on improving computational efficiency and theoretical guarantees.