| 2008 |
|---|
| 15 | EE | Tamás Király,
Lap Chi Lau,
Mohit Singh:
Degree Bounded Matroids and Submodular Flows.
IPCO 2008: 259-272 |
| 14 | EE | Lap Chi Lau,
Mohit Singh:
Additive approximation for bounded degree survivable network design.
STOC 2008: 759-768 |
| 2007 |
|---|
| 13 | EE | Lap Chi Lau,
Joseph Naor,
Mohammad R. Salavatipour,
Mohit Singh:
Survivable network design with degree or order constraints.
STOC 2007: 651-660 |
| 12 | EE | Mohit Singh,
Lap Chi Lau:
Approximating minimum bounded degree spanning trees to within one of optimal.
STOC 2007: 661-670 |
| 11 | EE | Lap Chi Lau:
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*.
Combinatorica 27(1): 71-90 (2007) |
| 2006 |
|---|
| 10 | EE | Tamás Király,
Lap Chi Lau:
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs.
FOCS 2006: 283-292 |
| 9 | EE | 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 |
| 8 | EE | Lap Chi Lau,
Michael Molloy:
Randomly Colouring Graphs with Girth Five and Large Maximum Degree.
LATIN 2006: 665-676 |
| 7 | EE | Lap Chi Lau:
Bipartite roots of graphs.
ACM Transactions on Algorithms 2(2): 178-208 (2006) |
| 6 | EE | 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) |
| 2005 |
|---|
| 5 | EE | Zongpeng Li,
Baochun Li,
Dan Jiang,
Lap Chi Lau:
On achieving optimal throughput with network coding.
INFOCOM 2005: 2184-2194 |
| 4 | EE | Lap Chi Lau:
Packing Steiner Forests.
IPCO 2005: 362-376 |
| 2004 |
|---|
| 3 | EE | Lap Chi Lau:
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem.
FOCS 2004: 61-70 |
| 2 | EE | Lap Chi Lau:
Bipartite roots of graphs.
SODA 2004: 952-961 |
| 1 | EE | Lap Chi Lau,
Derek G. Corneil:
Recognizing Powers of Proper Interval, Split, and Chordal Graph.
SIAM J. Discrete Math. 18(1): 83-102 (2004) |
