| 2008 |
|---|
| 102 | EE | Zhi-Zhong Chen,
Ruka Tanahashi,
Lusheng Wang:
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing.
AAIM 2008: 97-108 |
| 101 | EE | Zhipeng Cai,
Zhi-Zhong Chen,
Guohui Lin,
Lusheng Wang:
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem.
COCOA 2008: 286-295 |
| 100 | EE | Xiaowen Liu,
Jinyan Li,
Lusheng Wang:
Quasi-bicliques: Complexity and Binding Pairs.
COCOON 2008: 255-264 |
| 99 | EE | Jing Xiao,
Lusheng Wang,
Xiaowen Liu,
Tao Jiang:
Finding Additive Biclusters with Random Background.
CPM 2008: 263-276 |
| 98 | EE | Bin Fu,
Ming-Yang Kao,
Lusheng Wang:
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences.
TAMC 2008: 234-245 |
| 97 | EE | Lusheng Wang,
Brahim Gaabab,
David Binet,
Daniel Kofman:
Novel MAP Selection Scheme Using Location History in Hierarchical MIPv6 Networks.
WCNC 2008: 2420-2425 |
| 96 | EE | Lusheng Wang:
Closest String and Substring Problems.
Encyclopedia of Algorithms 2008 |
| 95 | EE | Bhaskar DasGupta,
Lusheng Wang:
Biology Computing.
Wiley Encyclopedia of Computer Science and Engineering 2008 |
| 94 | EE | Lusheng Wang,
Kaizhong Zhang:
Space Efficient Algorithms for Ordered Tree Comparison.
Algorithmica 51(3): 283-297 (2008) |
| 93 | EE | Guohui Lin,
Zhanyong Wang,
Lusheng Wang,
Yu-Lung Lau,
Wanling Yang:
Identification of linked regions using high-density SNP genotype data in linkage analysis.
Bioinformatics 24(1): 86-93 (2008) |
| 92 | EE | Yun Cui,
Lusheng Wang,
Daming Zhu,
Xiaowen Liu:
A (1.5 + epsilon)-Approximation Algorithm for Unsigned Translocation Distance.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(1): 56-66 (2008) |
| 91 | EE | Zhi-Zhong Chen,
Ruka Tanahashi,
Lusheng Wang:
An improved approximation algorithm for maximum edge 2-coloring in simple graphs.
J. Discrete Algorithms 6(2): 205-215 (2008) |
| 90 | EE | Jing Xiao,
Lusheng Wang,
Xiaowen Liu,
Tao Jiang:
An Efficient Voting Algorithm for Finding Additive Biclusters with Random Background.
Journal of Computational Biology 15(10): 1275-1293 (2008) |
| 89 | EE | Lusheng Wang,
Yu Lin,
Xiaowen Liu:
Approximation Algorithms for Biclustering Problems.
SIAM J. Comput. 38(4): 1504-1518 (2008) |
| 88 | EE | Xiuzhen Cheng,
Ding-Zhu Du,
Lusheng Wang,
Baogang Xu:
Relay sensor placement in wireless sensor networks.
Wireless Networks 14(3): 347-355 (2008) |
| 2007 |
|---|
| 87 | | David Sankoff,
Lusheng Wang,
Francis Chin:
Proceedings of 5th Asia-Pacific Bioinformatics Conference, APBC 2007, 15-17 January 2007, Hong Kong, China
Imperial College Press 2007 |
| 86 | EE | David Sankoff,
Lusheng Wang,
Francis Chin:
Preface.
APBC 2007 |
| 85 | EE | Lusheng Wang,
Zhanyong Wang,
Zhi-Zhong Chen:
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.
COCOON 2007: 493-503 |
| 84 | EE | WangSen Feng,
Zhanyong Wang,
Lusheng Wang:
Identification of Distinguishing Motifs.
CPM 2007: 253-264 |
| 83 | EE | Lusheng Wang:
Foreword.
Algorithmica 48(2): 127 (2007) |
| 82 | EE | Xiaowen Liu,
Lusheng Wang:
Computing the maximum similarity bi-clusters of gene expression data.
Bioinformatics 23(1): 50-56 (2007) |
| 81 | EE | Jianping Li,
Lusheng Wang,
Hao Zhao:
On packing and coloring hyperedges in a cycle.
Discrete Applied Mathematics 155(16): 2140-2151 (2007) |
| 80 | EE | Bin Ma,
Lusheng Wang,
Ming Li:
Near optimal multiple alignment within a band in polynomial time.
J. Comput. Syst. Sci. 73(6): 997-1011 (2007) |
| 79 | EE | Yun Cui,
Lusheng Wang,
Daming Zhu:
A 1.75-approximation algorithm for unsigned translocation distance.
J. Comput. Syst. Sci. 73(7): 1045-1059 (2007) |
| 78 | EE | Mingxia Chen,
Jianbo Li,
Jianping Li,
Weidong Li,
Lusheng Wang:
Some approximation algorithms for the clique partition problem in weighted interval graphs.
Theor. Comput. Sci. 381(1-3): 124-133 (2007) |
| 2006 |
|---|
| 77 | EE | Lusheng Wang,
Yu Lin,
Xiaowen Liu:
Approximation Algorithms for Bi-clustering Problems.
WABI 2006: 310-320 |
| 76 | | Lusheng Wang:
Translocation Distance: Algorithms and Complexity.
Advances in Computers 68: 106-127 (2006) |
| 75 | EE | Kang Li,
Lusheng Wang:
A polynomial time approximation scheme for embedding a directed hypergraph on a ring.
Inf. Process. Lett. 97(5): 203-207 (2006) |
| 74 | EE | Lusheng Wang:
Introduction to the special issue.
J. Comb. Optim. 11(2): 131 (2006) |
| 73 | EE | Daming Zhu,
Lusheng Wang:
On the complexity of unsigned translocation distance.
Theor. Comput. Sci. 352(1-3): 322-328 (2006) |
| 2005 |
|---|
| 72 | | Lusheng Wang:
Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings
Springer 2005 |
| 71 | EE | Kang Li,
Lusheng Wang:
An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring.
AAIM 2005: 392-399 |
| 70 | EE | Lusheng Wang,
Daming Zhu,
Xiaowen Liu,
Shaohan Ma:
An O(N2) algorithm for signed translocation problem.
APBC 2005: 349-358 |
| 69 | EE | Lusheng Wang,
Kaizhong Zhang:
Space Efficient Algorithms for Ordered Tree Comparison.
ISAAC 2005: 380-391 |
| 68 | EE | Yun Cui,
Lusheng Wang,
Daming Zhu:
A 1.75-Approximation Algorithm for Unsigned Translocation Distance.
ISAAC 2005: 392-401 |
| 67 | EE | Baogang Xu,
Lusheng Wang:
Decomposing toroidal graphs into circuits and edges.
Discrete Applied Mathematics 148(2): 147-159 (2005) |
| 66 | EE | Zhi-Zhong Chen,
Yuusuke Okamoto,
Lusheng Wang:
Improved deterministic approximation algorithms for Max TSP.
Inf. Process. Lett. 95(2): 333-342 (2005) |
| 65 | EE | Lusheng Wang,
Liang Dong:
Randomized Algorithms for Motif Detection.
J. Bioinformatics and Computational Biology 3(5): 1039-1052 (2005) |
| 64 | EE | Jianping Li,
Kang Li,
Lusheng Wang,
Hao Zhao:
Maximizing Profits of Routing in WDM Networks.
J. Comb. Optim. 10(2): 99-111 (2005) |
| 63 | EE | Zhi-Zhong Chen,
Lusheng Wang:
An Improved Randomized Approximation Algorithm for Max TSP.
J. Comb. Optim. 9(4): 401-432 (2005) |
| 62 | EE | Lusheng Wang,
Daming Zhu,
Xiaowen Liu,
Shaohan Ma:
An O(n2) algorithm for signed translocation.
J. Comput. Syst. Sci. 70(3): 284-299 (2005) |
| 61 | EE | Lusheng Wang,
Hao Zhao,
Guozhu Dong,
Jianping Li:
On the complexity of finding emerging patterns.
Theor. Comput. Sci. 335(1): 15-27 (2005) |
| 60 | EE | Ying Xu,
Lusheng Wang,
Hao Zhao,
Jianping Li:
Exact matching of RNA secondary structure patterns.
Theor. Comput. Sci. 335(1): 53-66 (2005) |
| 2004 |
|---|
| 59 | EE | Ying Yu,
Lusheng Wang,
Xiaotie Deng:
Exact Pattern Matching for RNA Secondary Structures.
APBC 2004: 257-263 |
| 58 | EE | Lusheng Wang,
Hao Zhao,
Guozhu Dong,
Jianping Li:
On the Complexity of Finding Emerging Patterns.
COMPSAC Workshops 2004: 126-129 |
| 57 | EE | Lusheng Wang,
Liang Dong,
Hui Fan:
Randomized Algorithms for Motif Detection.
ISAAC 2004: 884-895 |
| 56 | EE | Mao-cheng Cai,
Xiaotie Deng,
Lusheng Wang:
Minimum k Arborescences with Bandwidth Constraints.
Algorithmica 38(4): 529-537 (2004) |
| 55 | EE | WangSen Feng,
Lusheng Wang,
Daming Zhu:
CTRD: a fast applet for computing signed translocation distance between genomes.
Bioinformatics 20(17): 3256-3257 (2004) |
| 54 | EE | Jichang Wu,
Xueliang Li,
Lusheng Wang:
Removable edges in a cycle of a 4-connected graph.
Discrete Mathematics 287(1-3): 103-111 (2004) |
| 53 | EE | Maggie Xiaoyan Cheng,
Mihaela Cardei,
Jianhua Sun,
Xiaochun Cheng,
Lusheng Wang,
Yinfeng Xu,
Ding-Zhu Du:
Topology Control of Ad Hoc Wireless Networks for Energy Efficiency.
IEEE Trans. Computers 53(12): 1629-1635 (2004) |
| 2003 |
|---|
| 52 | EE | Günter Rote,
Cao An Wang,
Lusheng Wang,
Yin-Feng Xu:
On Constrained Minimum Pseudotriangulations.
COCOON 2003: 445-454 |
| 51 | | Louxin Zhang,
Bin Ma,
Lusheng Wang,
Ying Xu:
Greedy method for inferring tandem duplication history.
Bioinformatics 19(12): 1497-1504 (2003) |
| 50 | | Lusheng Wang,
Ying Xu:
Haplotype inference by maximum parsimony.
Bioinformatics 19(14): 1773-1780 (2003) |
| 49 | | Lusheng Wang,
Jianyun Zhao:
Parametric alignment of ordered trees.
Bioinformatics 19(17): 2237-2245 (2003) |
| 48 | | Lusheng Wang,
Ying Xu:
SEGID: Identifying Interesting Segments in (Multiple) Sequence Alignments.
Bioinformatics 19(2): 297-298 (2003) |
| 47 | | Xueliang Li,
Zimao Li,
Lusheng Wang:
The Inverse Problems for Some Topological Indices in Combinatorial Chemistry.
Journal of Computational Biology 10(1): 47-56 (2003) |
| 46 | EE | Xiaotie Deng,
Guojun Li,
Zimao Li,
Bin Ma,
Lusheng Wang:
Genetic Design of Drugs Without Side-Effects.
SIAM J. Comput. 32(4): 1073-1090 (2003) |
| 45 | EE | Xueliang Li,
Lusheng Wang:
Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids.
SIAM J. Discrete Math. 17(2): 210-218 (2003) |
| 44 | | Mao-cheng Cai,
Xiaotie Deng,
Lusheng Wang:
Approximate sequencing for variable length tasks.
Theor. Comput. Sci. 290(3): 2037-2044 (2003) |
| 2002 |
|---|
| 43 | EE | Xiaotie Deng,
Guojun Li,
Zimao Li,
Bin Ma,
Lusheng Wang:
A PTAS for Distinguishing (Sub)string Selection.
ICALP 2002: 740-751 |
| 42 | EE | Louxin Zhang,
Bin Ma,
Lusheng Wang:
Efficient Methods for Inferring Tandem Duplication History.
WABI 2002: 97-111 |
| 41 | EE | Lusheng Wang,
Ding-Zhu Du:
Approximations for a Bottleneck Steiner Tree Problem.
Algorithmica 32(4): 554-561 (2002) |
| 40 | EE | Lusheng Wang,
Zimao Li:
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane.
Inf. Process. Lett. 81(3): 151-156 (2002) |
| 39 | EE | Ming Li,
Bin Ma,
Lusheng Wang:
On the closest string and substring problems.
J. ACM 49(2): 157-171 (2002) |
| 38 | | Xiaotie Deng,
Guojun Li,
Lusheng Wang:
Center and Distinguisher for Strings with Unbounded Alphabet.
J. Comb. Optim. 6(4): 383-400 (2002) |
| 37 | EE | Ming Li,
Bin Ma,
Lusheng Wang:
Finding Similar Regions in Many Sequences.
J. Comput. Syst. Sci. 65(1): 73-96 (2002) |
| 36 | EE | Bin Ma,
Lusheng Wang,
Kaizhong Zhang:
Computing similarity between RNA structures.
Theor. Comput. Sci. 276(1-2): 111-132 (2002) |
| 2001 |
|---|
| 35 | EE | Ding-Zhu Du,
Lusheng Wang,
Baogang Xu:
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points.
COCOON 2001: 509-518 |
| 34 | EE | Lusheng Wang,
Kaizhong Zhang,
Louxin Zhang:
Perfect phylogenetic networks with recombination.
SAC 2001: 46-50 |
| 33 | | Lusheng Wang,
Kaizhong Zhang,
Louxin Zhang:
Perfect Phylogenetic Networks with Recombination.
Journal of Computational Biology 8(1): 69-78 (2001) |
| 32 | EE | Donghui Chen,
Ding-Zhu Du,
Xiao-Dong Hu,
Guo-Hui Lin,
Lusheng Wang,
Guoliang Xue:
Approximations for Steiner trees with minimum number of Steiner points.
Theor. Comput. Sci. 262(1): 83-99 (2001) |
| 2000 |
|---|
| 31 | EE | Ming Li,
Bin Ma,
Lusheng Wang:
Near optimal multiple alignment within a band in polynomial time.
STOC 2000: 425-434 |
| 30 | EE | Ming Li,
Bin Ma,
Lusheng Wang:
On The Closest String and Substring Problems
CoRR cs.CE/0002012: (2000) |
| 29 | | Lusheng Wang,
Bin Ma,
Ming Li:
Fixed topology alignment with recombination.
Discrete Applied Mathematics 104(1-3): 281-300 (2000) |
| 28 | | Bin Ma,
Lusheng Wang:
On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints.
J. Comput. Syst. Sci. 60(1): 1-12 (2000) |
| 27 | | Lusheng Wang,
Tao Jiang,
Dan Gusfield:
A More Efficient Approximation Scheme for Tree Alignment.
SIAM J. Comput. 30(1): 283-299 (2000) |
| 1999 |
|---|
| 26 | EE | Kaizhong Zhang,
Lusheng Wang,
Bin Ma:
Computing Similarity between RNA Structures.
CPM 1999: 281-293 |
| 25 | EE | Ming Li,
Bin Ma,
Lusheng Wang:
Finding Similar Regions in Many Strings.
STOC 1999: 473-482 |
| 24 | | Bin Ma,
Lusheng Wang,
Louxin Zhang:
Fitting Distances by Tree Metrics with Increment Error.
J. Comb. Optim. 3(2-3): 213-225 (1999) |
| 23 | EE | Lusheng Wang,
Xiaohua Jia:
Fixed Topology Steiner Trees and Spanning Forests.
Theor. Comput. Sci. 215(1-2): 359-370 (1999) |
| 1998 |
|---|
| 22 | | Bin Ma,
Lusheng Wang,
Ming Li:
Fixed Topology Alignment with Recombination.
CPM 1998: 174-188 |
| 21 | EE | Dan Gusfield,
Richard M. Karp,
Lusheng Wang,
Paul Stelling:
Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem.
Discrete Applied Mathematics 88(1-3): 167-180 (1998) |
| 20 | | Lusheng Wang,
Dan Gusfield:
Constructing Additive Trees When the Error Is Small.
Journal of Computational Biology 5(1): 137-134 (1998) |
| 1997 |
|---|
| 19 | | Lusheng Wang,
Xiaohua Jia:
Fixed Topology Steiner Trees and Spanning Forests with Applications in Network Communications.
COCOON 1997: 373-382 |
| 18 | EE | Lusheng Wang,
Tao Jiang,
Dan Gusfield:
A more efficient approximation scheme for tree alignment.
RECOMB 1997: 310-319 |
| 17 | EE | Xiaohua Jia,
Lusheng Wang:
A group multicast routing algorithm by using multiple minimum Steiner trees.
Computer Communications 20(9): 750-758 (1997) |
| 16 | | Lusheng Wang,
Dan Gusfield:
Improved Approximation Algorithms for Tree Alignment.
J. Algorithms 25(2): 255-273 (1997) |
| 1996 |
|---|
| 15 | | Lusheng Wang,
Dan Gusfield:
Improved Approximation Algorithms for Tree Alignment.
CPM 1996: 220-233 |
| 14 | | Dan Gusfield,
Richard M. Karp,
Lusheng Wang,
Paul Stelling:
Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem.
CPM 1996: 304-319 |
| 13 | | Lusheng Wang,
Tao Jiang,
Eugene L. Lawler:
Approximation Algorithms for Tree Alignment with a Given Phylogeny.
Algorithmica 16(3): 302-315 (1996) |
| 12 | EE | Jotun Hein,
Tao Jiang,
Lusheng Wang,
Kaizhong Zhang:
On the Complexity of Comparing Evolutionary Trees.
Discrete Applied Mathematics 71(1-3): 153-169 (1996) |
| 11 | | Lusheng Wang,
S. K. Michael Wong,
Yiyu Yao:
On the Completeness of Incidence Calculus.
J. Autom. Reasoning 16(3): 355-368 (1996) |
| 10 | EE | Lusheng Wang,
Tao Jiang:
An approximation scheme for some Steiner tree problems in the plane.
Networks 28(4): 187-193 (1996) |
| 1995 |
|---|
| 9 | | Jotun Hein,
Tao Jiang,
Lusheng Wang,
Kaizhong Zhang:
On the Complexity of Comparing Evolutionary Trees (Extended Abstract).
CPM 1995: 177-190 |
| 8 | | S. K. Michael Wong,
Lusheng Wang,
Yiyu Yao:
On Modeling Uncertainty with Interval Structures.
Computational Intelligence 11: 406-426 (1995) |
| 7 | EE | Tao Jiang,
Lusheng Wang,
Kaizhong Zhang:
Alignment of Trees - An Alternative to Tree Edit.
Theor. Comput. Sci. 143(1): 137-148 (1995) |
| 1994 |
|---|
| 6 | | Tao Jiang,
Lusheng Wang,
Kaizhong Zhang:
Alignment of Trees - An Alternative to Tree Edit.
CPM 1994: 75-86 |
| 5 | | Tao Jiang,
Lusheng Wang:
An Approximation Scheme for Some Steiner Tree Problems in the Plane.
ISAAC 1994: 414-422 |
| 4 | EE | Tao Jiang,
Eugene L. Lawler,
Lusheng Wang:
Aligning sequences via an evolutionary tree: complexity and approximation.
STOC 1994: 760-769 |
| 3 | | Lusheng Wang,
Tao Jiang:
On the Complexity of Multiple Sequence Alignment.
Journal of Computational Biology 1(4): 337-348 (1994) |
| 1992 |
|---|
| 2 | | S. K. Michael Wong,
Lusheng Wang,
Yiyu Yao:
Non-Numeric Belief Structures.
ICCI 1992: 274-277 |
| 1 | EE | S. K. Michael Wong,
Lusheng Wang,
Yiyu Yao:
Interval Structure: A Framework for Representing Uncertain Information.
UAI 1992: 336-343 |
