The following pages link to Lap Chi Lau (Q715087):
Displayed 50 items.
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- A unified algorithm for degree bounded survivable network design (Q896300) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- A note on degree-constrained subgraphs (Q2427532) (← links)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- Degree bounded matroids and submodular flows (Q2448960) (← links)
- Algebraic Algorithms for Linear Matroid Parity Problems (Q2799476) (← links)
- Graph Connectivities, Network Coding, and Expander Graphs (Q2848198) (← links)
- Bipartite roots of graphs (Q2944512) (← links)
- (Q2969627) (← links)
- (Q2999657) (← links)
- Degree Bounded Forest Covering (Q3009772) (← links)
- Iterative Methods in Combinatorial Optimization (Q3087101) (← links)
- Degree Bounded Network Design with Metric Costs (Q3096090) (← links)
- Finding Small Sparse Cuts by Random Walk (Q3167431) (← links)
- On Disjoint Common Bases in Two Matroids (Q3225155) (← links)
- Degree Bounded Matroids and Submodular Flows (Q3503852) (← links)
- (Q3547253) (← links)
- Survivable network design with degree or order constraints (Q3549666) (← links)
- Approximating minimum bounded degree spanning trees to within one of optimal (Q3549667) (← links)
- Survivable Network Design with Degree or Order Constraints (Q3575159) (← links)
- Packing Steiner Forests (Q3596337) (← links)
- Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile (Q4575713) (← links)
- Random Walks and Evolving Sets: Faster Convergences and Limitations (Q4575867) (← links)
- Recognizing Powers of Proper Interval, Split, and Chordal Graphs (Q4652622) (← links)
- A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks (Q4975756) (← links)
- (Q4993308) (← links)
- Spectral Analysis of Matrix Scaling and Operator Scaling (Q4997323) (← links)
- (Q5002621) (← links)
- A Local Search Framework for Experimental Design (Q5092507) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- A spectral approach to network design (Q5144968) (← links)
- Improved analysis of higher order random walks and applications (Q5145004) (← links)
- The Paulsen problem, continuous operator scaling, and smoothed analysis (Q5230288) (← links)
- (Q5302101) (← links)
- (Q5365124) (← links)
- (Q5389994) (← links)
- Fast matrix rank algorithms and applications (Q5395727) (← links)
- Additive Approximation for Bounded Degree Survivable Network Design (Q5408765) (← links)
- Fast matrix rank algorithms and applications (Q5415500) (← links)
- (Q5417726) (← links)
- A Unified Algorithm for Degree Bounded Survivable Network Design (Q5419010) (← links)
- Graph Connectivities, Network Coding, and Expander Graphs (Q5494964) (← links)
- Improved Cheeger's inequality (Q5495771) (← links)
- (Q5501358) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile (Q5737813) (← links)
- Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities (Q5891168) (← links)
- Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities (Q5900983) (← links)
- Network Design for <i>s</i> - <i>t</i> Effective Resistance (Q6058249) (← links)