- A MORE EFFICIENT APPROXIMATION SCHEME FOR TREE LUSHENG WANG, TAO JIANG, AND DAN GUSFIELD
- DOI: 10.1007/s00453-003-1054-1 Algorithmica (2004) 38: 529537
- Brief Contributions________________________________________________________________________________ Topology Control of Ad Hoc Wireless
- GENETIC DESIGN OF DRUGS WITHOUT SIDE-EFFECTS XIAOTIE DENG, GUOJUN LI, ZIMAO LI, BIN MA, AND LUSHENG WANG
- 0022-0000/02 $35.00 2002 Elsevier Science (USA)
- BIOINFORMATICS Vol. 19 no. 12 2003, pages 14971504
- Journal of Computer and System Sciences 60, 1 12 (2000) On the Inapproximability of Disjoint Paths
- BIOINFORMATICS Vol. 19 no. 14 2003, pages 17731780
- Algorithmica (1996) 16: 302315 Algorithmica
- On the Closest String and Substring Problems University of Waterloo, Waterloo, Ont., Canada
- Vol. 23 no. 1 2007, pages 5056 doi:10.1093/bioinformatics/btl560BIOINFORMATICS ORIGINAL PAPER
- Z .JOURNAL OF ALGORITHMS 25, 255 273 1997 ARTICLE NO. AL970882
- DOI: 10.1007/s00453-001-0089-4 Algorithmica (2002) 32: 554561
- Fast Exact Algorithms for the Closest String and Substring Problems with Application
- DOI 10.1007/s11276-006-0724-8 Relay sensor placement in wireless sensor networks
- Journal of Computer and System Sciences 78 (2012) 164178 Contents lists available at ScienceDirect
