The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lap Chi Lau: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lap Chi Lau
    An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:61-70 [Conf]
  2. Tamás Király, Lap Chi Lau
    Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:283-292 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:758-766 [Conf]
  4. Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau
    On achieving optimal throughput with network coding. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:2184-2194 [Conf]
  5. Lap Chi Lau
    Packing Steiner Forests. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:362-376 [Conf]
  6. Lap Chi Lau, Michael Molloy
    Randomly Colouring Graphs with Girth Five and Large Maximum Degree. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:665-676 [Conf]
  7. Lap Chi Lau
    Bipartite roots of graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:952-961 [Conf]
  8. Lap Chi Lau, Derek G. Corneil
    Recognizing Powers of Proper Interval, Split, and Chordal Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:83-102 [Journal]
  9. Lap Chi Lau
    Bipartite roots of graphs. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:2, pp:178-208 [Journal]
  10. Zongpeng Li, Baochun Li, Lap Chi Lau
    On achieving maximum multicast throughput in undirected networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2467-2485 [Journal]
  11. Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
    Survivable network design with degree or order constraints. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:651-660 [Conf]
  12. Mohit Singh, Lap Chi Lau
    Approximating minimum bounded degree spanning trees to within one of optimal. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:661-670 [Conf]
  13. Lap Chi Lau
    An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:1, pp:71-90 [Journal]

  14. Degree Bounded Network Design with Metric Costs. [Citation Graph (, )][DBLP]


  15. Degree Bounded Matroids and Submodular Flows. [Citation Graph (, )][DBLP]


  16. Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. [Citation Graph (, )][DBLP]


  17. On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. [Citation Graph (, )][DBLP]


  18. Computing Graph Roots Without Short Cycles. [Citation Graph (, )][DBLP]


  19. Additive approximation for bounded degree survivable network design. [Citation Graph (, )][DBLP]


  20. Computing Graph Roots Without Short Cycles [Citation Graph (, )][DBLP]


  21. A note on degree-constrained subgraphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002