dblp.uni-trier.dewww.uni-trier.de

Lap Chi Lau

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
21EEBabak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy: Computing Graph Roots Without Short Cycles. STACS 2009: 397-408
20EEBabak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy: Computing Graph Roots Without Short Cycles CoRR abs/0902.2150: (2009)
19EEZongpeng 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)
2008
18EEYuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung: Degree Bounded Network Design with Metric Costs. FOCS 2008: 125-134
17EETamás Király, Lap Chi Lau, Mohit Singh: Degree Bounded Matroids and Submodular Flows. IPCO 2008: 259-272
16EELap Chi Lau, Mohit Singh: Additive approximation for bounded degree survivable network design. STOC 2008: 759-768
15EEAndrás Frank, Lap Chi Lau, Jácint Szabó: A note on degree-constrained subgraphs. Discrete Mathematics 308(12): 2647-2648 (2008)
14EETamá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)
2007
13EELap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh: Survivable network design with degree or order constraints. STOC 2007: 651-660
12EEMohit Singh, Lap Chi Lau: Approximating minimum bounded degree spanning trees to within one of optimal. STOC 2007: 661-670
11EELap Chi Lau: An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. Combinatorica 27(1): 71-90 (2007)
2006
10EETamás Király, Lap Chi Lau: Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. FOCS 2006: 283-292
9EEMohammad 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
8EELap Chi Lau, Michael Molloy: Randomly Colouring Graphs with Girth Five and Large Maximum Degree. LATIN 2006: 665-676
7EELap Chi Lau: Bipartite roots of graphs. ACM Transactions on Algorithms 2(2): 178-208 (2006)
6EEZongpeng 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
5EEZongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau: On achieving optimal throughput with network coding. INFOCOM 2005: 2184-2194
4EELap Chi Lau: Packing Steiner Forests. IPCO 2005: 362-376
2004
3EELap Chi Lau: An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. FOCS 2004: 61-70
2EELap Chi Lau: Bipartite roots of graphs. SODA 2004: 952-961
1EELap Chi Lau, Derek G. Corneil: Recognizing Powers of Proper Interval, Split, and Chordal Graph. SIAM J. Discrete Math. 18(1): 83-102 (2004)

Coauthor Index

1Yuk Hei Chan [18]
2Derek G. Corneil [1]
3Babak Farzad [20] [21]
4András Frank [15]
5Wai Shing Fung [18]
6Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi) [9]
7Kamal Jain [9]
8Dan Jiang [5]
9Tamás Király [10] [14] [17]
10Van Bang Le [20] [21]
11Baochun Li [5] [6] [19]
12Zongpeng Li [5] [6] [19]
13Ion I. Mandoiu [9]
14Michael Molloy (Michael S. O. Molloy) [8]
15Joseph Naor (Seffi Naor) [13]
16Alexander Russell [9]
17Mohammad R. Salavatipour [13]
18Mohit Singh [12] [13] [16] [17]
19Jácint Szabó [15]
20Nguyen Ngoc Tuy [20] [21]
21Vijay V. Vazirani [9]
22Chun Kong Yung [18]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)