|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 26 occurrences of 19 keywords
|
|
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy |
Complexity of Finding Graph Roots with Girth Conditions.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau |
Fast Matrix Rank Algorithms and Applications |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Tsz Chiu Kwok, Lap Chi Lau |
Finding Small Sparse Cuts Locally by Random Walk |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau |
Fast matrix rank algorithms and applications. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau |
On Disjoint Common Bases in Two Matroids. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |
Degree Bounded Network Design with Metric Costs. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho Yee Cheung, Lap Chi Lau, Kai Man Leung |
Algebraic Algorithms for Linear Matroid Parity Problems. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tamás Király, Lap Chi Lau |
Degree Bounded Forest Covering. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho Yee Cheung, Lap Chi Lau, Kai Man Leung |
Graph Connectivities, Network Coding, and Expander Graphs. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuk Hei Chan, Lap Chi Lau |
On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Lap Chi Lau, Chun Kong Yung |
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy |
Computing Graph Roots Without Short Cycles |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh |
Survivable Network Design with Degree or Order Constraints. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy |
Computing Graph Roots Without Short Cycles. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Király, Lap Chi Lau |
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | András Frank, Lap Chi Lau, Jácint Szabó |
A note on degree-constrained subgraphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Király, Lap Chi Lau, Mohit Singh |
Degree Bounded Matroids and Submodular Flows. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |
Degree Bounded Network Design with Metric Costs. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lap Chi Lau, Mohit Singh |
Additive approximation for bounded degree survivable network design. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, steiner tree, bounded degree, iterative rounding, survivable network design |
| 1 | Lap Chi Lau |
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C05, 68R10, 05C70, 68W25, 05C40 |
| 1 | Mohit Singh, Lap Chi Lau |
Approximating minimum bounded degree spanning trees to within one of optimal. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithm, spanning trees, bounded degree, iterative rounding |
| 1 | Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh |
Survivable network design with degree or order constraints. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, NP-hard problems, bounded degree, iterative rounding |
| 1 | Lap Chi Lau |
Bipartite roots of graphs. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Graph roots, bipartite graphs, graph powers |
| 1 | Zongpeng Li, Baochun Li, Lap Chi Lau |
On achieving maximum multicast throughput in undirected networks. |
IEEE Transactions on Information Theory |
2006 |
DBLP DOI BibTeX RDF |
undirected networks, multicast, network coding, network flow, duality, Steiner tree, subgradient optimization |
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lap Chi Lau, Michael Molloy |
Randomly Colouring Graphs with Girth Five and Large Maximum Degree. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Király, Lap Chi Lau |
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau |
On achieving optimal throughput with network coding. |
INFOCOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lap Chi Lau |
Packing Steiner Forests. |
IPCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lap Chi Lau, Derek G. Corneil |
Recognizing Powers of Proper Interval, Split, and Chordal Graph. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lap Chi Lau |
Bipartite roots of graphs. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lap Chi Lau |
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")