Random walks and evolving sets: faster convergences and limitations
[pdf]
Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau
(Conference version in Proceedings of the 27th ACMSIAM Symposium on Discrete Algorithms (SODA), 18491865, 2017.
[pdf])

Improved Cheeger's inequality and analysis of local graph partitioning using vertex expansion and expansion profile
[pdf]
Tsz Chiu Kwok, Lap Chi Lau,
Yin Tat Lee
(Conference version in Proceedings of the 27th ACMSIAM Symposium on Discrete Algorithms (SODA), 18481861, 2016.
[pdf])

Lower bounds on expansions of graph powers
[pdf]
Tsz Chiu Kwok, Lap Chi Lau
Proceedings of the 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 313324, 2014 
A unified algorithm for degree bounded survivable network design
[pdf]
Lap Chi Lau, Hong Zhou
Mathematical Programming, 154(12), 515532, 2015.
(Conference version in
Proceedings of the 17th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 369380, 2014
[pdf])

Improved Cheeger's inequality: analysis of spectral partitioning algorithms through higher order spectral gap
[ps]
[pdf]
Tsz Chiu Kwok, Lap Chi Lau,
Yin Tat Lee,
Shayan Oveis Gharan,
Luca Trevisan
(Conference version in
Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC),
1120, 2013
[pdf])

Finding small sparse cuts by random walk
[ps]
[pdf]
Tsz Chiu Kwok, Lap Chi Lau
Proceedings of the 16th International Workshop on Randomization and Computation (RANDOM), 615626, 2012 
Fast matrix rank algorithms and applications
[pdf]
Ho Yee Cheung,
Tsz Chiu Kwok, Lap Chi Lau
Journal of the ACM, 60(5), #31, 2013
(Conference version in Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), 549562, 2012
[ps]
[pdf])

Graph connectivities, network coding, and
expander graphs
[pdf]
Ho Yee Cheung,
Lap Chi Lau, Kai Man Leung
SIAM Journal on Computing, 42(3), 733751, 2013
(Conference
version in Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 190199, 2011
[ps]
[pdf])

On disjoint common bases in two matroids
[ps]
[pdf]
Nick Harvey,
Tamás Király, Lap Chi Lau
SIAM Journal on Discrete Mathematics, 25(4), 17921803, 2011 
Degree bounded forest covering
[ps]
[pdf]
Tamás Király, Lap Chi Lau
Proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 315323, 2011 
Algebraic algorithms for linear matroid parity problems
[pdf]
Ho Yee Cheung,
Lap Chi Lau, Kai Man Leung
ACM Transactions on Algorithms, 10(3), #10, 2014
(Conference version in Proceedings of the 22nd ACMSIAM Symposium on Discrete Algorithms (SODA), 13661382, 2011
[ps]
[pdf])

Efficient edge splittingoff algorithms maintaining allpairs edgeconnectivities
[pdf]
Lap Chi Lau, Chun Kong Yung
SIAM Journal on Computing, 42(3), 11851200, 2013
(Conference version in Proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 96109, 2010
[ps]
[pdf])

On linear and semidefinite programming relaxations for hypergraph matching
[pdf]
Yuk Hei Chan, Lap Chi Lau
Mathematical Programming 135(12), 123148, 2012
(Conference version in
Proceedings of the 21st Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 15001511, 2010
[ps]
[pdf])

Degree bounded network design with metric costs
[pdf]
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung
SIAM Journal on Computing,
40(4), 953980, 2011
(Conference version in
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 125134, 2008
[ps]
[pdf])

Additive approximation for bounded degree survivable network design
[pdf]
Lap Chi Lau,
Mohit Singh
SIAM Journal on Computing,
42(6), 22172242, 2013
(Conference version in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), 759768, 2008
[ps]
[pdf])

Degree bounded matroids and submodular flows
[pdf]
Tamás Király, Lap Chi
Lau,
Mohit Singh
Combinatorica,
32(6), 703720, 2012
(Conference version in Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 259272, 2008
[ps]
[pdf])

Approximating minimum bounded degree spanning tress to within one of optimal
[pdf]
Mohit Singh, Lap Chi Lau
Journal of the ACM, 62(1), #1, 2015.
(Conference version in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 661670, 2007
[ps]
[pdf])

Survivable network design with degree or order constraints
[pdf]
Lap Chi Lau,
Joseph Naor,
Mohammad Salavatipour,
Mohit Singh
SIAM Journal on Computing,
39(3), 10621087, 2009
(Conference version in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 651660, 2007
[ps]
[pdf])

Approximate minmax theorems for Steiner rootedorientations of graphs and hypergraphs
[pdf]
Tamás Király, Lap Chi
Lau
Journal of Combinatorial Theory, Series B,
98(6), 12331252, 2008
(Conference version appeared in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 283292, 2006
[ps]
[pdf])

Packing Steiner forests
[ps]
[pdf]
Lap Chi Lau
Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 362376, 2005 
An approximate maxSteinertreepacking minSteinercut theorem
[pdf]
Lap Chi Lau
Combinatorica, 27(1), 7190, 2007
(Conference version appeared in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 6170, 2004
[ps]
[pdf])
Machtey Award for best student paper 