The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Lusheng Wang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  86. An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. [Citation Graph (, )][DBLP]


  87. A Linear Kernel for Co-Path/Cycle Packing. [Citation Graph (, )][DBLP]


  88. Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive. [Citation Graph (, )][DBLP]


  89. TRUST: A Trigger-Based Automatic Subjective Weighting Method for Network Selection. [Citation Graph (, )][DBLP]


  90. Quasi-bicliques: Complexity and Binding Pairs. [Citation Graph (, )][DBLP]


  91. Near Optimal Solutions for Maximum Quasi-bicliques. [Citation Graph (, )][DBLP]


  92. Constant Time Approximation Scheme for Largest Well Predicted Subset. [Citation Graph (, )][DBLP]


  93. A Three-String Approach to the Closest String Problem. [Citation Graph (, )][DBLP]


  94. Finding Additive Biclusters with Random Background. [Citation Graph (, )][DBLP]


  95. Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences. [Citation Graph (, )][DBLP]


  96. Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. [Citation Graph (, )][DBLP]


  97. On the Tractability of Maximal Strip Recovery. [Citation Graph (, )][DBLP]


  98. Mobility-Based Network Selection Scheme in Heterogeneous Wireless Networks. [Citation Graph (, )][DBLP]


  99. Best permutation: a novel network selection scheme in heterogeneous wireless networks. [Citation Graph (, )][DBLP]


  100. An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. [Citation Graph (, )][DBLP]


  101. Efficient Algorithms for the Closest String and Distinguishing String Selection Problems. [Citation Graph (, )][DBLP]


  102. Novel MAP Selection Scheme Using Location History in Hierarchical MIPv6 Networks. [Citation Graph (, )][DBLP]


  103. Space Efficient Algorithms for Ordered Tree Comparison. [Citation Graph (, )][DBLP]


  104. Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. [Citation Graph (, )][DBLP]


  105. Identification of linked regions using high-density SNP genotype data in linkage analysis. [Citation Graph (, )][DBLP]


  106. Linked region detection using high-density SNP genotype data via the minimum recombinant model of pedigree haplotype inference. [Citation Graph (, )][DBLP]


  107. An improved randomized approximation algorithm for maximum triangle packing. [Citation Graph (, )][DBLP]


  108. On bipartite graphs with minimal energy. [Citation Graph (, )][DBLP]


  109. Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646] [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.613secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002