The following pages link to Lusheng Wang (Q166206):
Displaying 50 items.
- (Q235175) (redirect page) (← links)
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- Parameterized and approximation algorithms for finding two disjoint matchings (Q300238) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- Exact and approximation algorithms for the complementary maximal strip recovery problem (Q437065) (← links)
- An improved approximation algorithm for the complementary maximal strip recovery problem (Q439932) (← links)
- A polynomial time approximation scheme for the closest shared center problem (Q513292) (← links)
- The parameterized complexity of the shared center problem (Q517791) (← links)
- An approximation algorithm for the minimum co-path set problem (Q547306) (← links)
- On the ordering of benzenoid chains and cyclo-polyphenacenes with respect to their numbers of clar aromatic sextets (Q551976) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing'' (Q708336) (← links)
- Maximizing profits of routing in WDM networks (Q813327) (← links)
- On the complexity of unsigned translocation distance (Q818147) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- On partitioning simple bipartite graphs in vertex-disjoint paths (Q925494) (← links)
- Space efficient algorithms for ordered tree comparison (Q930598) (← links)
- An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- An improved randomized approximation algorithm for maximum triangle packing (Q1028142) (← links)
- On bipartite graphs with minimal energy (Q1028491) (← links)
- Approximation algorithms for reconstructing the duplication history of tandem repeats (Q1040651) (← links)
- Improved deterministic approximation algorithms for max TSP (Q1041779) (← links)
- A polynomial time approximation scheme for embedding a directed hypergraph on a ring (Q1045935) (← links)
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem (Q1281769) (← links)
- Fixed topology Steiner trees and spanning forests (Q1285596) (← links)
- Fitting distances by tree metrics with increment error (Q1306400) (← links)
- Approximations for a bottleneck Steiner tree problem (Q1348905) (← links)
- Approximate sequencing for variable length tasks. (Q1401212) (← links)
- A complete solution to a conjecture on the \({\beta}\)-polynomials of graphs (Q1405562) (← links)
- \(k\)-resonance of open-ended carbon nanotubes (Q1431710) (← links)
- Fixed topology alignment with recombination (Q1585336) (← links)
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516) (← links)
- Computing similarity between RNA structures (Q1605306) (← links)
- An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
- On \(k\)-coloring of weighted circular-arc graphs (Q1768168) (← links)
- On the complexity of finding emerging patterns (Q1781987) (← links)
- Exact matching of RNA secondary structure patterns (Q1781989) (← links)
- Center and distinguisher for strings with unbounded alphabet (Q1810861) (← links)
- Finding similar regions in many sequences (Q1869936) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- Removable edges in a cycle of a 4-connected graph (Q1886346) (← links)
- On the completeness of incidence calculus (Q1923826) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring (Q1928513) (← links)
- On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964) (← links)
- The one-cop-moves game on graphs of small treewidth (Q2180181) (← links)
- The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
- Designing and implementing algorithms for the closest string problem (Q2319901) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
