Lap Chi Lau

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 35

Top Topics

Graph Partitioning

Laplace Beltrami

Experimental Designs

Spectral Analysis

Top Venues

SIAM J. Comput.

Publications

Lap Chi Lau, Dante Tjowasi
On the Houdré-Tetali conjecture about an isoperimetric constant of graphs. CoRR (2024)
Lap Chi Lau, Kam Chuen Tung, Robert Wang
Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues. SODA (2024)
Lap Chi Lau, Kam Chuen Tung, Robert Wang
Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues. CoRR (2023)
Lap Chi Lau, Kam Chuen Tung, Robert Wang
Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted Eigenvalues. STOC (2023)
Lap Chi Lau, Robert Wang, Hong Zhou
Experimental Design for Any p-Norm. CoRR (2023)
Lap Chi Lau, Robert Wang, Hong Zhou
Experimental Design for Any p-Norm. APPROX/RANDOM (2023)
Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues. FOCS (2022)
Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues. CoRR (2022)
Lap Chi Lau, Hong Zhou
A Spectral Approach to Network Design. SIAM J. Comput. 51 (4) (2022)
Lap Chi Lau, Hong Zhou
A Local Search Framework for Experimental Design. SIAM J. Comput. 51 (4) (2022)
Lap Chi Lau, Kam Chuen Tung, Robert Wang
Cheeger Inequalities for Directed Graphs and Hypergraphs Using Reweighted Eigenvalues. CoRR (2022)
Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, Hong Zhou
Effective Resistance. ACM Trans. Algorithms 18 (3) (2022)
Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran
Spectral Analysis of Matrix Scaling and Operator Scaling. SIAM J. Comput. 50 (3) (2021)
Lap Chi Lau, Hong Zhou
A Local Search Framework for Experimental Design. SODA (2021)
Vedat Levi Alev, Lap Chi Lau
Improved analysis of higher order random walks and applications. STOC (2020)
Lap Chi Lau, Hong Zhou
A spectral approach to network design. STOC (2020)
Lap Chi Lau, Hong Zhou
A Spectral Approach to Network Design. CoRR (2020)
Vedat Levi Alev, Lap Chi Lau
Improved Analysis of Higher Order Random Walks and Applications. CoRR (2020)
Lap Chi Lau, Hong Zhou
A Local Search Framework for Experimental Design. CoRR (2020)
Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran
Spectral Analysis of Matrix Scaling and Operator Scaling. FOCS (2019)
Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran
Spectral analysis of matrix scaling and operator scaling. CoRR (2019)
Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, Hong Zhou
Network design for s-t effective resistance. CoRR (2019)
Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Akshay Ramachandran
The Paulsen problem, continuous operator scaling, and smoothed analysis. STOC (2018)
Vedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan
Graph Clustering using Effective Resistance. ITCS (2018)
Vedat Levi Alev, Lap Chi Lau
Approximating Unique Games Using Low Diameter Graph Decomposition. APPROX-RANDOM (2017)
Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau
Random Walks and Evolving Sets: Faster Convergences and Limitations. SODA (2017)
Vedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan
Graph Clustering using Effective Resistance. CoRR (2017)
Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee
Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile. SIAM J. Comput. 46 (3) (2017)
Vedat Levi Alev, Lap Chi Lau
Approximating Unique Games Using Low Diameter Graph Decomposition. CoRR (2017)
Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Akshay Ramachandran
The Paulsen Problem, Continuous Operator Scaling, and Smoothed Analysis. CoRR (2017)
Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee
Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile. SODA (2016)
Mohit Singh, Lap Chi Lau
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal. J. ACM 62 (1) (2015)
Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee
Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile. CoRR (2015)
Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau
Random Walks and Evolving Sets: Faster Convergences and Limitations. CoRR (2015)
Lap Chi Lau, Hong Zhou
A unified algorithm for degree bounded survivable network design. Math. Program. 154 (1-2) (2015)
Lap Chi Lau, Hong Zhou
A Unified Algorithm for Degree Bounded Survivable Network Design. IPCO (2014)
Tsz Chiu Kwok, Lap Chi Lau
Lower Bounds on Expansions of Graph Powers. APPROX-RANDOM (2014)
Lap Chi Lau, Tal Malkin, Ryan O'Donnell, Luca Trevisan
Special Section on the Fifty-First Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010). SIAM J. Comput. 43 (1) (2014)
Ho Yee Cheung, Lap Chi Lau, Kai Man Leung
Algebraic Algorithms for Linear Matroid Parity Problems. ACM Trans. Algorithms 10 (3) (2014)
Lap Chi Lau, Chun Kong Yung
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. SIAM J. Comput. 42 (3) (2013)
Lap Chi Lau, Mohit Singh
Additive Approximation for Bounded Degree Survivable Network Design. SIAM J. Comput. 42 (6) (2013)
Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau
Fast matrix rank algorithms and applications. J. ACM 60 (5) (2013)
Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Shayan Oveis Gharan, Luca Trevisan
Improved Cheeger's inequality: analysis of spectral partitioning algorithms through higher order spectral gap. STOC (2013)
Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Shayan Oveis Gharan, Luca Trevisan
Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral Gap CoRR (2013)
Ho Yee Cheung, Lap Chi Lau, Kai Man Leung
Graph Connectivities, Network Coding, and Expander Graphs. SIAM J. Comput. 42 (3) (2013)
Tsz Chiu Kwok, Lap Chi Lau
Finding Small Sparse Cuts Locally by Random Walk CoRR (2012)
Tamás Király, Lap Chi Lau, Mohit Singh
Degree bounded matroids and submodular flows. Comb. 32 (6) (2012)
Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy
Complexity of Finding Graph Roots with Girth Conditions. Algorithmica 62 (1-2) (2012)
Yuk Hei Chan, Lap Chi Lau
On linear and semidefinite programming relaxations for hypergraph matching. Math. Program. 135 (1-2) (2012)
Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau
Fast Matrix Rank Algorithms and Applications CoRR (2012)
Tsz Chiu Kwok, Lap Chi Lau
Finding Small Sparse Cuts by Random Walk. APPROX-RANDOM (2012)
Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau
Fast matrix rank algorithms and applications. STOC (2012)
Ho Yee Cheung, Lap Chi Lau, Kai Man Leung
Graph Connectivities, Network Coding, and Expander Graphs. FOCS (2011)
Tamás Király, Lap Chi Lau
Degree Bounded Forest Covering. IPCO (2011)
Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau
On Disjoint Common Bases in Two Matroids. SIAM J. Discret. Math. 25 (4) (2011)
Ho Yee Cheung, Lap Chi Lau, Kai Man Leung
Algebraic Algorithms for Linear Matroid Parity Problems. SODA (2011)
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung
Degree Bounded Network Design with Metric Costs. SIAM J. Comput. 40 (4) (2011)
Yuk Hei Chan, Lap Chi Lau
On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. SODA (2010)
Lap Chi Lau, Chun Kong Yung
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. IPCO (2010)
Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy
Computing Graph Roots Without Short Cycles CoRR (2009)
Zongpeng Li, Baochun Li, Lap Chi Lau
A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks. IEEE Trans. Inf. Theory 55 (3) (2009)
Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy
Computing Graph Roots Without Short Cycles. STACS (2009)
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. 39 (3) (2009)
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung
Degree Bounded Network Design with Metric Costs. FOCS (2008)
András Frank, Lap Chi Lau, Jácint Szabó
A note on degree-constrained subgraphs. Discret. Math. 308 (12) (2008)
Tamás Király, Lap Chi Lau, Mohit Singh
Degree Bounded Matroids and Submodular Flows. IPCO (2008)
Lap Chi Lau, Mohit Singh
Additive approximation for bounded degree survivable network design. STOC (2008)
Tamás Király, Lap Chi Lau
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs. J. Comb. Theory, Ser. B 98 (6) (2008)
Mohit Singh, Lap Chi Lau
Approximating minimum bounded degree spanning trees to within one of optimal. STOC (2007)
Lap Chi Lau
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. Comb. 27 (1) (2007)
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
Survivable network design with degree or order constraints. STOC (2007)
Tamás Király, Lap Chi Lau
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. FOCS (2006)
Lap Chi Lau, Michael Molloy
Randomly Colouring Graphs with Girth Five and Large Maximum Degree. LATIN (2006)
Lap Chi Lau
Bipartite roots of graphs. ACM Trans. Algorithms 2 (2) (2006)
Zongpeng Li, Baochun Li, Lap Chi Lau
On achieving maximum multicast throughput in undirected networks. IEEE Trans. Inf. Theory 52 (6) (2006)
Mohammad Taghi Hajiaghayi, Kamal Jain, Lap Chi Lau, Ion I. Mandoiu, Alexander Russell, Vijay V. Vazirani
Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping. International Conference on Computational Science (2) (2006)
Lap Chi Lau
Packing Steiner Forests. IPCO (2005)
Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau
On achieving optimal throughput with network coding. INFOCOM (2005)
Lap Chi Lau
Bipartite roots of graphs. SODA (2004)
Lap Chi Lau, Derek G. Corneil
Recognizing Powers of Proper Interval, Split, and Chordal Graph. SIAM J. Discret. Math. 18 (1) (2004)
Lap Chi Lau
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. FOCS (2004)