Recognizing Powers of Proper Interval, Split, and Chordal Graph. - Lap Chi Lau; Derek G. Corneil (SIAM J. Discret. Math., 2004)

On achieving optimal throughput with network coding. - Zongpeng Li; Baochun Li; Dan Jiang; Lap Chi Lau (INFOCOM, 2005)

Packing Steiner Forests. - Lap Chi Lau (IPCO, 2005)

Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. - Tamás Király; Lap Chi Lau (FOCS, 2006)

Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping. - Mohammad Taghi Hajiaghayi; Kamal Jain; Lap Chi Lau; Ion I. Mandoiu; Alexander Russell; Vijay V. Vazirani (International Conference on Computational Science (2), 2006)

Randomly Colouring Graphs with Girth Five and Large Maximum Degree. - Lap Chi Lau; Michael Molloy 001 (LATIN, 2006)

Bipartite roots of graphs. - Lap Chi Lau (ACM Trans. Algorithms, 2006)

On achieving maximum multicast throughput in undirected networks. - Zongpeng Li; Baochun Li; Lap Chi Lau (IEEE Trans. Inf. Theory, 2006)

On approximate min-max theorems for graph connectivity problems. - Lap Chi Lau (2006)

An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. - Lap Chi Lau (Comb., 2007)

A note on degree-constrained subgraphs. - András Frank; Lap Chi Lau; Jácint Szabó (Discret. Math., 2008)

Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs. - Tamás Király; Lap Chi Lau (J. Comb. Theory B, 2008)

Computing Graph Roots Without Short Cycles. - Babak Farzad; Lap Chi Lau; Van Bang Le; Nguyen Ngoc Tuy (STACS, 2009)

Survivable Network Design with Degree or Order Constraints. - Lap Chi Lau; Joseph Naor; Mohammad R. Salavatipour; Mohit Singh (SIAM J. Comput., 2009)

A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks. - Zongpeng Li; Baochun Li; Lap Chi Lau (IEEE Trans. Inf. Theory, 2009)

Degree Bounded Forest Covering. - Tamás Király; Lap Chi Lau (IPCO, 2011)

Degree Bounded Network Design with Metric Costs. - Yuk Hei Chan; Wai Shing Fung; Lap Chi Lau; Chun Kong Yung (SIAM J. Comput., 2011)

On Disjoint Common Bases in Two Matroids. - Nicholas J. A. Harvey; Tamás Király; Lap Chi Lau (SIAM J. Discret. Math., 2011)

Finding Small Sparse Cuts by Random Walk. - Tsz Chiu Kwok; Lap Chi Lau (APPROX-RANDOM, 2012)

Complexity of Finding Graph Roots with Girth Conditions. - Babak Farzad; Lap Chi Lau; Van Bang Le; Nguyen Ngoc Tuy (Algorithmica, 2012)

Degree bounded matroids and submodular flows. - Tamás Király; Lap Chi Lau; Mohit Singh (Comb., 2012)

Finding Small Sparse Cuts Locally by Random Walk - Tsz Chiu Kwok; Lap Chi Lau (CoRR, 2012)

On linear and semidefinite programming relaxations for hypergraph matching. - Yuk Hei Chan; Lap Chi Lau (Math. Program., 2012)

Improved Cheeger's inequality: analysis of spectral partitioning algorithms through higher order spectral gap. - Tsz Chiu Kwok; Lap Chi Lau; Yin Tat Lee; Shayan Oveis Gharan; Luca Trevisan 001 (STOC, 2013)

Fast matrix rank algorithms and applications. - Ho Yee Cheung; Tsz Chiu Kwok; Lap Chi Lau (J. ACM, 2013)

Graph Connectivities, Network Coding, and Expander Graphs. - Ho Yee Cheung; Lap Chi Lau; Kai Man Leung (SIAM J. Comput., 2013)

Additive Approximation for Bounded Degree Survivable Network Design. - Lap Chi Lau; Mohit Singh (SIAM J. Comput., 2013)

Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. - Lap Chi Lau; Chun Kong Yung (SIAM J. Comput., 2013)

Lower Bounds on Expansions of Graph Powers. - Tsz Chiu Kwok; Lap Chi Lau (APPROX-RANDOM, 2014)

Special Section on the Fifty-First Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010). - Lap Chi Lau; Tal Malkin; Ryan O'Donnell; Luca Trevisan 001 (SIAM J. Comput., 2014)

Algebraic Algorithms for Linear Matroid Parity Problems. - Ho Yee Cheung; Lap Chi Lau; Kai Man Leung (ACM Trans. Algorithms, 2014)

Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal. - Mohit Singh; Lap Chi Lau (J. ACM, 2015)

A unified algorithm for degree bounded survivable network design. - Lap Chi Lau; Hong Zhou 001 (Math. Program., 2015)

Approximating Unique Games Using Low Diameter Graph Decomposition. - Vedat Levi Alev; Lap Chi Lau (APPROX-RANDOM, 2017)

Random Walks and Evolving Sets: Faster Convergences and Limitations. - Siu On Chan; Tsz Chiu Kwok; Lap Chi Lau (SODA, 2017)

Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile. - Tsz Chiu Kwok; Lap Chi Lau; Yin Tat Lee (SIAM J. Comput., 2017)

Graph Clustering using Effective Resistance. - Vedat Levi Alev; Nima Anari; Lap Chi Lau; Shayan Oveis Gharan (ITCS, 2018)

The Paulsen problem, continuous operator scaling, and smoothed analysis. - Tsz Chiu Kwok; Lap Chi Lau; Yin Tat Lee; Akshay Ramachandran (STOC, 2018)

Network design for s-t effective resistance. - Pak Hay Chan; Lap Chi Lau; Aaron Schild; Sam Chiu-wai Wong; Hong Zhou 001 (CoRR, 2019)

Improved analysis of higher order random walks and applications. - Vedat Levi Alev; Lap Chi Lau (STOC, 2020)

Spectral Analysis of Matrix Scaling and Operator Scaling. - Tsz Chiu Kwok; Lap Chi Lau; Akshay Ramachandran (SIAM J. Comput., 2021)

Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues. - Tsz Chiu Kwok; Lap Chi Lau; Kam Chuen Tung (FOCS, 2022)

A Local Search Framework for Experimental Design. - Lap Chi Lau; Hong Zhou 001 (SIAM J. Comput., 2022)

A Spectral Approach to Network Design. - Lap Chi Lau; Hong Zhou 001 (SIAM J. Comput., 2022)

Network Design for s-t Effective Resistance. - Pak Hay Chan; Lap Chi Lau; Aaron Schild; Sam Chiu-wai Wong; Hong Zhou 001 (ACM Trans. Algorithms, 2022)

Experimental Design for Any p-Norm. - Lap Chi Lau; Robert Wang 004; Hong Zhou 001 (APPROX/RANDOM, 2023)

Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted Eigenvalues. - Lap Chi Lau; Kam Chuen Tung; Robert Wang 004 (STOC, 2023)

On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs. - Lap Chi Lau; Dante Tjowasi (APPROX/RANDOM, 2024)

Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues. - Lap Chi Lau; Kam Chuen Tung; Robert Wang 004 (SODA, 2024)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors. - Sepehr Assadi; Aaron Bernstein; Zachary Langley; Lap Chi Lau; Robert Wang 004 (SODA, 2025)

Spectral Sparsification by Deterministic Discrepancy Walk. - Lap Chi Lau; Robert Wang 004; Hong Zhou 001 (SOSA, 2025)

Experimental Design Using Interlacing Polynomials. - Lap Chi Lau; Robert Wang 004; Hong Zhou 001 (SOSA, 2025)