The following pages link to Lusheng Wang (Q166206):
Displaying 34 items.
- Better Approximation Algorithms for Scaffolding Problems (Q4632165) (← links)
- Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
- (Q4712905) (← links)
- (Q4737204) (← links)
- A NON-NUMERIC APPROACH TO UNCERTAIN REASONING (Q4861654) (← links)
- A Polynomial Time Approximation Scheme for the Closest Shared Center Problem (Q4925254) (← links)
- (Q4945794) (← links)
- Better Practical Algorithms for rSPR Distance and Hybridization Number (Q5091731) (← links)
- Randomized and Parameterized Algorithms for the Closest String Problem (Q5165596) (← links)
- (Q5299365) (← links)
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)
- Faster Exact Computation of rSPR Distance (Q5405915) (← links)
- (Q5412744) (← links)
- (Q5471182) (← links)
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (Q5505667) (← links)
- Algorithmic Applications in Management (Q5710141) (← links)
- Algorithms and Computation (Q5712174) (← links)
- Near optimal multiple alignment within a band in polynomial time (Q5895203) (← links)
- Algorithms and Computation (Q5897871) (← links)
- Algorithms and Computation (Q5897872) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918818) (← links)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)
- Near optimal multiple alignment within a band in polynomial time (Q5925273) (← links)
- Approximations for Steiner trees with minimum number of Steiner points (Q5927652) (← links)
- Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)
- On the complexity of comparing evolutionary trees (Q5961623) (← links)
- Beyond evolutionary trees (Q5962068) (← links)
- Edge searching and fast searching with constraints (Q6122599) (← links)
- Constrained graph searching on trees (Q6535820) (← links)
- Algorithms and hardness for the longest common subsequence of three strings and related problems (Q6545446) (← links)
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals (Q6591644) (← links)
- An approximation algorithm for covering vertices by \(4^+\)-paths (Q6606209) (← links)
- Deduction, Constrained Zero Forcing, and Constrained Searching (Q6751180) (← links)
