Approximating minimum bounded degree spanning trees to within one of optimal M Singh, LC Lau Journal of the ACM (JACM) 62 (1), 1-19, 2015 | 249 | 2015 |

Iterative methods in combinatorial optimization LC Lau, R Ravi, M Singh Cambridge University Press, 2011 | 244 | 2011 |

On achieving optimal throughput with network coding Z Li, B Li, D Jiang, LC Lau Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and …, 2005 | 212 | 2005 |

Survivable network design with degree or order constraints LC Lau, J Naor, MR Salavatipour, M Singh Proceedings of the thirty-ninth annual ACM symposium on theory of computing …, 2007 | 157 | 2007 |

On achieving maximum multicast throughput in undirected networks Z Li, B Li, LC Lau IEEE Transactions on Information Theory 52 (6), 2467-2485, 2006 | 152 | 2006 |

On linear and semidefinite programming relaxations for hypergraph matching YH Chan, LC Lau Mathematical programming 135 (1), 123-148, 2012 | 111 | 2012 |

Fast matrix rank algorithms and applications HY Cheung, TC Kwok, LC Lau Journal of the ACM (JACM) 60 (5), 1-25, 2013 | 108 | 2013 |

Improved Cheeger's inequality: Analysis of spectral partitioning algorithms through higher order spectral gap TC Kwok, LC Lau, YT Lee, S Oveis Gharan, L Trevisan Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 104* | 2013 |

An approximate max-Steiner-tree-packing min-Steiner-cut theorem LC Lau 45th Annual IEEE Symposium on Foundations of Computer Science, 61-70, 2004 | 93 | 2004 |

Improved analysis of higher order random walks and applications VL Alev, LC Lau Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 92 | 2020 |

A constant bound on throughput improvement of multicast network coding in undirected networks Z Li, B Li, LC Lau IEEE Transactions on Information Theory 55 (3), 1016-1026, 2009 | 84 | 2009 |

Additive approximation for bounded degree survivable network design LC Lau, M Singh SIAM Journal on Computing 42 (6), 2217-2242, 2013 | 78* | 2013 |

Degree bounded matroids and submodular flows T Király, LC Lau, M Singh International Conference on Integer Programming and Combinatorial …, 2008 | 56* | 2008 |

Bipartite roots of graphs LC Lau ACM Transactions on Algorithms (TALG) 2 (2), 178-208, 2006 | 54 | 2006 |

Recognizing powers of proper interval, split, and chordal graphs LC Lau, DG Corneil SIAM Journal on Discrete Mathematics 18 (1), 83-102, 2004 | 53 | 2004 |

Graph clustering using effective resistance VL Alev, N Anari, LC Lau, SO Gharan arXiv preprint arXiv:1711.06530, 2017 | 44 | 2017 |

Graph connectivities, network coding, and expander graphs HY Cheung, LC Lau, KM Leung 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 190-199, 2011 | 44 | 2011 |

Algebraic algorithms for linear matroid parity problems HY Cheung, LC Lau, KM Leung ACM Transactions on Algorithms (TALG) 10 (3), 1-26, 2014 | 40 | 2014 |

The minimum k-colored subgraph problem in haplotyping and DNA primer selection MT Hajiaghayi, K Jain, K Konwar, LC Lau, II Mandoiu, A Russell, ... Proceedings of the International Workshop on Bioinformatics Research and …, 2006 | 37 | 2006 |

Degree bounded network design with metric costs YH Chan, WS Fung, LC Lau, CK Yung SIAM Journal on Computing 40 (4), 953-980, 2011 | 33 | 2011 |