default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLap Chi Lau
Refine list
refinements active!
zoomed in on 90 of 90 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2020 – today
- 2025
[c40]Sepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang:
Streaming and Communication Complexity of Load-Balancing via Matching Contractors. SODA 2025: 3423-3449- [c39]Lap Chi Lau, Robert Wang, Hong Zhou:
Spectral Sparsification by Deterministic Discrepancy Walk. SOSA 2025: 315-340 - [c38]Lap Chi Lau, Robert Wang, Hong Zhou:
Experimental Design Using Interlacing Polynomials. SOSA 2025: 452-464 - 2024
- [c37]Lap Chi Lau, Dante Tjowasi:
On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs. APPROX/RANDOM 2024: 36:1-36:18 - [c36]Lap Chi Lau, Kam Chuen Tung, Robert Wang:
Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues. SODA 2024: 591-624 - [i22]Lap Chi Lau, Dante Tjowasi:
On the Houdré-Tetali conjecture about an isoperimetric constant of graphs. CoRR abs/2407.11357 (2024) - [i21]Lap Chi Lau, Robert Wang, Hong Zhou:
Spectral Sparsification by Deterministic Discrepancy Walk. CoRR abs/2408.06146 (2024) - [i20]Lap Chi Lau, Robert Wang, Hong Zhou:
Experimental Design Using Interlacing Polynomials. CoRR abs/2410.11390 (2024) - [i19]Sepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang:
Streaming and Communication Complexity of Load-Balancing via Matching Contractors. CoRR abs/2410.16094 (2024) - 2023
- [c35]Lap Chi Lau, Robert Wang, Hong Zhou:
Experimental Design for Any p-Norm. APPROX/RANDOM 2023: 4:1-4:21 - [c34]Lap Chi Lau, Kam Chuen Tung, Robert Wang:
Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted Eigenvalues. STOC 2023: 1834-1847 - [i18]Lap Chi Lau, Robert Wang, Hong Zhou:
Experimental Design for Any p-Norm. CoRR abs/2305.01942 (2023) - [i17]Lap Chi Lau, Kam Chuen Tung, Robert Wang:
Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues. CoRR abs/2306.09128 (2023) - 2022
- [j26]Lap Chi Lau, Hong Zhou
:
A Local Search Framework for Experimental Design. SIAM J. Comput. 51(4): 900-951 (2022) - [j25]Lap Chi Lau, Hong Zhou:
A Spectral Approach to Network Design. SIAM J. Comput. 51(4): 1018-1064 (2022) - [j24]Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, Hong Zhou:
Network Design for s-t Effective Resistance. ACM Trans. Algorithms 18(3): 22:1-22:45 (2022) - [c33]Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung:
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues. FOCS 2022: 366-377 - [i16]Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung:
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues. CoRR abs/2203.06168 (2022) - [i15]Lap Chi Lau, Kam Chuen Tung, Robert Wang:
Cheeger Inequalities for Directed Graphs and Hypergraphs Using Reweighted Eigenvalues. CoRR abs/2211.09776 (2022) - 2021
- [j23]Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran:
Spectral Analysis of Matrix Scaling and Operator Scaling. SIAM J. Comput. 50(3): 1034-1102 (2021) - [c32]Lap Chi Lau, Hong Zhou:
A Local Search Framework for Experimental Design. SODA 2021: 1039-1058 - 2020
- [c31]Lap Chi Lau, Hong Zhou:
A spectral approach to network design. STOC 2020: 826-839 - [c30]Vedat Levi Alev, Lap Chi Lau:
Improved analysis of higher order random walks and applications. STOC 2020: 1198-1211 - [i14]Vedat Levi Alev, Lap Chi Lau:
Improved Analysis of Higher Order Random Walks and Applications. CoRR abs/2001.02827 (2020) - [i13]Lap Chi Lau, Hong Zhou:
A Spectral Approach to Network Design. CoRR abs/2003.07810 (2020) - [i12]Lap Chi Lau, Hong Zhou:
A Local Search Framework for Experimental Design. CoRR abs/2010.15805 (2020) - no results
2010 – 2019
- 2019
- [c29]Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran:
Spectral Analysis of Matrix Scaling and Operator Scaling. FOCS 2019: 1184-1204 - [i11]Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran:
Spectral analysis of matrix scaling and operator scaling. CoRR abs/1904.03213 (2019) - [i10]Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, Hong Zhou:
Network design for s-t effective resistance. CoRR abs/1904.03219 (2019) - 2018
- [c28]Vedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan:
Graph Clustering using Effective Resistance. ITCS 2018: 41:1-41:16 - [c27]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Akshay Ramachandran:
The Paulsen problem, continuous operator scaling, and smoothed analysis. STOC 2018: 182-189 - 2017
- [j22]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): 890-910 (2017) - [c26]Vedat Levi Alev, Lap Chi Lau:
Approximating Unique Games Using Low Diameter Graph Decomposition. APPROX-RANDOM 2017: 18:1-18:15 - [c25]Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau:
Random Walks and Evolving Sets: Faster Convergences and Limitations. SODA 2017: 1849-1865 - [i9]Vedat Levi Alev, Lap Chi Lau:
Approximating Unique Games Using Low Diameter Graph Decomposition. CoRR abs/1702.06969 (2017) - [i8]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Akshay Ramachandran:
The Paulsen Problem, Continuous Operator Scaling, and Smoothed Analysis. CoRR abs/1710.02587 (2017) - [i7]Vedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan:
Graph Clustering using Effective Resistance. CoRR abs/1711.06530 (2017) - 2016
- [c24]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: 1848-1861 - 2015
- [j21]Mohit Singh, Lap Chi Lau:
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal. J. ACM 62(1): 1:1-1:19 (2015) - [j20]Lap Chi Lau, Hong Zhou:
A unified algorithm for degree bounded survivable network design. Math. Program. 154(1-2): 515-532 (2015) - [i6]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 abs/1504.00686 (2015) - [i5]Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau:
Random Walks and Evolving Sets: Faster Convergences and Limitations. CoRR abs/1507.02069 (2015) - 2014
- [j19]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): 255 (2014) - [j18]Ho Yee Cheung, Lap Chi Lau, Kai Man Leung:
Algebraic Algorithms for Linear Matroid Parity Problems. ACM Trans. Algorithms 10(3): 10:1-10:26 (2014) - [c23]Tsz Chiu Kwok, Lap Chi Lau:
Lower Bounds on Expansions of Graph Powers. APPROX-RANDOM 2014: 313-324 - [c22]Lap Chi Lau, Hong Zhou:
A Unified Algorithm for Degree Bounded Survivable Network Design. IPCO 2014: 369-380 - 2013
- [j17]Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau:
Fast matrix rank algorithms and applications. J. ACM 60(5): 31:1-31:25 (2013) - [j16]Ho Yee Cheung, Lap Chi Lau, Kai Man Leung:
Graph Connectivities, Network Coding, and Expander Graphs. SIAM J. Comput. 42(3): 733-751 (2013) - [j15]Lap Chi Lau, Chun Kong Yung:
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. SIAM J. Comput. 42(3): 1185-1200 (2013) - [j14]Lap Chi Lau, Mohit Singh:
Additive Approximation for Bounded Degree Survivable Network Design. SIAM J. Comput. 42(6): 2217-2242 (2013) - [c21]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: 11-20 - [e1]T.-H. Hubert Chan, Lap Chi Lau, Luca Trevisan:
Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings. Lecture Notes in Computer Science 7876, Springer 2013, ISBN 978-3-642-38235-2 [contents] - [i4]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 abs/1301.5584 (2013) - 2012
- [j13]Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy:
Complexity of Finding Graph Roots with Girth Conditions. Algorithmica 62(1-2): 38-53 (2012) - [j12]Tamás Király, Lap Chi Lau, Mohit Singh:
Degree bounded matroids and submodular flows. Comb. 32(6): 703-720 (2012) - [j11]Yuk Hei Chan, Lap Chi Lau:
On linear and semidefinite programming relaxations for hypergraph matching. Math. Program. 135(1-2): 123-148 (2012) - [c20]Tsz Chiu Kwok, Lap Chi Lau:
Finding Small Sparse Cuts by Random Walk. APPROX-RANDOM 2012: 615-626 - [c19]Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau:
Fast matrix rank algorithms and applications. STOC 2012: 549-562 - [i3]Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau:
Fast Matrix Rank Algorithms and Applications. CoRR abs/1203.6705 (2012) - [i2]Tsz Chiu Kwok, Lap Chi Lau:
Finding Small Sparse Cuts Locally by Random Walk. CoRR abs/1204.4666 (2012) - 2011
- [j10]Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung:
Degree Bounded Network Design with Metric Costs. SIAM J. Comput. 40(4): 953-980 (2011) - [j9]Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau:
On Disjoint Common Bases in Two Matroids. SIAM J. Discret. Math. 25(4): 1792-1803 (2011) - [c18]Ho Yee Cheung, Lap Chi Lau, Kai Man Leung:
Graph Connectivities, Network Coding, and Expander Graphs. FOCS 2011: 190-199 - [c17]Tamás Király, Lap Chi Lau:
Degree Bounded Forest Covering. IPCO 2011: 315-323 - [c16]Ho Yee Cheung, Lap Chi Lau, Kai Man Leung:
Algebraic Algorithms for Linear Matroid Parity Problems. SODA 2011: 1366-1382 - 2010
- [c15]Lap Chi Lau, Chun Kong Yung:
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. IPCO 2010: 96-109 - [c14]Yuk Hei Chan, Lap Chi Lau:
On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. SODA 2010: 1500-1511 - no results
2000 – 2009
- 2009
- [j8]Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh:
Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. 39(3): 1062-1087 (2009) - [j7]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): 1016-1026 (2009) - [c13]Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy:
Computing Graph Roots Without Short Cycles. STACS 2009: 397-408 - [i1]Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy:
Computing Graph Roots Without Short Cycles. CoRR abs/0902.2150 (2009) - 2008
- [j6]András Frank, Lap Chi Lau, Jácint Szabó:
A note on degree-constrained subgraphs. Discret. Math. 308(12): 2647-2648 (2008) - [j5]Tamás Király, Lap Chi Lau:
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs. J. Comb. Theory B 98(6): 1233-1252 (2008) - [c12]Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung:
Degree Bounded Network Design with Metric Costs. FOCS 2008: 125-134 - [c11]Tamás Király, Lap Chi Lau, Mohit Singh:
Degree Bounded Matroids and Submodular Flows. IPCO 2008: 259-272 - [c10]Lap Chi Lau, Mohit Singh:
Additive approximation for bounded degree survivable network design. STOC 2008: 759-768 - 2007
- [j4]Lap Chi Lau:
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. Comb. 27(1): 71-90 (2007) - [c9]Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh:
Survivable network design with degree or order constraints. STOC 2007: 651-660 - [c8]Mohit Singh, Lap Chi Lau:
Approximating minimum bounded degree spanning trees to within one of optimal. STOC 2007: 661-670 - 2006
- [b1]Lap Chi Lau:
On approximate min-max theorems for graph connectivity problems. University of Toronto, Canada, 2006 - [j3]Lap Chi Lau:
Bipartite roots of graphs. ACM Trans. Algorithms 2(2): 178-208 (2006) - [j2]Zongpeng Li, Baochun Li, Lap Chi Lau:
On achieving maximum multicast throughput in undirected networks. IEEE Trans. Inf. Theory 52(6): 2467-2485 (2006) - [c7]Tamás Király, Lap Chi Lau:
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. FOCS 2006: 283-292 - [c6]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: 758-766 - [c5]Lap Chi Lau, Michael Molloy:
Randomly Colouring Graphs with Girth Five and Large Maximum Degree. LATIN 2006: 665-676 - 2005
- [c4]Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau:
On achieving optimal throughput with network coding. INFOCOM 2005: 2184-2194 - [c3]Lap Chi Lau:
Packing Steiner Forests. IPCO 2005: 362-376 - 2004
- [j1]Lap Chi Lau, Derek G. Corneil:
Recognizing Powers of Proper Interval, Split, and Chordal Graph. SIAM J. Discret. Math. 18(1): 83-102 (2004) - [c2]Lap Chi Lau:
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. FOCS 2004: 61-70 - [c1]Lap Chi Lau:
Bipartite roots of graphs. SODA 2004: 952-961 - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 19:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
