Lap Chi Lau

T.-H. Hubert Chan, Lap Chi Lau, Luca Trevisan (Eds.): 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

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)

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)

Yuk Hei Chan, Lap Chi Lau: On linear and semidefinite programming relaxations for hypergraph matching. Math. Program. 135(1-2): 123-148 (2012)

Tsz Chiu Kwok, Lap Chi Lau: Finding Small Sparse Cuts by Random Walk. APPROX-RANDOM 2012: 615-626

Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau: Fast matrix rank algorithms and applications. STOC 2012: 549-562

Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau: Fast Matrix Rank Algorithms and Applications. CoRR abs/1203.6705 (2012)

Tsz Chiu Kwok, Lap Chi Lau: Finding Small Sparse Cuts Locally by Random Walk. CoRR abs/1204.4666 (2012)

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)

Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau: On Disjoint Common Bases in Two Matroids. SIAM J. Discrete Math. 25(4): 1792-1803 (2011)

Ho Yee Cheung, Lap Chi Lau, Kai Man Leung: Graph Connectivities, Network Coding, and Expander Graphs. FOCS 2011: 190-199

Tamás Király, Lap Chi Lau: Degree Bounded Forest Covering. IPCO 2011: 315-323

Ho Yee Cheung, Lap Chi Lau, Kai Man Leung: Algebraic Algorithms for Linear Matroid Parity Problems. SODA 2011: 1366-1382

Lap Chi Lau, Chun Kong Yung: Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. IPCO 2010: 96-109

Yuk Hei Chan, Lap Chi Lau: On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. SODA 2010: 1500-1511

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)

Zongpeng Li, Baochun Li, Lap Chi Lau: A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks. IEEE Transactions on Information Theory 55(3): 1016-1026 (2009)

Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy: Computing Graph Roots Without Short Cycles. STACS 2009: 397-408

Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy: Computing Graph Roots Without Short Cycles. CoRR abs/0902.2150 (2009)

András Frank, Lap Chi Lau, Jácint Szabó: A note on degree-constrained subgraphs. Discrete Mathematics 308(12): 2647-2648 (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): 1233-1252 (2008)

Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung: Degree Bounded Network Design with Metric Costs. FOCS 2008: 125-134

Tamás Király, Lap Chi Lau, Mohit Singh: Degree Bounded Matroids and Submodular Flows. IPCO 2008: 259-272

Lap Chi Lau, Mohit Singh: Additive approximation for bounded degree survivable network design. STOC 2008: 759-768

Lap Chi Lau: An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. Combinatorica 27(1): 71-90 (2007)

Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh: Survivable network design with degree or order constraints. STOC 2007: 651-660

Mohit Singh, Lap Chi Lau: Approximating minimum bounded degree spanning trees to within one of optimal. STOC 2007: 661-670

Lap Chi Lau: Bipartite roots of graphs. ACM Transactions on Algorithms 2(2): 178-208 (2006)

Zongpeng Li, Baochun Li, Lap Chi Lau: On achieving maximum multicast throughput in undirected networks. IEEE Transactions on Information Theory 52(6): 2467-2485 (2006)

Tamás Király, Lap Chi Lau: Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. FOCS 2006: 283-292

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

Lap Chi Lau, Michael Molloy: Randomly Colouring Graphs with Girth Five and Large Maximum Degree. LATIN 2006: 665-676

Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau: On achieving optimal throughput with network coding. INFOCOM 2005: 2184-2194

Lap Chi Lau: Packing Steiner Forests. IPCO 2005: 362-376

Lap Chi Lau, Derek G. Corneil: Recognizing Powers of Proper Interval, Split, and Chordal Graph. SIAM J. Discrete Math. 18(1): 83-102 (2004)

Lap Chi Lau: An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. FOCS 2004: 61-70

Lap Chi Lau: Bipartite roots of graphs. SODA 2004: 952-961